On the practical CPA^D security of ``exact and threshold FHE schemes and libraries
From MaRDI portal
Publication:6652888
Recommendations
- On the security of homomorphic encryption on approximate numbers
- Securing approximate homomorphic encryption using differential privacy
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- Practical FHE parameters against lattice attacks
- Comparison-based attacks against noise-free fully homomorphic encryption schemes
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption for arithmetic of approximate numbers
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On CCA-Secure Somewhat Homomorphic Encryption
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the security of homomorphic encryption on approximate numbers
- Revisiting homomorphic encryption schemes for finite fields
Cited in
(11)- Actively secure MPC in the dishonest majority setting: achieving constant complexity in online communication, computation per gate, rounds, and private input size
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- Drifting towards better error probabilities in fully homomorphic encryption schemes
- Leveraging small message spaces for cca1 security in additively homomorphic and bgn-type encryption
- IND-CPA\textsuperscript{C}: a new security notion for conditional decryption in fully homomorphic encryption
- IND-CPA-D and KR-D security with reduced noise from the HintLWE problem
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- CCA-attacks on lattice-based encryption-decryption schemes
- Relations among new CCA security notions for approximate FHE
- On new variants of FuncCPA security and related CCA-secure constructions
- Threshold public-key encryption: definitions, relations, and CPA-to-CCA transforms
This page was built for publication: On the practical \(\mathrm{CPA}^D\) security of ``exact and threshold FHE schemes and libraries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652888)
