Sciweavers

51 search results - page 1 / 11
» Efficient Public Key Encryption Based on Ideal Lattices
Sort
View
ASIACRYPT
2009
Springer
13 years 11 months ago
Efficient Public Key Encryption Based on Ideal Lattices
Damien Stehlé, Ron Steinfeld, Keisuke Tanak...
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
13 years 11 months ago
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
Craig Gentry
CRYPTO
1997
Springer
207views Cryptology» more  CRYPTO 1997»
13 years 9 months ago
Public-Key Cryptosystems from Lattice Reduction Problems
We present a new proposal for a trapdoor one-way function, from which we derive public-key encryption and digital signatures. The security of the new construction is based on the ...
Oded Goldreich, Shafi Goldwasser, Shai Halevi
CRYPTO
2011
Springer
245views Cryptology» more  CRYPTO 2011»
12 years 4 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
ACNS
2009
Springer
147views Cryptology» more  ACNS 2009»
13 years 2 months ago
Construction of Threshold Public-Key Encryptions through Tag-Based Encryptions
In this paper, we propose a notion of threshold tag-based encryption schemes that simplifies the notion of threshold identity-based encryption schemes, and we show a conversion fro...
Seiko Arita, Koji Tsurudome