Achievable \textsf{CCA2} relaxation for homomorphic encryption
From MaRDI portal
Publication:6114265
DOI10.1007/978-3-031-22365-5_3zbMath1519.94029OpenAlexW4312321890MaRDI QIDQ6114265
Shai Halevi, Margarita Vald, Adi Akavia, Craig Gentry
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22365-5_3
Related Items (1)
Cites Work
- Efficient secure two-party protocols. Techniques and constructions
- Privacy-preserving ridge regression with only linearly-homomorphic encryption
- TFHE: fast fully homomorphic encryption over the torus
- Homomorphic encryption for arithmetic of approximate numbers
- CCA-Secure Keyed-Fully Homomorphic Encryption
- A Decade of Lattice Cryptography
- Sanitization of FHE Ciphertexts
- (Leveled) fully homomorphic encryption without bootstrapping
- FHE Circuit Privacy Almost for Free
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Maliciously Circuit-Private FHE
- On CCA-Secure Somewhat Homomorphic Encryption
- New Definitions and Separations for Circular Security
- Must You Know the Code of f to Securely Compute f?
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Evaluating Branching Programs on Encrypted Data
- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- Advances in Cryptology - CRYPTO 2003
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Chosen-Ciphertext Secure Fully Homomorphic Encryption
- Circuit-Private Multi-key FHE
- On lattices, learning with errors, random linear codes, and cryptography
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
This page was built for publication: Achievable \textsf{CCA2} relaxation for homomorphic encryption
