Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption
From MaRDI portal
Publication:4915998
DOI10.1007/978-3-642-36362-7_2zbMath1314.94077OpenAlexW100501146MaRDI QIDQ4915998
Aishwarya Thiruvengadam, Hong-Sheng Zhou, Jonathan N. Katz
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_2
Related Items (7)
Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Completeness theorems for adaptively secure broadcast ⋮ Cryptography with certified deletion ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ Efficient one-sided adaptively secure computation ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ On Adaptively Secure Multiparty Computation with a Short CRS
Cites Work
- A proof of security of Yao's protocol for two-party computation
- Bounded Key-Dependent Message Security
- Universally composable two-party and multi-party secure computation
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
- Fully homomorphic encryption using ideal lattices
- Advances in Cryptology – CRYPTO 2004
- Computational Complexity
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption
