论文信息 - Fully Homomorphic Encryption: Cryptography's holy grail

Fully Homomorphic Encryption: Cryptography's holy grail

For more than 30 years, cryptographers have embarked on a quest to construct an encryption scheme that would enable arbitrary computation on encrypted data. Conceptually simple, yet notoriously difficult to achieve, cryptography's holy grail opens the door to many new capabilities in our cloud-centric, data-driven world.

David J. Wu

[1] M. Panella. Associate Editor of the Journal of Computer and System Sciences , 2014 .

[2] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[3] Brent Waters,et al. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based , 2013, CRYPTO.

[4] Dan Boneh,et al. Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.

[5] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[6] Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[7] Roland Sauerbrey,et al. Biography , 1992, Ann. Pure Appl. Log..

[8] Craig Gentry,et al. A fully homomorphic encryption scheme , 2009 .

[9] Ronald L. Rivest,et al. ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .

[10] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.

[11] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[12] Dan Boneh,et al. The Decision Diffie-Hellman Problem , 1998, ANTS.

[13] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.