IND-CPA\textsuperscript{C}: a new security notion for conditional decryption in fully homomorphic encryption

DOI10.1007/978-3-031-86602-9_13MaRDI QIDQ6969290zbMATH OpenFDO

Authors Bhuvnesh Chaturvedi, Anirban Chakraborty, Nimish Mishra, Ayantika Chatterjee, Debdeep Mukhopadhyay

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-86602-9_13

zbMATH Keywords

conditional decryptionFHESNARKs

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Achievable \textsf{CCA2} relaxation for homomorphic encryption
• Attribute-based encryption for circuits
• Factoring polynomials with rational coefficients
• FHEW: bootstrapping homomorphic encryption in less than a second
• Financial cryptography and data security. FC 2013 workshops, USEC and WAHC 2013, Okinawa, Japan, April 1, 2013. Revised selected papers
• 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
• Functional encryption: definitions and challenges
• Homomorphic encryption for arithmetic of approximate numbers
• How ordinary elimination became Gaussian elimination
• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• On ideal lattices and learning with errors over rings
• On key recovery attacks against existing somewhat homomorphic encryption schemes
• On lattices, learning with errors, random linear codes, and cryptography
• On the practical \(\mathrm{CPA}^D\) security of ``exact and threshold FHE schemes and libraries
• On the security of homomorphic encryption on approximate numbers
• On the security of homomorphic encryption schemes with restricted decryption oracles
• Probabilistic encryption
• Reaction attack on outsourced computing with fully homomorphic encryption schemes
• Reusable garbled circuits and succinct functional encryption
• Securing approximate homomorphic encryption using differential privacy
• TFHE: fast fully homomorphic encryption over the torus

This page was built for publication: IND-CPA\textsuperscript{C}: a new security notion for conditional decryption in fully homomorphic encryption

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