Fully composable homomorphic encryption

DOI10.62056/AK5WL86BMMaRDI QIDQ7326591zbMATH OpenFDO

Authors Daniele Micciancio

Publication date 9 September 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AK5WL86BM

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
• Achievable \textsf{CCA2} relaxation for homomorphic encryption
• Advances in Cryptology - CRYPTO 2003
• Black-box circular-secure encryption beyond affine functions
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Circular security is complete for KDM security
• Circular Security Separations for Arbitrary Length Cycles from LWE
• Circular-Secure Encryption from Decision Diffie-Hellman
• Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
• Efficient fully homomorphic encryption from (standard) LWE
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Homomorphic encryption
• Obfuscation of probabilistic circuits and applications
• On the bit security of cryptographic primitives
• On the security of homomorphic encryption on approximate numbers
• Probabilistic encryption
• Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
• Sanitization of FHE ciphertexts
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
• Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption
• Separations in circular security for arbitrary length key cycles
• SoK: learning with errors, circular security, and fully homomorphic encryption
• TFHE: fast fully homomorphic encryption over the torus
• Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
• Toward fine-grained blackbox separations between semantic and circular-security notions

This page was built for publication: Fully composable homomorphic encryption

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