Fetching the paper…
Reading the bibliography…
Legacy encryption systems depend on sharing a key (public or private) among the peers involved in exchanging an encrypted message.
Geometrie der zahlen
Hermann Minkowski. 1968 · 1968
Earlier work this paper cites.
New directions in cryptography
Whitfield Diffie and Martin E Hellman. 1976 · 1976
Earlier work this paper cites.
On data banks and privacy homomorphisms
Ronald L Rivest, Len Adleman, and Michael L Dertouzos. 1978a · 1978
Earlier work this paper cites.
A method for obtaining digital signatures and public-key cryptosystems
Ronald L Rivest, Adi Shamir, and Len Adleman. 1978b · 1978
Earlier work this paper cites.
Probabilistic encryption & how to play mental poker keeping secret all partial information. In Proceedings of the fourteenth annual ACM symposium on Theory of computing
Shafi Goldwasser and Silvio Micali. 1982 · 1982
Earlier work this paper cites.
Factoring polynomials with rational coefficients
Arjen Klaas Lenstra, Hendrik Willem Lenstra, and László Lovász. 1982 · 1982
Earlier work this paper cites.
Protocols for secure computations. In FOCS
Andrew Chi-Chih Yao. 1982 · 1982
Earlier work this paper cites.
A public key cryptosystem and a signature scheme based on discrete logarithms. In Advances in cryptology
Taher ElGamal. 1985 · 1985
Earlier work this paper cites.
Verifiable secret-ballot elections
Josh Daniel Cohen Benaloh. 1987 · 1987
Earlier work this paper cites.
The Generic Composite Residuosity Problem
Tibor Jager. 2012 · 1990
Earlier work this paper cites.
The discrete logarithm problem
S McCURLEY Kevin. 1990 · 1990
Earlier work this paper cites.
Dense probabilistic encryption. In Proceedings of the workshop on selected areas of cryptography
Josh Benaloh. 1994 · 1994
Earlier work this paper cites.
Combinatorial cryptosystems galore!
Michael Fellows and Neal Koblitz. 1994 · 1994
Earlier work this paper cites.
A survey of modern integer factorization algorithms
Peter L Montgomery. 1994 · 1994
Earlier work this paper cites.
Finite fields: theory, applications, and algorithms
Gary L Mullen and Peter Jau-Shyong Shiue. 1994 · 1994
Earlier work this paper cites.
Generating hard instances of lattice problems. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Miklós Ajtai. 1996 · 1996
Earlier work this paper cites.
A new privacy homomorphism and applications
Josep Domingo i Ferrer. 1996 · 1996
Earlier work this paper cites.
A secure and optimally efficient multi-authority election scheme
Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers. 1997 · 1997
Earlier work this paper cites.
Public-key cryptosystems from lattice reduction problems
Oded Goldreich, Shafi Goldwasser, and Shai Halevi. 1997 · 1997
Earlier work this paper cites.
Replication is not needed: Single database, computationally-private information retrieval. In focs
Eyal Kushilevitz and Rafail Ostrovsky. 1997 · 1997
Earlier work this paper cites.
NTRU: A ring-based public key cryptosystem
Jeffrey Hoffstein, Jill Pipher, and Joseph H Silverman. 1998 · 1998
Earlier work this paper cites.
A new public key cryptosystem based on higher residues. In Proceedings of the 5th ACM conference on Computer and communications security
David Naccache and Jacques Stern. 1998 · 1998
Earlier work this paper cites.
A new public-key cryptosystem as secure as factoring
Tatsuaki Okamoto and Shigenori Uchiyama. 1998 · 1998
Earlier work this paper cites.
Public-key cryptosystems based on composite degree residuosity classes. In Advances in cryptology—EUROCRYPT’99
Pascal Paillier. 1999 · 1999
Earlier work this paper cites.
Non-interactive cryptocomputing for NC1. In Foundations of Computer Science, 1999. 40th Annual Symposium on
T. Sander, A. Young, and M. Yung. 1999 · 1999
Earlier work this paper cites.
A generalisation, a simpli. cation and some applications of paillier’s probabilistic public-key system. In Public Key Cryptography
Ivan Damgård and Mads Jurik. 2001 · 2001
Earlier work this paper cites.
A provably secure additive and multiplicative privacy homomorphism*
Josep Domingo-Ferrer. 2002 · 2002
Earlier work this paper cites.
Elliptic curve Paillier schemes
Steven D Galbraith. 2002 · 2002
Earlier work this paper cites.
Cryptanalysis of Polly cracker
Rainer Steinwandt and Willi Geiselmann. 2002 · 2002
Earlier work this paper cites.
Polly two-a public key cryptosystem based on Polly cracker
Van-Ly Le. 2003 · 2003
Earlier work this paper cites.
Cryptanalysis of an algebraic privacy homomorphism
David Wagner. 2003 · 2003
Earlier work this paper cites.
Subgroup membership problems and public key cryptosystems
Kristian Gjøsteen. 2004 · 2004
Earlier work this paper cites.
A Polly Cracker system based on satisfiability
Françoise Levy-dit Vehel and Ludovic Perret. 2004 · 2004
Earlier work this paper cites.
Evaluating 2-DNF formulas on ciphertexts
Dan Boneh, Eu-Jin Goh, and Kobbi Nissim. 2005 · 2005
Earlier work this paper cites.
The Design and Implementation of FFTW3
Matteo Frigo and Steven G. Johnson. 2005 · 2005
Earlier work this paper cites.
Quadratic Residuosity Problem
Burt Kaliski. 2005 · 2005
Earlier work this paper cites.
Optimizations of Brakerski’s fully homomorphic encryption scheme. In Computer Science and Network Technology (ICCSNT), 2012 2nd International Conference on
Ting Wu, Hui Wang, and You-Ping Liu. 2012 · 2005
Earlier work this paper cites.
Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
Jung Hee Cheon, Woo-Hwan Kim, and Hyun Soo Nam. 2006 · 2006
Earlier work this paper cites.
Homomorphic public-key cryptosystems and encrypting boolean circuits
Dima Grigoriev and Ilia Ponomarenko. 2006 · 2006
Earlier work this paper cites.
Lattice-based cryptography
Oded Regev. 2006 · 2006
Earlier work this paper cites.
Polly Two: a new algebraic polynomial-based public-key scheme
Le Van Ly. 2006 · 2006
Earlier work this paper cites.
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
Su-Jeong Choi, Simon R Blackburn, and Peter R Wild. 2007 · 2007
Earlier work this paper cites.
A survey of homomorphic encryption for nonspecialists
Caroline Fontaine and Fabien Galand. 2007 · 2007
Earlier work this paper cites.
Evaluating branching programs on encrypted data
Yuval Ishai and Anat Paskin. 2007 · 2007
Earlier work this paper cites.
Multi-bit cryptosystems based on lattice problems
Akinori Kawachi, Keisuke Tanaka, and Keita Xagawa. 2007 · 2007
Earlier work this paper cites.
MTH 581-582 Introduction to Abstract Algebra
DS Malik, John N Mordeson, and MK Sen. 2007 · 2007
Earlier work this paper cites.
An introduction to mathematical cryptography
Jeffrey Hoffstein, Jill Pipher, Joseph H Silverman, and Joseph H Silverman. 2008 · 2008
Earlier work this paper cites.
Lattice-based homomorphic encryption of vector spaces. In Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Carlos Aguilar Melchor, Guilhem Castagnos, and Philippe Gaborit. 2008 · 2008
Earlier work this paper cites.
Advances in Homomorphic Cryptosystems
Mufutau Akinwande. 2009 · 2009
Earlier work this paper cites.
A fully homomorphic encryption scheme
Craig Gentry. 2009 · 2009
Earlier work this paper cites.
A survey on Polly Cracker systems
Françoise Levy-dit Vehel, Maria Grazia Marinari, Ludovic Perret, and Carlo Traverso. 2009 · 2009
Earlier work this paper cites.
Lattice-based cryptography
Daniele Micciancio and Oded Regev. 2009 · 2009
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev. 2009 · 2009
Earlier work this paper cites.
Toward basing fully homomorphic encryption on worst-case hardness
Craig Gentry. 2010 · 2010
Earlier work this paper cites.
A simple BGN-type cryptosystem from LWE
Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. 2010 · 2010
Earlier work this paper cites.
Additively homomorphic encryption with d-operand multiplications
Carlos Aguilar Melchor, Philippe Gaborit, and Javier Herranz. 2010 · 2010
Earlier work this paper cites.
An improvement of key generation algorithm for Gentry’s homomorphic encryption scheme
Naoki Ogura, Go Yamamoto, Tetsutaro Kobayashi, and Shigenori Uchiyama. 2010 · 2010
Earlier work this paper cites.
Fully homomorphic encryption with relatively small key and ciphertext sizes
Nigel P Smart and Frederik Vercauteren. 2010 · 2010
Earlier work this paper cites.
Faster fully homomorphic encryption
Damien Stehlé and Ron Steinfeld. 2010 · 2010
Earlier work this paper cites.
A ciphertext-only attack on Polly Two
Rainer Steinwandt. 2010 · 2010
Earlier work this paper cites.
Fully homomorphic encryption over the integers
Marten Van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. 2010 · 2010
Earlier work this paper cites.
Polly cracker, revisited
Martin Albrecht, Pooya Farshim, Jean-Charles Faugere, and Ludovic Perret. 2011 · 2011
Cited alongside, same era.
Fully Homomorphic Encryption without Bootstrapping
Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2011 · 2011
Cited alongside, same era.
Fully homomorphic encryption from ring-LWE and security for key dependent messages
Zvika Brakerski and Vinod Vaikuntanathan. 2011 · 2011
Cited alongside, same era.
Fully homomorphic encryption over the integers with shorter public keys
Jean-Sébastien Coron, Avradip Mandal, David Naccache, and Mehdi Tibouchi. 2011 · 2011
Cited alongside, same era.
Implementing Gentry’s fully-homomorphic encryption scheme
Craig Gentry and Shai Halevi. 2011 · 2011
Cited alongside, same era.
On the sparse subset sum problem from Gentry-Halevi’s implementation of fully homomorphic encryption
Moon Sung Lee. 2011 · 2011
Accelerating NTRU based homomorphic encryption using GPUs. In High Performance Extreme Computing Conference (HPEC), 2014 IEEE
Wei Dai, Yarkın Doröz, and Berk Sunar. 2014 · 2014
Later among the works it cites.
Homomorphic AES Evaluation using NTRU
Yarkın Doröz, Yin Hu, and Berk Sunar. 2014 · 2014
Later among the works it cites.
Toward practical homomorphic evaluation of block ciphers using prince
Yarkın Doröz, Aria Shahverdi, Thomas Eisenbarth, and Berk Sunar. 2014 · 2014
Later among the works it cites.
Computing on the edge of chaos: Structure and randomness in encrypted computation. In Electronic Colloquium on Computational Complexity (ECCC)
Craig Gentry. 2014 · 2014
Later among the works it cites.
Algorithms in helib
Shai Halevi and Victor Shoup. 2014 · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
On CCA-secure somewhat homomorphic encryption. In Selected Areas in Cryptography
Jake Loftus, Alexander May, Nigel P Smart, and Frederik Vercauteren. 2011 · 2011
Cited alongside, same era.
Can homomorphic encryption be practical?. In Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Michael Naehrig, Kristin Lauter, and Vinod Vaikuntanathan. 2011 · 2011
Cited alongside, same era.
Homomorphic encryption: From private-key to public-key
Ron Rothblum. 2011 · 2011
Cited alongside, same era.
Improved key generation for Gentry’s fully homomorphic encryption Scheme
Peter Scholl and Nigel P Smart. 2011 · 2011
Cited alongside, same era.
Fully Homomorphic SIMD Operations
N.P. Smart and F. Vercauteren. 2011 · 2011
Cited alongside, same era.
Making NTRU as secure as worst-case problems over ideal lattices
Damien Stehlé and Ron Steinfeld. 2011 · 2011
Cited alongside, same era.
Darko Hrestak and Stjepan Picek. 2014 · 2014
Later among the works it cites.
A comparison of the homomorphic encryption schemes FV and YASHE
Tancrède Lepoint and Michael Naehrig. 2014 · 2014
Later among the works it cites.
Reuse it or lose it: More efficient secure computation through reuse of encrypted values. In Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security
Benjamin Mood, Debayan Gupta, Kevin Butler, and Joan Feigenbaum. 2014 · 2014
Later among the works it cites.
Accelerating integer-based fully homomorphic encryption using Comba multiplication. In Signal Processing Systems (SiPS), 2014 IEEE Workshop on
Ciara Moore, Maire O’Neill, Neil Hanley, and Elizabeth O’Sullivan. 2014a · 2014
Later among the works it cites.
Practical homomorphic encryption: A survey. In Circuits and Systems (ISCAS), 2014 IEEE International Symposium on
Ciara Moore, Maire O’Neill, Elizabeth O’Sullivan, Yarkın Doröz, and Berk Sunar. 2014b · 2014
Later among the works it cites.
A Simple Framework for Noise-Free Construction of Fully Homomorphic Encryption from a Special Class of Non-Commutative Groups
Koji Nuida. 2014 · 2014
Later among the works it cites.
Survey of Various Homomorphic Encryption algorithms and Schemes
Payal V Parmar, Shraddha B Padhar, Shafika N Patel, Niyatee I Bhatt, and Rutvij H Jhaveri. 2014 · 2014
Later among the works it cites.
A practical, secure, and verifiable cloud computing for mobile systems
Sriram N Premnath and Zygmunt J Haas. 2014 · 2014
Later among the works it cites.
A scalable implementation of fully homomorphic encryption built on NTRU
Kurt Rohloff and David Bruce Cousins. 2014 · 2014
Later among the works it cites.
Fully homomorphic SIMD operations
Nigel P Smart and Frederik Vercauteren. 2014 · 2014
Later among the works it cites.
Accelerating leveled fully homomorphic encryption using GPU. In Circuits and Systems (ISCAS), 2014 IEEE International Symposium on
Wei Wang, Zhilu Chen, and Xinming Huang. 2014 · 2014
Later among the works it cites.
VLSI design of a large-number multiplier for fully homomorphic encryption
Wei Wang, Xinming Huang, Niall Emmart, and Charles Weems. 2014 · 2014
Later among the works it cites.
Efficient fully homomorphic encryption from RLWE with an extension to a threshold encryption scheme
Xiaojun Zhang, Chunxiang Xu, Chunhua Jin, Run Xie, and Jining Zhao. 2014 · 2014
Later among the works it cites.
Revisiting fully homomorphic encryption schemes and their cryptographic primitives
Zhenfei Zhang. 2014 · 2014
Later among the works it cites.
Ciphers for MPC and FHE. In Annual International Conference on the Theory and Applications of Cryptographic Techniques
Martin R Albrecht, Christian Rechberger, Thomas Schneider, Tyge Tiessen, and Michael Zohner. 2015 · 2015
Later among the works it cites.
A Guide to Fully Homomorphic Encryption
Frederik Armknecht, Colin Boyd, Christopher Carr, Kristian Gjøsteen, Angela Jäschke, Christian A Reuter, and Martin Strand. 2015 · 2015
Later among the works it cites.
Outsourcing secure two-party computation as a black box
Henry Carter, Benjamin Mood, Patrick Traynor, and Kevin Butler. 2015 · 2015
Later among the works it cites.
High-speed polynomial multiplication architecture for ring-LWE and SHE cryptosystems
Donald Donglong Chen, Nele Mentens, Frederik Vercauteren, Sujoy Sinha Roy, Ray CC Cheung, Derek Pao, and Ingrid Verbauwhede. 2015 · 2015
Later among the works it cites.
Multi-identity and multi-key leveled FHE from learning with errors. In Annual Cryptology Conference
Michael Clear and Ciarán McGoldrick. 2015 · 2015
Later among the works it cites.
Accelerating swhe based pirs using gpus. In International Conference on Financial Cryptography and Data Security
Wei Dai, Yarkın Doröz, and Berk Sunar. 2015 · 2015
Later among the works it cites.
Accelerating LTV Based Homomorphic Encryption in Reconfigurable Hardware
Yarkın Doröz, Erdinç Öztürk, Erkay Savaş, and Berk Sunar. 2015b · 2015
Later among the works it cites.
Accelerating fully homomorphic encryption in hardware
Yarkın Doröz, Erdinç Öztürk, and Berk Sunar. 2015a · 2015
Later among the works it cites.
A Fully Homomorphic Encryption library
Léo Ducas and Daniele Micciancio. 2014 · 2015
Later among the works it cites.
FHEW: Bootstrapping Homomorphic Encryption in less than a second
Léo Ducas and Daniele Micciancio. 2015 · 2015
Later among the works it cites.
An Implementation of homomorphic encryption
Shai Halevi and Victor Shoup. 2013b · 2015
Later among the works it cites.
Bootstrapping for helib
Shai Halevi and Victor Shoup. 2015 · 2015
Later among the works it cites.
Accelerating bootstrapping in FHEW using GPUs. In Application-specific Systems, Architectures and Processors (ASAP), 2015 IEEE 26th International Conference on
Moon Sung Lee, Yongje Lee, Jung Hee Cheon, and Yunheung Paek. 2015 · 2015
Later among the works it cites.
Efficient architecture and implementation for NTRUEncrypt system. In Circuits and Systems (MWSCAS), 2015 IEEE 58th International Midwest Symposium on
Bingxin Liu and Huapeng Wu. 2015 · 2015
Later among the works it cites.
Practical Fully Homomorphic Encryption without Noise Reduction
Dongxi Liu. 2015 · 2015
Later among the works it cites.
(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
Koji Nuida and Kaoru Kurosawa. 2015 · 2015
Later among the works it cites.
Accelerating somewhat homomorphic evaluation using FPGAs
E Öztürk, Yarkın Doröz, Berk Sunar, and E Savaş. 2015 · 2015
Later among the works it cites.
A decade of lattice cryptography
Chris Peikert. 2015 · 2015
Later among the works it cites.
An Implementation of the Fully Homomorphic Smart-Vercauteren Cryptosystem
Henning Perl, Michael Brenner, and Matthew Smith. 2011a · 2015
Later among the works it cites.
Accelerating Homomorphic Evaluation on Reconfigurable Hardware
Thomas Pöppelmann, Michael Naehrig, Andrew Putnam, and Adrian Macias. 2015 · 2015
Later among the works it cites.
Modular Hardware Architecture for Somewhat Homomorphic Function Evaluation
Sujoy Sinha Roy, Kimmo Järvinen, Frederik Vercauteren, Vassil Dimitrov, and Ingrid Verbauwhede. 2015 · 2015
Later among the works it cites.
Efficient Fully Homomorphic Encryption with Circularly Secure Key Switching Process
Zhou Tanping, Yang Xiaoyuan, Zhang Wei, and Wu Liqiang. 2015 · 2015
Later among the works it cites.
Exploring the feasibility of fully homomorphic encryption
Wei Wang, Yin Hu, Lianmu Chen, Xinming Huang, and Berk Sunar. 2015 · 2015
Later among the works it cites.
Notes on Two Fully Homomorphic Encryption Schemes Without Bootstrapping
Yongge Wang · 2015
Later among the works it cites.
Fully homomorphic encryption: Cryptography’s holy grail
David J Wu. 2015 · 2015
Later among the works it cites.
Fully Homomorphic Encryption without bootstrapping
Masahiro Yagisawa. 2015 · 2015
Later among the works it cites.
A subfield lattice attack on overstretched NTRU assumptions. In Annual Cryptology Conference
Martin Albrecht, Shi Bai, and Léo Ducas. 2016 · 2016
Later among the works it cites.
The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
Jung Hee Cheon, Hyunsook Hong, Moon Sung Lee, and Hansol Ryu. 2016 · 2016
Later among the works it cites.
Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In Advances in Cryptology–ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I 22
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabachène. 2016 · 2016
Later among the works it cites.
Attribute-based fully homomorphic encryption with a bounded number of inputs. In International Conference on Cryptology in Africa
Michael Clear and Ciarán McGoldrick. 2016 · 2016
Later among the works it cites.
Adaptively secure multi-party computation from lwe (via equivocal fhe)
Ivan Damgård, Antigoni Polychroniadou, and Vanishree Rao. 2016 · 2016
Later among the works it cites.
Flattening NTRU for Evaluation Key Free Homomorphic Encryption
Yarkin Doröz and Berk Sunar. 2016 · 2016
Later among the works it cites.
Algorithms for the approximate common divisor problem
Steven D Galbraith, Shishay W Gebregiyorgis, and Sean Murphy. 2016 · 2016
Later among the works it cites.
Public Challenges for Fully-Homomorphic Encryption
Shai Halevi and Nalini K. Ratha. 2011 · 2016
Later among the works it cites.
On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL. In Annual International Conference on the Theory and Applications of Cryptographic Techniques
Martin R Albrecht. 2017 · 2017
Closest in time.
Simple Encrypted Arithmetic Library
Hao Chen, Kim Laine, and Rachel Player. 2017 · 2017
Closest in time.
Homomorphic Encryption for Arithmetic of Approximate Numbers (HEANN)
Jung Hee Cheon, Andrey Kim, Miran Kim, and Yongsoo Song. 2016 · 2017
Closest in time.
TFHE: Fast Fully Homomorphic Encryption Library over the Torus
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabachène. 2017 · 2017
Closest in time.
cuHE: Homomorphic and fast
Wei Dai, Yarkın Doröz, and Berk Sunar. 2017 · 2017
Closest in time.
Simple Encrypted Arithmetic Library
Kim Laine, Hao Chen, and Rachel Player. 2017 · 2017
Closest in time.
The PALISADE Lattice Cryptography Library
Kurt Rohloff. 2017 · 2017
Closest in time.