Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

DOI10.1109/FOCS.2011.94MaRDI QIDQ5495010zbMATH OpenOpenAlexWikidataFDO

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)

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

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)