Multi-key FHE from LWE, Revisited

DOI10.1007/978-3-662-53644-5_9zbMath1397.94093OpenAlexW2538296643MaRDI QIDQ3181028

Sina Shiehian, Chris Peikert

Publication date: 22 December 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53644-5_9

zbMATH Keywords

learning with errors (LWE)fully homomorphic encryption (FHE)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (21)

Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ An improved affine equivalence algorithm for random permutations ⋮ From FE combiners to secure MPC and back ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Multi-key Homomorphic Proxy Re-Encryption ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ Unnamed Item ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Post-quantum multi-party computation ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ BETA: biometric-enabled threshold authentication ⋮ Spooky Encryption and Its Applications ⋮ Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts ⋮ Homomorphic Encryption

Uses Software

• NTRU

Cites Work

• Unnamed Item
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Leveled Fully Homomorphic Signatures from Standard Lattices
• Lattice-based FHE as secure as PKE
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• On Ideal Lattices and Learning with Errors over Rings
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Classical hardness of learning with errors
• Two Round Multiparty Computation via Multi-key FHE
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Multi-key FHE from LWE, Revisited