Multi-key fully-homomorphic encryption in the plain model

DOI10.1007/978-3-030-64375-1_2MaRDI QIDQ2055713zbMATH OpenOpenAlexFDO

Authors Abhishek Jain, Zhengzhong Jin, Giulio Malavolta, Prabhanjan 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

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

Recommendations

• On the security of multikey homomorphic encryption
• Multi-key FHE from LWE, revisited
• Lattice-based fully dynamic multi-key FHE with short ciphertexts
• Multikey fully homomorphic encryption and applications
• Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension

Cited in

(32)

• A polynomial time algorithm for breaking NTRU encryption with multiple keys
• Multi-key Homomorphic Proxy Re-Encryption
• Securely aggregating testimonies with threshold multi-key FHE
• Reusable two-round MPC from LPN
• Excalibur key-generation protocols for DAG hierarchic decryption
• A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
• Black-box reusable NISC with random oracles
• Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
• Lattice-based fully dynamic multi-key FHE with short ciphertexts
• Multi-key FHE from LWE, revisited
• Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
• Multi-key Homomorphic Authenticators
• Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Reusable secure computation in the plain model
• Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
• On the security of multikey homomorphic encryption
• Towards round-optimal secure multiparty computations: multikey FHE without a CRS
• Round-optimal and communication-efficient multiparty computation
• Distributed (correlation) samplers: how to remove a trusted dealer in one round
• Multiparty reusable non-interactive secure computation from LWE
• Unbounded multi-party computation from learning with errors
• Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHE
• Multi-key homomorphic encryption from TFHE
• Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
• Multikey fully homomorphic encryption and applications
• Attribute-based keyed fully homomorphic encryption
• SLAP: simpler, improved private stream aggregation from ring learning with errors
• An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
• Partitioned searchable encryption
• Maliciously circuit-private multi-key FHE and MPC based on LWE
• A practical TFHE-based multi-key homomorphic encryption with linear complexity and low noise growth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055713)