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

(29)

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

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)