Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

DOI10.1109/FOCS.2011.94zbMATH Open1292.94066OpenAlexW2129580084WikidataQ28002612 ScholiaQ28002612MaRDI QIDQ5495010FDOQ5495010

Authors: 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)

Cited In (27)

• Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
• Augmented Learning with Errors: The Untapped Potential of the Error Term
• Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
• Ring packing and amortized FHEW bootstrapping
• Oblivious transfer from weakly random self-reducible public-key cryptosystem
• Computing primitive idempotents in finite commutative rings and applications
• The geometry of lattice cryptography
• Polly cracker, revisited
• Fake information mechanism based privacy-preserving average consensus
• On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
• CRT-based fully homomorphic encryption over the integers
• Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Cryptanalysis of a homomorphic encryption scheme
• Key-dependent message security: generic amplification and completeness
• Cryptographic algorithms for privacy-preserving online applications
• Homomorphic encryption
• On key recovery attacks against existing somewhat homomorphic encryption schemes
• (Leveled) fully homomorphic encryption without bootstrapping
• Somewhat/fully homomorphic encryption: implementation progresses and challenges
• Multikey fully homomorphic encryption and applications
• Blending FHE-NTRU keys -- the excalibur property
• Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
• Direct computation of branching programs and its applications to more efficient lattice-based cryptography
• Homomorphic secret sharing for low degree polynomials
• Efficient privacy-preserving protocol for \(k\)-NN search over encrypted data in location-based service
• Towards constructing fully homomorphic encryption without ciphertext noise from group theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495010)