Multi-key fully-homomorphic encryption in the plain model

DOI10.1007/978-3-030-64375-1_2zbMath1479.94113OpenAlexW3111030918MaRDI QIDQ2055713

Zhengzhong Jin, Giulio Malavolta, Abhishek Jain, Prabhanjan V. Ananth

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-64375-1_2

zbMATH Keywords

multi-homomorphic encryptionmulti-key FHE scheme

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (12)

Round-optimal and communication-efficient multiparty computation ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Reusable Two-Round MPC from LPN ⋮ Black-box reusable NISC with random oracles ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Reusable secure computation in the plain model ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ SLAP: simpler, improved private stream aggregation from ring learning with errors ⋮ Partitioned searchable encryption ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Unbounded multi-party computation from learning with errors

This page was built for publication: Multi-key fully-homomorphic encryption in the plain model