a590003

[DGHV10] Marten van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. Fully homomorphic
encryption over the integers. In EUROCRYPT, pages 24–43, 2010. Full
Version in http://eprint.iacr.org/2009/616.pdf.
[Gen09a]
Craig Gentry. A fully homomorphic encryption scheme. PhD thesis, Stanford University,
2009. http://crypto.stanford.edu/craig.
[Gen09b] Craig Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages
169–178, 2009.
[GGH97]
[GH11]
[GHS11a]
[GHS11b]
[GPV08]
[LPR10]
[MM11]
[MP11]
[MV10]
[Ost11]
[Pei09]
[RAD78]
Oded Goldreich, Shafi Goldwasser, and Shai Halevi. Eliminating decryption errors in
the ajtai-dwork cryptosystem. In Burton S. Kaliski Jr., editor, CRYPTO, volume 1294
of Lecture Notes in Computer Science, pages 105–111. Springer, 1997.
Craig Gentry and Shai Halevi. Fully homomorphic encryption without squashing using
depth-3 arithmetic circuits. In Ostrovsky [Ost11], pages 107–109.
Craig Gentry, Shai Halevi, and Nigel P. Smart. Better bootstrapping in fully homomorphic
encryption. IACR Cryptology ePrint Archive, 2011:680, 2011.
Craig Gentry, Shai Halevi, and Nigel P. Smart. Fully homomorphic encryption with
polylog overhead. IACR Cryptology ePrint Archive, 2011:566, 2011.
Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. Trapdoors for hard lattices
and new cryptographic constructions. In Cynthia Dwork, editor, STOC, pages 197–206.
ACM, 2008.
Vadim Lyubashevsky, Chris Peikert, and Oded Regev. On ideal lattices and learning
with errors over rings. In EUROCRYPT, pages 1–23, 2010. Draft of full version was
provided by the authors.
Daniele Micciancio and Petros Mol. Pseudorandom knapsacks and the sample complexity
of lwe search-to-decision reductions. In Rogaway [Rog11], pages 465–484.
Daniele Micciancio and Chris Peikert. Trapdoors for lattices: Simpler, tighter, faster,
smaller. IACR Cryptology ePrint Archive, 2011:501, 2011. To appear in Eurocrypt
2012.
Daniele Micciancio and Panagiotis Voulgaris. A deterministic single exponential time
algorithm for most lattice problems based on voronoi cell computations. In Leonard J.
Schulman, editor, STOC, pages 351–358. ACM, 2010.
Rafail Ostrovsky, editor. IEEE 52nd Annual Symposium on Foundations of Computer
Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011. IEEE, 2011.
Chris Peikert. Public-key cryptosystems from the worst-case shortest vector problem:
extended abstract. In STOC, pages 333–342, 2009.
R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphisms.
In Foundations of Secure Computation, pages 169–177. Academic Press, 1978.
18
6. FHE without Modulus Switching