FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime

DOI10.1007/978-3-662-54388-7_10zbMath1400.94118OpenAlexW2589601466MaRDI QIDQ5738759

Zvika Brakerski, Tancrède Lepoint, Daniel Benarroch

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54388-7_10

zbMATH Keywords

Fully homomorphic encryption over the integers (FHE-OI)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem ⋮ Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ Bootstrapping fully homomorphic encryption over the integers in less than one second ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems

Uses Software

• FHEW
• SHIELD
• fhe

Cites Work

• Unnamed Item
• Unnamed Item
• Fully homomorphic SIMD operations
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully Homomophic Encryption over the Integers Revisited
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• Approximate common divisors via lattices
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
• Algorithms for the approximate common divisor problem
• SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers
• Lattice-based FHE as secure as PKE
• Fully Homomorphic Encryption over the Integers
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• A Pseudorandom Generator from any One-way Function
• Packed Ciphertexts in LWE-Based Homomorphic Encryption
• Batch Fully Homomorphic Encryption over the Integers
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Scale-Invariant Fully Homomorphic Encryption over the Integers
• Efficient Fully Homomorphic Encryption from (Standard) LWE

This page was built for publication: FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime