Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS
From MaRDI portal
Publication:5859732
DOI10.1142/S012905412050001XzbMath1458.68068MaRDI QIDQ5859732
Eunkyung Kim, Jeongeun Park, Hyang-Sook Lee
Publication date: 20 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)
Cites Work
- Two-round multiparty secure computation from minimal assumptions
- Four round secure computation without setup
- Towards round-optimal secure multiparty computations: multikey FHE without a CRS
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Fully homomorphic encryption using ideal lattices
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Two Round Multiparty Computation via Multi-key FHE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS
