×

zbMATH — the first resource for mathematics

(Leveled) fully homomorphic encryption without bootstrapping. (English) Zbl 1347.68121

MSC:
68P25 Data encryption (aspects in computer science)
94A60 Cryptography
Software:
fhe; HElib; GitHub
PDF BibTeX Cite
Full Text: DOI
References:
[1] Miklós Ajtai, Ravi Kumar, and D. Sivakumar. 2001. A sieve algorithm for the shortest lattice vector problem. InProceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC’01). ACM, 601–610. · Zbl 1323.68561
[2] Benny Applebaum, David Cash, Chris Peikert, and Amit Sahai. 2009. Fast cryptographic primitives and circular-secure encryption based on hard learning problems. InProceedings of the 29th Annual International Cryptology Conference (CRYPTO’09). Lecture Notes in Computer Science, vol. 5677, Springer, Berlin, 595–618. · Zbl 1252.94044
[3] Dan Boneh, Eu-Jin Goh, and Kobbi Nissim. 2005. Evaluating 2-DNF formulas on ciphertexts. InProceedings of the 2nd Theory of Cryptography Conference (TCC’05). Lecture Notes in Computer Science, vol. 3378, Springer, Berlin, 325–342. · Zbl 1079.94534
[4] Zvika Brakerski. 2012. Fully homomorphic encryption without modulus switching from classical GapSVP. InProceedings of the 32nd Annual Cryptology Conference (CRYPTO’12). Lecture Notes in Computer Science, vol. 7417, Springer, Berlin, 868–886. · Zbl 1296.94091
[5] Zvika Brakerski and Vinod Vaikuntanathan. 2011a. Fully homomorphic encryption from ring-LWE and security for key dependent messages. InProceedings of the 31st Annual Cryptology Conference (CRYPTO’11). Lecture Notes in Computer Science, vol. 6841, Springer, Berlin, 505–524. · Zbl 1290.94051
[6] Zvika Brakerski and Vinod Vaikuntanathan. 2011b. Efficient fully homomorphic encryption from (standard) LWE. InProceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS’11). IEEE, 97–106. · Zbl 1292.94038
[7] Jean-Sébastien Coron, Avradip Mandal, David Naccache, and Mehdi Tibouchi. 2011. Fully homomorphic encryption over the integers with shorter public keys. InProceedings of the 31st Annual Cryptology Conference (CRYPTO’11), Phillip Rogaway Ed., Lecture Notes in Computer Science, vol. 6841, Springer, Berlin, 487–504. · Zbl 1290.94059
[8] Craig Gentry. 2009a. A fully homomorphice encryption scheme. Ph.D. dissertation, Stanford University, Stanford, CA. crypto.stanford.edu/craig. · Zbl 1304.94059
[9] Craig Gentry. 2009b. Fully homomorphic encryption using ideal lattices. InProceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC’09). Michael Mitzenmacher Ed., ACM, 169–178. · Zbl 1304.94059
[10] Craig Gentry and Shai Halevi. 2011a. Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. InProceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS’11). Rafail Ostrovsky Ed., IEEE, 107–109. · Zbl 1292.94066
[11] Craig Gentry and Shai Halevi. 2011b. Implementing gentry’s fully-homomorphic encryption scheme. InProceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’11). Lecture Notes in Computer Science, vol. 6632, Springer, Berlin, 29–148. · Zbl 1281.94026
[12] Craig Gentry, Shai Halevi, Chris Peikert, and Nigel P. Smart. 2012a. Ring switching in BGV-style homomorphic encryption. InProceedings of the 8th International Conference on Security and Cryptography for Networks (SCN’12). Ivan Visconti and Roberto De Prisco Eds., Lecture Notes in Computer Science, vol. 7485, Springer, Berlin, 19–37. · Zbl 1310.94147
[13] Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012b. Better bootstrapping in fully homomorphic encryption. InProceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography (PKC’12). Marc Fischlin, Johannes Buchmann, and Mark Manulis Eds., Lecture Notes in Computer Science, vol. 7293, Springer, Berlin, 1–16. · Zbl 1290.94077
[14] Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012c. Fully homomorphic encryption with polylog overhead. InProceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’12). David Pointcheval and Thomas Johansson Eds., Lecture Notes in Computer Science, vol. 7237, Springer, Berlin, 465–482. · Zbl 1297.94071
[15] Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012d. Homomorphic evaluation of the AES circuit. InProceedings of the 32nd Annual Cryptology Conference (CRYPTO’12). Reihaneh Safavi-Naini and Ran Canetti Eds., Lecture Notes in Computer Science, vol. 7417, Springer, Berlin, 850–867. · Zbl 1296.94117
[16] Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. 2010.i-Hop homomorphic encryption and rerandomizable Yao circuits. InProceedings of the 30th Annual Cryptology Conference (CRYPTO’10). Lecture Notes in Computer Science, vol. 6223, Springer, Berlin, 155–172. · Zbl 1280.94061
[17] Shafi Goldwasser and Silvio Micali. 1984. Probabilistic encryption.J. Comput. Syst. Sci. 28, 2, 270–299. · Zbl 0563.94013
[18] Shai Halevi and Victor Shoup. 2013. HElib: An implementation of homomorphic encryption. https://github.com/shaih/HElib. · Zbl 1370.94516
[19] Yuval Ishai and Anat Paskin. 2007. Evaluating branching programs on encrypted data. InProceedings of the 4th Theory of Cryptography Conference (TCC’07). Salil P. Vadhan Ed., Lecture Notes in Computer Science, vol. 4392, Springer, Berlin, 575–594. · Zbl 1156.94354
[20] Kristin Lauter, Michael Naehrig, and Vinod Vaikuntanathan. 2011. Can homomorphic encryption be practical? InProceedings of the 3rd ACM Cloud Computing Security Workshop (CCSW’11). ACM, 113–124.
[21] Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2010. On ideal lattices and learning with errors over rings. InProceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’10). Lecture Notes in Computer Science, vol. 6110, Springer, Berlin, 1–23. · Zbl 1279.94099
[22] Carlos Aguilar Melchor, Philippe Gaborit, and Javier Herranz. 2010. Additively homomorphic encryption withd-operand multiplications. InProceedings of the 30th Annual Cryptology Conference (CRYPTO’10). Tal Rabin Ed., Lecture Notes in Computer Science, vol. 6223, Springer, Berlin, 138–154. · Zbl 1280.94083
[23] Daniele Micciancio. 2007. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions.Computat. Complex. 16, 4, 365–411. · Zbl 1133.68024
[24] Daniele Micciancio and Panagiotis Voulgaris. 2010. A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. InProceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC’10). Leonard J. Schulman Ed., ACM, 351–358. · Zbl 1293.68172
[25] Chris Peikert. 2009. Public-key cryptosystems from the worst-case shortest vector problem: Extended abstract. InProceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC’09). ACM, 333–342. · Zbl 1304.94079
[26] Oded Regev. 2005. On lattices, learning with errors, random linear codes, and cryptography. InProceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC’05). Harold N. Gabow and Ronald Fagin Eds., ACM, 84–93. · Zbl 1192.94106
[27] Oded Regev. 2010. Oded Regev. 2010. The learning with errors problem (invited survey). InProceedings of the IEEE Conference on Computational Complexity (CCC’10). IEEE Computer Society, 191–204.
[28] Ron Rivest, Leonard Adleman, and Michael L. Dertouzos. 1978. On data banks and privacy homomorphisms. InFoundations of Secure Computation. Academic Press, Inc., Orlando, FL, 169–180.
[29] Claus-Peter Schnorr. 1987. A hierarchy of polynomial time lattice basis reduction algorithms.Theor. Comput. Sci. 53, 201–224. · Zbl 0642.10030
[30] Nigel P. Smart and Frederik Vercauteren. 2010. Fully homomorphic encryption with relatively small key and ciphertext sizes. InProceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography (PKC’10). Lecture Notes in Computer Science, vol. 6056, Springer, Berlin, 420–443.
[31] Nigel P. Smart and Frederik Vercauteren. 2011. Fully homomorphic SIMD operations.IACR Cryptol. ePrint Archive2011, 133.
[32] Damien Stehlé and Ron Steinfeld. 2010. Faster fully homomorphic encryption. InProceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT’10). Lecture Notes of Computer Science, vol. 6477, Springer, Berlin, 377–394. · Zbl 1290.94133
[33] Marten van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. 2010. Fully homomorphic encryption over the integers. InProceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’10). Lecture Notes in Computer Science, vol. 6110, Springer, Berlin, 24–43. · Zbl 1279.94130
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.