Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

DOI10.1109/FOCS.2011.94zbMath1292.94066OpenAlexW2129580084WikidataQ28002612 ScholiaQ28002612MaRDI QIDQ5495010

Craig Gentry, Shai Halevi

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2011.94

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (27)

Polly cracker, revisited ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Blending FHE-NTRU Keys – The Excalibur Property ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem ⋮ On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes ⋮ Augmented Learning with Errors: The Untapped Potential of the Error Term ⋮ Fake information mechanism based privacy-preserving average consensus ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Homomorphic secret sharing for low degree polynomials ⋮ Ring Packing and Amortized FHEW Bootstrapping ⋮ Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES ⋮ Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service ⋮ Cryptanalysis of a homomorphic encryption scheme ⋮ CRT-based fully homomorphic encryption over the integers ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory ⋮ Key-dependent message security: generic amplification and completeness ⋮ The Geometry of Lattice Cryptography ⋮ Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation ⋮ Homomorphic Encryption

This page was built for publication: Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits