A Review of Homomorphic Encryption Libraries for Secure Computation

Ronald L Rivest, Adi Shamir, and Len Adleman, A Method for Obtaining Digital Signatures and Public-key Cryptosystems, Communications of the ACM 21, 2, pp. 120–126 https://people.csail.mit.edu/rivest/Rsapaper.pdf , 1978

1978

Earlier work this paper cites.

Andrew C. Yao, Protocols for Secure Computations, University of California Berkeley, California, IEEE Foundations of Computer Science, 23rd Annual Symposium on, https://research.cs.wisc.edu/areas/sec/yao1982-ocr.pdf , 1982

1982

Earlier work this paper cites.

Shafi Goldwasser and Silvio Micali, Probabilistic encryption & how to play mental poker keeping secret all partial information, Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing. ACM, pp. 365–377, 1982

1982

Earlier work this paper cites.

Taher ElGamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Transactions in Information Theory, Vol 31, pp. 469-472, 1985

1985

Earlier work this paper cites.

Josh Daniel Cohen Benaloh, Verifiable secret-ballot elections, Thesis, Yale University, Department of Computer Science, https://www.microsoft.com/en-us/research/wp-content/uploads/1987/01/thesis.pdf , 1987

1987

Earlier work this paper cites.

Josh Benaloh, ‘Dense probabilistic encryption’ Proceedings of the Workshop on Selected Areas of Cryptography, pp. 120–128. http://sancy.univ-bpclermont.fr/~lafourcade//PAPERS/FLA11.pdf , 1994

1994

Earlier work this paper cites.

David Naccache and Jacques Stern, A New Public Key Cryptosystem Based on Higher Residues, Proceedings of the 5th ACM Conference on Computer and Communications Security, ACM, pp. 59–66, 1998

1998

Earlier work this paper cites.

Tatsuaki Okamoto and Shigenori Uchiyama, A New public-key cryptosystem as secure as factoring, In Advances in Cryptology—EUROCRYPT ’98. Springer, pp. 308–318, https://link.springer.com/chapter/10.1007/BFb0054135 , 1998

1998

Earlier work this paper cites.

T. Sander, A. Young, and M. Yung, Non-interactive Cryptocomputing for NC SUP1, IEEE Foundations of Computer Science, 40th Annual Symposium on, pp. 554–566 http://dx.doi.org/10.1109/SFFCS.1999.814630 , 1999

1999

Earlier work this paper cites.

Pascal Paillier, Public-key Cryptosystems Based on Composite Degree Residuosity Classes, Advances in cryptology—EUROCRYPT ‘99. Springer, pp. 223–238, 1999

1999

Earlier work this paper cites.

Ivan Damgård and Mads Jurik, A Generalisation, a Simplification and Some Applications of Paillier’s Probabilistic Public-key System, Public Key Cryptography, International Workshop on Public Key Cryptography, Springer, pp. 119–136, 2001

2001

Cited alongside, same era.

Steven D Galbraith, Elliptic Curve Paillier schemes, Journal of Cryptology 15, 2, pp. 129–138, 2002

2002

Cited alongside, same era.

Fraleigh, J. B., A First Course in Abstract Algebra, 7th edition, Addison-Wesley, 2002

2002

Cited alongside, same era.

Dan Boneh, Eu-Jin Goh, and Kobbi Nissim, Evaluating 2-DNF Formulas on Ciphertexts, Theory of Cryptography. Springer, pp. 325–341, https://crypto.stanford.edu/~dabo/papers/2dnf.pdf , 2006

2006

Cited alongside, same era.

Yuval Ishai and Anat Paskin, Evaluating Branching Programs on Encrypted Data, Theory of Cryptography, Springer, pp. 575–594. https://www.iacr.org/archive/tcc2007/43920574/43920574.pdf , 2007

Miran Kim and Kristin E. Lauter, Private Genome Analysis through Homomorphic Encryption, BMC medical informatics and decision making 15 Suppl 5 S3, 2015

2015

Later among the works it cites.

Ilaria Chillotti, Nicolas Gama, Mariya Georgieva and Malika Izabachène, Faster Fully Homomorphic Encryption: Bootstrapping [ 1 ] in less than 0.1 Seconds, Cryptology ePrint Archive Report 2016/870, https://eprint.iacr.org/2016/870 , 2016

2016

Later among the works it cites.

Ilaria Chillotti, Nicolas Gama, Mariya Georgieva and Malika Izabachène, Improving TFHE: Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping, Cryptology ePrint Archive Report 2017/430, https://eprint.iacr.org/2017/430 , 2017

2017

Later among the works it cites.

Kim Laine, Simple Encrypted Arithmetic Library 2.3.1, Microsoft Research https://www.microsoft.com/en-us/research/uploads/prod/2017/11/sealmanual-2-3-1.pdf , 2017

2017

Later among the works it cites.