[Previous] Pwn2Own hacker contest - DOE CISO on encryption - Security ...

 [Next] McCain Gets Tough on Border Security | FrumForum...

Some related posts from Technorati and Google.

[CSE Undergrad News] CSE Undergrad News » Side Channels and Clouds: New Challenges in ...: Such leakage betrays information about the secrets stored within the devices, and has been successfully utilized to break many cryptographic algorithms in common use. These attacks, commonly called side-channel attacks, are particularly easy to carry out when the device is in the physical proximity of the attacker, as is often the case for modern devices such as smart-cards, TPM chips, mobile phones and laptops.

[CodeGear TeamB Blogs Master Site Feed] What is Homomorphic Encryption, and Why Should I Care?: That property, in simple terms, is the ability to perform computations on the ciphertext without decrypting it first. Because this tends to sound either baffling or miraculous the first time you hear it, let’s begin with a very simple example.

[Cryptology ePrint Archive] Cryptology ePrint Archive: Report 2009/616: Abstract: We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry's technique to construct fully homomorphic scheme from a "bootstrappable"

[Random bits] (More) fully homomorphic encryption? « Random bits: I was asked recently whether fully homomorphic encryption would become remotely practical within the next 10 years. While it’s still too early to say for sure, the fact that there are (at least) two relatively quick improvements to the original scheme gives hope.

[Cryptology ePrint Archive] Cryptology ePrint Archive: Report 2009/571: Our construction follows that of Gentry by producing a fully homomorphic scheme from a “somewhat” homomorphic scheme. For the somewhat homomorphic scheme the public and private keys consist of two large integers (one of which is shared by both the public and private key) and the ciphertext consists of one large integer.

[FXPAL Blog] How to compute without knowing anything: Gentry realized that instead of directly creating a more powerful scheme, he could build one from a weakly homomorphic scheme, if that scheme’s decryption circuit were sufficiently simple. More specifically, he saw that he could build a fully homomorphic scheme from any scheme that could homomorphically compute a slightly augmented version of its own decryption circuit.

[阳光撒在脸上] Homomorphic encryption - 东方红的日志- 网易博客: for more than 30 years, it was unclear whether fully homomorphic encryption was even possible. During this period, the best result was the Boneh-Goh-Nissim cryptosystem which supports evaluation of an unlimited number of addition operations but at most one multiplication.

[我的博客] 2010欧密会接受论文- lxd的日志- 网易博客: Computational soundness, co-induction, and encryption cycles,. Daniele Micciancio. Fully homomorphic encryption over the integers,. Marten van Dijk,; Craig Gentry,; Shai Halevi,; Vinod Vaikuntanathan. ... this.p={ m:2, b:2, id:' fks_080066093081085065092084084095086082084070080084083065', blogTitle:'2010欧密会接受论文', blogUrl:'blog/static/24554252201021891411962', isPublished:1, istop:false, type:0, modifyTime:0, permalink:'blog/static/24554252201021891411962', ...

[Appregatta Blog] Encryption is the Key to Cloud Computing Security: In his post, Alex Wolfe mentions a new type of encryption invented by IBM. “Privacy homomorphism,” or “fully homomorphic encryption” allows encrypted data to be used for analytics, meaning that reports can be run without a human able to .

[eric the fruitbat] eric the fruitbat » Fully Homomorphic Encryption: First, in what might or might not turn out to be the biggest cryptographic breakthrough in decades, Craig Gentry has proposed a fully homomorphic encryption scheme based on ideal lattices: that is, a scheme that lets you perform arbitrary computations on encrypted data without decrypting it. Currently, Gentry’s scheme is not known to be breakable even by quantum computers””despite a 2002 result of van Dam, Hallgren, and Ip, which said that if a fully homomorphic encryption scheme existed, then it could be broken by a quantum computer.

[FXPAL Blog] Quantum inspired classical results: The quantum-reduction technique used in Gentry’s paper is actually due to Oded Regev, from his paper “On lattices, learning with errors, random linear codes, and cryptography.” Gentry then uses Regev’s algorithm as a “black-box”

Reflected tags on Technorati: Blog, Encryption, Global Security Watch