Craig Gentry
Craig Gentry
Research Fellow, Algorand Foundation
Geverifieerd e-mailadres voor algorand.foundation
Titel
Geciteerd door
Geciteerd door
Jaar
Fully homomorphic encryption using ideal lattices
C Gentry
Proceedings of the 41st annual ACM symposium on Theory of computing, 169-178, 2009
8213*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
22632003
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
21932008
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
21792010
Hierarchical ID-based cryptography
C Gentry, A Silverberg
International conference on the theory and application of cryptology and …, 2002
15832002
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
12962016
Collusion resistant broadcast encryption with short ciphertexts and private keys
D Boneh, C Gentry, B Waters
Annual international cryptology conference, 258-275, 2005
12882005
Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based
C Gentry, A Sahai, B Waters
Annual Cryptology Conference, 75-92, 2013
12582013
Non-interactive verifiable computing: Outsourcing computation to untrusted workers
R Gennaro, C Gentry, B Parno
Annual Cryptology Conference, 465-482, 2010
12502010
Fully homomorphic encryption without bootstrapping
C Gentry
1249*2011
Implementing gentry’s fully-homomorphic encryption scheme
C Gentry, S Halevi
Annual international conference on the theory and applications of …, 2011
12052011
Practical identity-based encryption without random oracles
C Gentry
Annual international conference on the theory and applications of …, 2006
9712006
Pinocchio: Nearly practical verifiable computation
B Parno, J Howell, C Gentry, M Raykova
2013 IEEE Symposium on Security and Privacy, 238-252, 2013
9352013
Homomorphic evaluation of the AES circuit
C Gentry, S Halevi, NP Smart
Annual Cryptology Conference, 850-867, 2012
8402012
Candidate multilinear maps from ideal lattices
S Garg, C Gentry, S Halevi
Annual International Conference on the Theory and Applications of …, 2013
8132013
Computing arbitrary functions of encrypted data
C Gentry
Communications of the ACM 53 (3), 97-105, 2010
7372010
Certificate-based encryption and the certificate revocation problem
C Gentry
International Conference on the Theory and Applications of Cryptographic …, 2003
7032003
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
6822013
Fully homomorphic encryption with polylog overhead
C Gentry, S Halevi, NP Smart
Annual International Conference on the Theory and Applications of …, 2012
5682012
Separating succinct non-interactive arguments from all falsifiable assumptions
C Gentry, D Wichs
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
4072011
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20