Craig Gentry
Craig Gentry
Research Fellow, Algorand Foundation
Verifierad e-postadress på algorand.foundation
Titel
Citeras av
Citeras av
År
Fully homomorphic encryption using ideal lattices
C Gentry
Proceedings of the 41st annual ACM symposium on Theory of computing, 169-178, 2009
6982*2009
Aggregate and verifiably encrypted signatures from bilinear maps
D Boneh, C Gentry, B Lynn, H Shacham
International Conference on the Theory and Applications of Cryptographic …, 2003
20312003
Fully homomorphic encryption over the integers
M Van Dijk, C Gentry, S Halevi, V Vaikuntanathan
Annual International Conference on the Theory and Applications of …, 2010
19142010
Trapdoors for hard lattices and new cryptographic constructions
C Gentry, C Peikert, V Vaikuntanathan
Proceedings of the fortieth annual ACM symposium on Theory of computing, 197-206, 2008
18722008
Hierarchical ID-based cryptography
C Gentry, A Silverberg
International conference on the theory and application of cryptology and …, 2002
14892002
Collusion resistant broadcast encryption with short ciphertexts and private keys
D Boneh, C Gentry, B Waters
Annual international cryptology conference, 258-275, 2005
12032005
Candidate indistinguishability obfuscation and functional encryption for all circuits
S Garg, C Gentry, S Halevi, M Raykova, A Sahai, B Waters
SIAM Journal on Computing 45 (3), 882-929, 2016
11342016
Non-interactive verifiable computing: Outsourcing computation to untrusted workers
R Gennaro, C Gentry, B Parno
Annual Cryptology Conference, 465-482, 2010
11082010
Implementing gentry’s fully-homomorphic encryption scheme
C Gentry, S Halevi
Annual international conference on the theory and applications of …, 2011
10592011
Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based
C Gentry, A Sahai, B Waters
Annual Cryptology Conference, 75-92, 2013
10262013
Fully homomorphic encryption without bootstrapping
C Gentry
1012*2011
Practical identity-based encryption without random oracles
C Gentry
Annual International Conference on the Theory and Applications of …, 2006
9112006
Candidate multilinear maps from ideal lattices
S Garg, C Gentry, S Halevi
Annual International Conference on the Theory and Applications of …, 2013
7452013
Homomorphic evaluation of the AES circuit
C Gentry, S Halevi, NP Smart
Annual Cryptology Conference, 850-867, 2012
7152012
Pinocchio: Nearly practical verifiable computation
B Parno, J Howell, C Gentry, M Raykova
2013 IEEE Symposium on Security and Privacy, 238-252, 2013
6912013
Certificate-based encryption and the certificate revocation problem
C Gentry
International Conference on the Theory and Applications of Cryptographic …, 2003
6532003
Computing arbitrary functions of encrypted data
C Gentry
Communications of the ACM 53 (3), 97-105, 2010
6492010
Quadratic span programs and succinct NIZKs without PCPs
R Gennaro, C Gentry, B Parno, M Raykova
Annual International Conference on the Theory and Applications of …, 2013
5072013
Fully homomorphic encryption with polylog overhead
C Gentry, S Halevi, NP Smart
Annual International Conference on the Theory and Applications of …, 2012
5062012
Single-database private information retrieval with constant communication rate
C Gentry, Z Ramzan
International Colloquium on Automata, Languages, and Programming, 803-815, 2005
3532005
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20