Sciweavers

130 search results - page 19 / 26
» Idealizing Identity-Based Encryption
Sort
View
EUROCRYPT
2010
Springer
15 years 3 months ago
Fully Homomorphic Encryption over the Integers
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
Marten van Dijk, Craig Gentry, Shai Halevi, Vinod ...
ASIACRYPT
2010
Springer
14 years 8 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld
CRYPTO
2011
Springer
245views Cryptology» more  CRYPTO 2011»
13 years 10 months ago
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
Zvika Brakerski, Vinod Vaikuntanathan
PKC
2007
Springer
189views Cryptology» more  PKC 2007»
15 years 4 months ago
Parallel Key-Insulated Public Key Encryption Without Random Oracles
Abstract. Key-insulated cryptography is a crucial technique for protecting private keys. To strengthen the security of key-insulated protocols, Hanaoka, Hanaoka and Imai recently i...
Benoît Libert, Jean-Jacques Quisquater, Moti...
ICDCS
2010
IEEE
14 years 7 months ago
Secure Ranked Keyword Search over Encrypted Cloud Data
As Cloud Computing becomes prevalent, sensitive information are being increasingly centralized into the cloud. For the protection of data privacy, sensitive data has to be encrypte...
Cong Wang, Ning Cao, Jin Li, Kui Ren, Wenjing Lou