Fetching the paper…
Reading the bibliography…
We present a new scheme for quantum homomorphic encryption which is compact and allows for efficient evaluation of arbitrary polynomial-sized quantum circuits.
On data banks and privacy homomorphisms
Ronald L Rivest, Len Adleman, and Michael L Dertouzos · 1978
Earlier work this paper cites.
A method for obtaining digital signatures and public-key cryptosystems
Ronald L Rivest, Adi Shamir, and Len Adleman · 1978
Earlier work this paper cites.
Probabilistic encryption
Shafi Goldwasser and Silvio Micali · 1984
Earlier work this paper cites.
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
David A. Barrington · 1989
Earlier work this paper cites.
Replication is not needed: Single database, computationally-private information retrieval
Eyal Kushilevitz and Rafail Ostrovsky · 1997
Earlier work this paper cites.
Private information retrieval
Benny Chor, Eyal Kushilevitz, Oded Goldreich, and Madhu Sudan · 1998
Earlier work this paper cites.
Theory of fault-tolerant quantum computation
Daniel Gottesman · 1998
Earlier work this paper cites.
Quantum Teleportation is a Universal Computational Primitive
Daniel Gottesman and Isaac L. Chuang · 1999
Earlier work this paper cites.
Public-key cryptosystems based on composite degree residuosity classes
Pascal Paillier · 1999
Earlier work this paper cites.
Non-interactive cryptocomputing for NC1
Tomas Sander, Adam Young, and Moti Yung · 1999
Earlier work this paper cites.
Quantum Computation and Quantum Information
Michael Nielsen and Isaac Chuang · 2000
Earlier work this paper cites.
Multiparty computation from threshold homomorphic encryption
Ronald Cramer, Ivan Damgård, and Jesper B Nielsen · 2001
Earlier work this paper cites.
Evaluating 2-DNF formulas on ciphertexts
Dan Boneh, Eu-Jin Goh, and Kobbi Nissim · 2005
Earlier work this paper cites.
Secure assisted quantum computation
Andrew M Childs · 2005
Earlier work this paper cites.
Blind quantum computation
Pablo Arrighi and Louis Salvail · 2006
Earlier work this paper cites.
Secure multiparty quantum computation with (only) a strict honest majority
Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, and Adam Smith · 2006
Earlier work this paper cites.
Theory of Cryptography: 4th Theory of Cryptography Conference, TCC 2007. Proceedings
Yuval Ishai and Anat Paskin · 2007
Earlier work this paper cites.
Instantaneous quantum computation
Dan Shepherd and Michael J Bremner · 2008
Earlier work this paper cites.
Universal blind quantum computation
Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi · 2009
Earlier work this paper cites.
Fully homomorphic encryption using ideal lattices
Craig Gentry · 2009
Cited alongside, same era.
Interactive proofs for quantum computations
Dorit Aharonov, Michael Ben-Or, and Elad Eban · 2010
Cited alongside, same era.
Secure two-party quantum evaluation of unitaries against specious adversaries
Frédéric Dupuis, Jesper Buus Nielsen, and Louis Salvail · 2010
Cited alongside, same era.
A simple BGN-type cryptosystem from LWE
Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan · 2010
Cited alongside, same era.
Fully homomorphic encryption over the integers
Marten Van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan · 2010
Cited alongside, same era.
Efficient fully homomorphic encryption from (standard) LWE
Zvika Brakerski and Vinod Vaikuntanathan · 2011
Cited alongside, same era.
Quantum private information retrieval has linear communication complexity
Ämin Baumeler and Anne Broadbent · 2014
Later among the works it cites.
The garden hose complexity for the equality function
Well Y Chiu, Mario Szegedy, Chengu Wang, and Yixin Xu · 2014
Later among the works it cites.
Quantum computing on encrypted data
KAG Fisher, A Broadbent, LK Shalm, Z Yan, J Lavoie, R Prevedel, T Jennewein, and KJ Resch · 2014
Later among the works it cites.
New bounds for the garden-hose model
Hartmut Klauck and Supartha Podder · 2014
Later among the works it cites.
On the riddle of coding equality function in the garden hose model
Oded Margalit · 2014
Later among the works it cites.
How to use indistinguishability obfuscation: Deniable encryption, and more
Amit Sahai and Brent Waters · 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…
Florian Speelman · 2011
Cited alongside, same era.
Computing blindfolded: New developments in fully homomorphic encryption
Vinod Vaikuntanathan · 2011
Cited alongside, same era.
Multiparty computation with low communication, computation and interaction via threshold FHE
Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs · 2012
Cited alongside, same era.
(Leveled) fully homomorphic encryption without bootstrapping
Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan · 2012
Cited alongside, same era.
Lattice based cryptography and fully homomorphic encryption
Maximilian Fillinger · 2012
Cited alongside, same era.
Quantum walks with encrypted data
Peter P Rohde, Joseph F Fitzsimons, and Alexei Gilchrist · 2012
Cited alongside, same era.
A quantum approach to fully homomorphic encryption
Si-Hui Tan, Joshua A Kettlewell, Yingkai Ouyang, Lin Chen, and Joseph F Fitzsimons · 2014
Later among the works it cites.
Composable security of delegated quantum computation
Dunjko Vedran, Joseph F Fitzsimons, Christopher Portmann, and Renato Renner · 2014
Later among the works it cites.
Limitations on information-theoretically-secure quantum homomorphic encryption
Li Yu, Carlos A. Pérez-Delgado, and Joseph F. Fitzsimons · 2014
Later among the works it cites.
Quantum homomorphic encryption for circuits of low T-gate complexity
Anne Broadbent and Stacey Jeffery · 2015
Later among the works it cites.
Delegating private quantum computations
Anne Broadbent · 2015
Later among the works it cites.
Non-signalling correlations imply efficient instantaneous nonlocal quantum computation
Anne Broadbent · 2015
Later among the works it cites.
Semantic security and indistinguishability in the quantum world
Tommaso Gagliardoni, Andreas Hülsing, and Christian Schaffner · 2015
Later among the works it cites.
Quantum fully homomorphic encryption scheme based on universal quantum circuit
Min Liang · 2015
Later among the works it cites.
Quantum homomorphic encryption from quantum codes
Yingkai Ouyang, Si-Hui Tan, and Joseph Fitzsimons · 2015
Later among the works it cites.
Instantaneous non-local computation of low T-depth quantum circuits
Florian Speelman · 2015
Later among the works it cites.
Computational security of quantum encryption
Gorjan Alagic, Anne Broadbent, Bill Fefferman, Tommaso Gagliardoni, Christian Schaffner, and Michael St. Jules · 2016
Closest in time.
Gorjan Alagic and Bill Fefferman · 2016
Closest in time.