Fetching the paper…
Reading the bibliography…
Fully homomorphic encryption is an encryption method with the property that any computation on the plaintext can be performed by a party having access to the ciphertext only.
Can quantum-mechanical description of physical reality be considered complete?
A. Einstein, B. Podolsky, and N. Rosen · 1935
Earlier work this paper cites.
On data banks and privacy homomorphisms
R. Rivest, L. Adleman, and M. Dertouzos · 1978
Earlier work this paper cites.
A single quantum cannot be cloned
W. K. Wootters and W. H. Zurek · 1982
Earlier work this paper cites.
Quantum cryptography: Public key distribution and coin tossing
C. H. Bennett and G. Brassard · 1984
Earlier work this paper cites.
Probabilistic encryption
S. Goldwasser and S. Micali · 1984
Earlier work this paper cites.
A public key cryptosystem and a signature scheme based on discrete logarithms
T. ElGamal · 1985
Earlier work this paper cites.
Is quantum bit commitment really possible?
H.-K. Lo and H. F. Chau · 1997
Earlier work this paper cites.
Unconditionally secure quantum bit commitment is impossible
D. Mayers · 1997
Earlier work this paper cites.
The Heisenberg representation of quantum computers
D. Gottesman · 1998
Earlier work this paper cites.
Public-key cryptosystems based on composite degree residuosity classes
P. Paillier · 1999
Earlier work this paper cites.
Non-interactive cryptocomputing for
T. Sander, A. Young, and M. Yung · 1999
Earlier work this paper cites.
Private quantum channels
A. Ambainis, M. Mosca, A. Tapp, and R. De Wolf · 2000
Earlier work this paper cites.
Quantum public-key cryptosystems
T. Okamoto, K. Tanaka, and S. Uchiyama · 2000
Earlier work this paper cites.
Methodology for quantum logic gate construction
X. Zhou, D. W. Leung, and I. L. Chuang · 2000
Earlier work this paper cites.
Authentication of quantum messages
H. Barnum, C. Crépeau, D. Gottesman, A. Smith, and A. Tapp · 2002
Earlier work this paper cites.
Evaluating 2-DNF formulas on ciphertexts
D. Boneh, E.-J. Goh, and K. Nissim · 2005
Earlier work this paper cites.
Universal quantum computation with ideal Clifford gates and noisy ancillas
S. Bravyi and A. Kitaev · 2005
Earlier work this paper cites.
Secure assisted quantum computation
A. Childs · 2005
Earlier work this paper cites.
Unified derivations of measurement-based schemes for quantum computation
A. M. Childs, D. W. Leung, and M. A. Nielsen · 2005
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
O. Regev · 2005
Cited alongside, same era.
Blind quantum computation
P. Arrighi and L. Salvail · 2006
Cited alongside, same era.
Secure multiparty quantum computation with (only) a strict honest majority
M. Ben-Or, C. Crépeau, D. Gottesman, A. Hassidim, and A. Smith · 2006
Cited alongside, same era.
Zero-knowledge against quantum attacks
J. Watrous · 2006
Cited alongside, same era.
Security notions for quantum public-key cryptography
T. Koshiba · 2007
Cited alongside, same era.
Introduction to Modern Cryptography: Principles and Protocols
J. Katz and Y. Lindell · 2008
Cited alongside, same era.
Quantum walks with encrypted data
P. P. Rohde, J. F. Fitzsimons, and A. Gilchrist · 2012
Later among the works it cites.
Quantum proofs of knowledge
D. Unruh · 2012
Later among the works it cites.
Indistinguishability and semantic security for quantum encryption scheme
C. Xiang and L. Yang · 2012
Later among the works it cites.
How to construct quantum random functions
M. Zhandry · 2012
Later among the works it cites.
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
M. Amy, D. Maslov, M. Mosca, and M. Roetteler · 2013
Later among the works it cites.
Quantum one-time programs
A. Broadbent, G. Gutoski, and D. Stebila · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Broadbent, J. Fitzsimons, and E. Kashefi · 2009
Cited alongside, same era.
A fully homomorphic encryption scheme
C. Gentry · 2009
Cited alongside, same era.
Fully homomorphic encryption using ideal lattices
C. Gentry · 2009
Cited alongside, same era.
Lattice-based cryptography
D. Micciancio and O. Regev · 2009
Cited alongside, same era.
On lattices, learning with errors, random linear codes, and cryptography
O. Regev · 2009
Cited alongside, same era.
Interactive proofs for quantum computations
D. Aharonov, M. Ben-Or, and E. Eban · 2010
Cited alongside, same era.
D. Boneh and M. Zhandry · 2013
Later among the works it cites.
Reusable garbled circuits and succinct functional encryption
S. Goldwasser, Y. Kalai, R. A. Popa, V. Vaikuntanathan, and N. Zeldovich · 2013
Later among the works it cites.
Asymptotically optimal approximation of single qubit unitaries by Clifford and
V. Kliuchnikov, D. Maslov, and M. Mosca · 2013
Later among the works it cites.
Quantum circuits of
P. Selinger · 2013
Later among the works it cites.
Course notes for
J. Watrous · 2013
Later among the works it cites.
Quantum computing on encrypted data
K. A. G. Fisher, A. Broadbent, L. K. Shalm, Z. Yan, J. Lavoie, R. Prevedel, T. Jennewein, and K. J. Resch · 2014
Closest in time.
A note on quantum security for post-quantum cryptography
F. Song · 2014
Closest in time.
A quantum approach to homomorphic encryption
S.-H. Tan, J. A. Kettlewell, Y. Ouyang, L.Chen, and J. F. Fitzsimons · 2014
Closest in time.
Composable security of delegated quantum computation
D. Vedran, J. F. Fitzsimons, C. Portmann, and R. Renner · 2014
Closest in time.
Limitations on information-theoretically-secure quantum homomorphic encryption
L. Yu, C. A. Perez-Delgado, and J. F. Fitzsimons · 2014
Closest in time.
Delegating private quantum computations
A. Broadbent · 2015
Closest in time.
Secure two-party quantum evaluation of unitaries against specious adversaries
F. Dupuis, J. B. Nielsen, and L. Salvail · 2096
Closest in time.