Documents
Authors
Tables
Log in
Sign up
MetaCart
DMCA
Donate
Documents:
Advanced Search
Include Citations
Authors:
Advanced Search
Include Citations |
Disambiguate
Tables:
DMCA
A fully homomorphic encryption scheme (2009)
Cached
Download Links
[crypto.stanford.edu]
[crypto.stanford.edu]
Save to List
Add to Collection
Correct Errors
Monitor Changes
by Craig Gentry
Citations:
198 - 9 self
Summary
Citations
Active Bibliography
Co-citation
Clustered Documents
Version History
Citations
1506
A public key cryptosystem and a signature scheme based on discrete logarithms
- ElGamal - 1985
1373
Probabilistic Encryption
- Goldwasser, Micali - 1984
981
Public-key cryptosystems based on composite residuosity classes
- Paillier - 1999
955
Factoring Polynomials with Rational Coefficients
- Lenstra, Lenstra, et al. - 1982
854
Pseudo-random generation from one-way functions
- Impagliazzo, Levin, et al. - 1989
793
Proof verification and hardness of approximation problems
- Arora, Lund, et al. - 1992
635
Fully homomorphic encryption using ideal lattices
- Gentry
617
How to play any mental game or a completeness theorem for protocols with honest majority
- Goldreich, Micali, et al. - 1987
533
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
- Cramer, Shoup - 1998
474
Nonmalleable cryptography
- Dolev, Dwork, et al.
340
On the (im)possibility of obfuscating programs
- Barak, Goldreich, et al. - 2001
308
On Lovsz’ lattice reduction and the nearest lattice point problem, Combinatorica 6
- Babai - 1986
305
Software protection and simulation on oblivious rams
- Goldreich, Ostrovsky - 1996
286
The random oracle methodology, revisited
- Canetti, Goldreich, et al. - 1998
279
Public-key cryptosystems provably secure against chosen ciphertext attacks
- Naor, Yung - 1990
268
Bounded-width polynomial-size branching programs recognize exactly those languages in NC
- Barrington - 1989
261
Receipt-free secret-ballot elections
- Benaloh, Tuinstra - 1994
249
Foundations of Cryptography
- Goldreich - 1989
245
A public-key cryptosystem with worst-case/average-case equivalence
- Ajtai, Dwork - 1997
229
Evaluating 2-DNF Formulas on Ciphertexts
- Boneh, Goh, et al.
211
A sieve algorithm for the shortest lattice vector problem
- Ajtai, Kumar, et al. - 2001
203
A new public-key cryptosystem as secure as factoring
- Okamoto, Uchiyama - 1998
187
Trapdoors for hard lattices and new cryptographic constructions
- Gentry, Peikert, et al. - 2008
187
Probabilistic encryption and how to play mental poker keeping secret all partial information
- Goldwasser, Micali - 1982
172
A note on efficient zero-knowledge proofs and arguments (extended abstract
- Kilian - 1992
161
M.: Divertible protocols and atomic proxy cryptography
- Blaze, Bleumer, et al. - 1998
161
Multiparty computation from threshold homomorphic encryption
- Cramer, Damgard, et al. - 2001
151
On the security of joint signature and encryption
- An, Dodis, et al. - 2002
146
Public-Key Cryptosystems from Lattice Reduction Problems
- Goldreich, Goldwasser, et al. - 1997
141
Generating hard instances of lattice problems (extended abstract
- Ajtai - 1996
130
Public-key Encryption in a Multi-User Setting: Security Proofs and Improvements
- Bellare, Boldyreva, et al.
128
Worst-case to average-case reductions based on gaussian measures
- Micciancio, Regev
108
New bounds in some transference theorems in the geometry of numbers
- Banaszczyk - 1993
103
An oblivious transfer protocol with log-squared communication
- Lipmaa - 2005
88
NTRU: a ring based public key cryptosystem
- Hoffstein, Pipher, et al. - 1998
87
A new public key cryptosystem based on higher residues
- Naccache, Stern - 1998
77
Subquadratic-time factoring of polynomials over
- Kaltofen, Shoup - 1998
74
Circular-secure encryption from decision diffie-hellman
- Boneh, Halevi, et al. - 2008
71
compact knapsacks, cyclic lattices, and efficient one-way functions
- Micciancio - 2007
69
Geometric complexity theory. I. An approach to the P vs. NP and related problems
- Mulmuley, Sohoni - 2001
67
Encryption-scheme security in the presence of key-dependent messages
- Black, Rogaway, et al.
67
Hard-core predicates for any one-way function
- Goldreich, Levin - 1989
66
Private information retrieval by keywords
- Chor, Gilboa, et al. - 1997
64
Lattice attacks on ntru
- Coppersmith, Shamir - 1997
64
Collision-free hashing from lattice problems
- Goldreich, Goldwasser, et al. - 1996
63
Generating hard instances of the short basis problem
- Ajtai - 1999
63
Chosen-ciphertext secure proxy reencryption[C]//Proceedings of the 14th ACM conference on Computer and communications security
- Canetti, Hohenberger
63
Communication Preserving Protocols for Secure Function Evaluation
- Naor, Nissim - 2001
58
Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
- Bellare, Sahai - 1999
57
Quantum algorithms for some hidden shift problems
- Hallgren, Ip, et al. - 2003
57
Generalized compact knapsacks are collision resistant
- Lyubashevsky, Micciancio - 2006
55
An improved worst-case to average-case connection for lattice problems
- Cai, Nerurkar - 1997
54
The rise and fall of knapsack cryptosystems
- Odlyzko - 1989
53
One-time programs
- Goldwasser, Kalai, et al. - 2008
53
Perfect non-interactive zero knowledge for NP
- Groth, Ostrovsky, et al. - 2006
49
A Survey of Parallel Algorithms for Shared- U Memory Machines
- Karp, Ramachandran - 1990
47
Seev: Processing Encrypted Data
- Ahituv, Lapid, et al. - 1987
46
Speeding up secret computations with insecure auxiliary devices
- Matsumoto, Kato, et al. - 1988
46
Private searching on streaming data
- Ostrovsky, Skeith - 2005
41
Joint encryption and message-efficient secure computation
- Franklin, Haber - 1996
39
Relaxing chosen-ciphertext security
- Canetti, Krawczyk, et al. - 2003
39
Improving lattice based cryptosystems using the Hermite normal form
- Micciancio - 2001
35
A length-flexible threshold cryptosystem with applications
- Damgård, Jurik - 2003
35
Universally composable efficient multiparty computation from threshold homomorphic encryption
- Damg̊ard, Nielsen
33
On the (Im)Possibility of Key Dependent Encryption
- Haitner, Holenstein - 2008
32
Evaluating branching programs on encrypted data
- Ishai, Paskin - 2007
31
Key recovery and message attack on NTRU-composite
- Gentry
29
On privacy homomorphisms
- Brickell, Yacobi - 1988
28
Asymptotically efficient lattice-based digital signatures
- Lyubashevsky, Micciancio - 2008
27
Security under key-dependent inputs
- Halevi, Krawczyk
25
D.: On the multiplicative complexity of Boolean functions over the basis
- Boyar, Peralta, et al. - 2000
24
Efficient generation of shared RSA
- Boneh, Franklin - 1997
22
Minimal-latency secure function evaluation
- Beaver - 2000
22
The beguin-quisquater server-aided RSA protocol from crypto’95 is not secure
- Nguyen, Stern - 1998
20
Multi-bit cryptosystems based on lattice problems
- Kawachi, Tanaka, et al. - 2007
18
Securely Obfuscating Re-encryption
- Hohenberger, Rothblum, et al. - 2007
16
Combinatorial cryptosystems galore
- Fellows, Koblitz - 1993
14
Improved Efficient Arguments
- Kilian - 1995
13
A new approach for algebraically homomorphic encryption, Cryptology ePrint Archive
- Armknecht, Sadeghi
12
Searching for Elements in Black-Box Fields and Applications. Crypto ’96
- Boneh, Lipton
12
Improved cryptographic hash functions with worst-case/average-case connection
- Micciancio - 2002
11
Generating random factored numbers, easily
- Kalai
10
On the minimum distance of some quadratic residue codes
- Coppersmith, Seroussi - 1984
10
Lattice-based homomorphic encryption of vector spaces
- Melchor, Castagnos, et al. - 2008
9
Black-box extension fields and the inexistence of field-homomorphic one-way permutations
- Maurer, Raub - 2007
8
Attacking a polynomial-based cryptosystem: Polly Cracker
- Steinwandt, Geiselmann, et al. - 2002
8
Neuer Beweis des Primzahlsatzes und Beweis des Primidealsatzes
- Landau - 1903
8
Two — A New Algebraic Polynomial-Based Public-Key Scheme
- Ly, “Polly - 2006
8
Multi-round passive attacks on server-aided RSA protocols
- Merkle - 2000
7
Private use of untrusted web servers via opportunistic encryption
- Christodorescu - 2008
7
A Polly Cracker System Based on Satisfiability
- Levy-dit-Vehel, Perret
6
Steinwandt R., “Cryptanalysis of Polly Cracker
- Geiselmann
4
Kharchenko: Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem
- Goldwasser, D
4
Additive Homomorphic Encryption with tOperand Multiplications
- Melchor, Gaborit, et al. - 2008
3
A Survey On Polly Cracker Systems
- Levy-dit-Vehel, Marinari, et al.
2
A public-key cryptosystem based on Polly Cracker
- Ly - 2002
1
Dijk Interval Obfuscation. To be published as an MIT-CSAIL
- van - 2009
1
On the Complexity of Mixed Discriminants and Related Problems
- Gurvitz
1
Cryptanalysis of NTRU-107, manuscript
- May - 1999
1
On the Insecurity of Some Server-Aided
- Nguyen, Shparlinski