[go: up one dir, main page]

skip to main content
10.1145/2090236.2090262acmconferencesArticle/Chapter ViewAbstractPublication PagesitcsConference Proceedingsconference-collections
research-article

(Leveled) fully homomorphic encryption without bootstrapping

Published: 08 January 2012 Publication History

Abstract

We present a novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual contribution in our work is a new way of constructing leveled fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits), without Gentry's bootstrapping procedure.
Specifically, we offer a choice of FHE schemes based on the learning with error (LWE) or ring-LWE (RLWE) problems that have 2λ security against known attacks. For RLWE, we have:
• A leveled FHE scheme that can evaluate L-level arithmetic circuits with Õ(λ · L3) per-gate computation -- i.e., computation quasi-linear in the security parameter. Security is based on RLWE for an approximation factor exponential in L. This construction does not use the bootstrapping procedure.
• A leveled FHE scheme that uses bootstrapping as an optimization, where the per-gate computation (which includes the bootstrapping procedure) is Õ2), independent of L. Security is based on the hardness of RLWE for quasi-polynomial factors (as opposed to the sub-exponential factors needed in previous schemes).
We obtain similar results to the above for LWE, but with worse performance.
Based on the Ring LWE assumption, we introduce a number of further optimizations to our schemes. As an example, for circuits of large width -- e.g., where a constant fraction of levels have width at least λ -- we can reduce the per-gate computation of the bootstrapped version to Õ(λ), independent of L, by batching the bootstrapping operation. Previous FHE schemes all required Ω(λ3.5) computation per gate.
At the core of our construction is a much more effective approach for managing the noise level of lattice-based ciphertexts as homomorphic operations are performed, using some new techniques recently introduced by Brakerski and Vaikuntanathan (FOCS 2011).

References

[1]
Benny Applebaum, David Cash, Chris Peikert, and Amit Sahai. Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In CRYPTO, volume 5677 of Lecture Notes in Computer Science, pages 595--618. Springer, 2009.
[2]
Dan Boneh, Eu-Jin Goh, and Kobbi Nissim. Evaluating 2-DNF formulas on ciphertexts. In Proceedings of Theory of Cryptography Conference 2005, volume 3378 of LNCS, pages 325--342, 2005.
[3]
Zvika Brakerski and Vinod Vaikuntanathan. Efficient fully homomorphic encryption from (standard) lwe. Manuscript, to appear in FOCS 2011, available at http://eprint.iacr.org/2011/344.
[4]
Zvika Brakerski and Vinod Vaikuntanathan. Fully homomorphic encryption from ring-lwe and security for key dependent messages. Manuscript, to appear in CRYPTO 2011.
[5]
Jean-Sébastien Coron, Avradip Mandal, David Naccache, and Mehdi Tibouchi. Fully-homomorphic encryption over the integers with shorter public-keys. Manuscript, to appear in Crypto 2011.
[6]
Marten van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. Fully homomorphic encryption over the integers. In Advances in Cryptology - EUROCRYPT'10, volume 6110 of Lecture Notes in Computer Science, pages 24--43. Springer, 2010. Full version available on-line from http://eprint.iacr.org/2009/616.
[7]
Craig Gentry. A fully homomorphic encryption scheme. PhD thesis, Stanford University, 2009. crypto.stanford.edu/craig.
[8]
Craig Gentry. Fully homomorphic encryption using ideal lattices. In Michael Mitzenmacher, editor, STOC, pages 169--178. ACM, 2009.
[9]
Craig Gentry and Shai Halevi. Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. Manuscript, to appear in FOCS 2011, available at http://eprint.iacr.org/2011/279.
[10]
Craig Gentry and Shai Halevi. Implementing gentry's fully-homomorphic encryption scheme. In EUROCRYPT, volume 6632 of Lecture Notes in Computer Science, pages 129--148. Springer, 2011.
[11]
Shai Halevi, 2011. Personal communication.
[12]
Yuval Ishai and Anat Paskin. Evaluating branching programs on encrypted data. In Salil P. Vadhan, editor, TCC, volume 4392 of Lecture Notes in Computer Science, pages 575--594. Springer, 2007.
[13]
Kristin Lauter, Michael Naehrig, and Vinod Vaikuntanathan. Can homomorphic encryption be practical? Manuscript at http://eprint.iacr.org/2011/405, 2011.
[14]
Vadim Lyubashevsky, Chris Peikert, and Oded Regev. On ideal lattices and learning with errors over rings. In EUROCRYPT, volume 6110 of Lecture Notes in Computer Science, pages 1--23, 2010.
[15]
Carlos Aguilar Melchor, Philippe Gaborit, and Javier Herranz. Additively homomorphic encryption with -operand multiplications. In Tal Rabin, editor, CRYPTO, volume 6223 of Lecture Notes in Computer Science, pages 138--154. Springer, 2010.
[16]
Chris Peikert. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In STOC, pages 333--342. ACM, 2009.
[17]
Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. In Harold N. Gabow and Ronald Fagin, editors, STOC, pages 84--93. ACM, 2005.
[18]
Oded Regev. The learning with errors problem (invited survey). In IEEE Conference on Computational Complexity, pages 191--204. IEEE Computer Society, 2010.
[19]
Ron Rivest, Leonard Adleman, and Michael L. Dertouzos. On data banks and privacy homomorphisms. In Foundations of Secure Computation, pages 169--180, 1978.
[20]
Nigel P. Smart and Frederik Vercauteren. Fully homomorphic encryption with relatively small key and ciphertext sizes. In Public Key Cryptography - PKC'10, volume 6056 of Lecture Notes in Computer Science, pages 420--443. Springer, 2010.
[21]
Nigel P. Smart and Frederik Vercauteren. Fully homomorphic SIMD operations. Manuscript at http://eprint.iacr.org/2011/133, 2011.
[22]
Damien Stehlé and Ron Steinfeld. Faster fully homomorphic encryption. In ASIACRYPT, volume 6477 of Lecture Notes in Computer Science, pages 377--394. Springer, 2010.

Cited By

View all
  • (2025)Circuit Privacy for FHEW/TFHE-Style Fully Homomorphic Encryption in PracticeIACR Communications in Cryptology10.62056/av11c3w9p1:4Online publication date: 13-Jan-2025
  • (2025)Security Guidelines for Implementing Homomorphic EncryptionIACR Communications in Cryptology10.62056/anxra69p11:4Online publication date: 13-Jan-2025
  • (2025)More Efficient Lattice-Based Electronic Voting from NTRUIACR Communications in Cryptology10.62056/a69qudhdj1:4Online publication date: 13-Jan-2025
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ITCS '12: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
January 2012
516 pages
ISBN:9781450311151
DOI:10.1145/2090236
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 January 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. bootstrapping
  2. fully homomorphic encryption
  3. learning with errors
  4. modulus reduction

Qualifiers

  • Research-article

Funding Sources

Conference

ITCS '12
Sponsor:
ITCS '12: Innovations in Theoretical Computer Science
January 8 - 10, 2012
Massachusetts, Cambridge

Acceptance Rates

ITCS '12 Paper Acceptance Rate 39 of 93 submissions, 42%;
Overall Acceptance Rate 172 of 513 submissions, 34%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)249
  • Downloads (Last 6 weeks)26
Reflects downloads up to 07 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Circuit Privacy for FHEW/TFHE-Style Fully Homomorphic Encryption in PracticeIACR Communications in Cryptology10.62056/av11c3w9p1:4Online publication date: 13-Jan-2025
  • (2025)Security Guidelines for Implementing Homomorphic EncryptionIACR Communications in Cryptology10.62056/anxra69p11:4Online publication date: 13-Jan-2025
  • (2025)More Efficient Lattice-Based Electronic Voting from NTRUIACR Communications in Cryptology10.62056/a69qudhdj1:4Online publication date: 13-Jan-2025
  • (2025)Speedup signing: pre-rejection sampling towards dilithiumCybersecurity10.1186/s42400-024-00325-68:1Online publication date: 8-Feb-2025
  • (2025)OLA: An FPGA-based Overlay Accelerator for Privacy Preserving Machine Learning with Homomorphic EncryptionProceedings of the 2025 ACM/SIGDA International Symposium on Field Programmable Gate Arrays10.1145/3706628.3708868(127-138)Online publication date: 27-Feb-2025
  • (2025)HALO: Loop-aware Bootstrapping Management for Fully Homomorphic EncryptionProceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 110.1145/3669940.3707275(572-585)Online publication date: 30-Mar-2025
  • (2025)Cinnamon: A Framework for Scale-Out Encrypted AIProceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 110.1145/3669940.3707260(133-150)Online publication date: 30-Mar-2025
  • (2025)FHE4DMM: A Low-Latency Distributed Matrix Multiplication With Fully Homomorphic EncryptionIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2025.353484636:4(645-658)Online publication date: Apr-2025
  • (2025)EvalComp: Bootstrapping Based on Homomorphic Comparison Function for CKKSIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.351655320(1349-1361)Online publication date: 2025
  • (2025)Secure Machine Learning Hardware: Challenges and Progress [Feature]IEEE Circuits and Systems Magazine10.1109/MCAS.2024.350937625:1(8-34)Online publication date: Sep-2026
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media