Achievable \textsf{CCA2} relaxation for homomorphic encryption

DOI10.1007/S00145-024-09526-1MaRDI QIDQ6655869zbMATH OpenFDO

Authors Adi Akavia, Craig Gentry, Shai Halevi, Margarita Vald

Publication date 27 December 2024

Published in Journal of Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00145-024-09526-1

zbMATH Keywords

chosen ciphertext attackchosen plaintext attackclient aided protocolscryptographic protocolsfunctional bootstrapping oraclehomomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Achievable \textsf{CCA2} relaxation for homomorphic encryption
• Fully homomorphic encryption using ideal lattices
• On CCA-Secure Somewhat Homomorphic Encryption
• FHEW: bootstrapping homomorphic encryption in less than a second
• Chosen-Ciphertext Secure Fully Homomorphic Encryption

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A decade of lattice cryptography
• Achievable \textsf{CCA2} relaxation for homomorphic encryption
• Advances in Cryptology - CRYPTO 2003
• Chosen-Ciphertext Secure Fully Homomorphic Encryption
• Circuit-private multi-key FHE
• Efficient fully homomorphic encryption from (standard) LWE
• Efficient secure two-party protocols. Techniques and constructions
• Evaluating Branching Programs on Encrypted Data
• FHE circuit privacy almost for free
• FHEW: bootstrapping homomorphic encryption in less than a second
• Foundations of Cryptography
• Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Homomorphic encryption for arithmetic of approximate numbers
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic Encryption with CCA Security
• Maliciously circuit-private FHE
• New definitions and separations for circular security
• On CCA-Secure Somewhat Homomorphic Encryption
• On lattices, learning with errors, random linear codes, and cryptography
• Privacy-preserving ridge regression with only linearly-homomorphic encryption
• Sanitization of FHE ciphertexts
• Security with functional re-encryption from CPA
• Subexponential class group and unit group computation in large degree number fields
• TFHE: fast fully homomorphic encryption over the torus

Cited in

(6)

• Security with functional re-encryption from CPA
• IND-CPA\textsuperscript{C}: a new security notion for conditional decryption in fully homomorphic encryption
• Relationships among FuncCPA and its related notions
• Fully composable homomorphic encryption
• Tagged-FHE: strong syntax, stronger security, and standard model
• On new variants of FuncCPA security and related CCA-secure constructions

This page was built for publication: Achievable \textsf{CCA2} relaxation for homomorphic encryption

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