Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts

DOI10.1007/978-3-662-53018-4_8zbMath1351.94029OpenAlexW2499150512MaRDI QIDQ2835588

Renen Perlman, Zvika Brakerski

Publication date: 30 November 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53018-4_8

zbMATH Keywords

multi-key fully homomorphic encryption (FHE) scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Multi-key FHE from LWE, Revisited ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ 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 ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ Secure software leasing ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ BETA: biometric-enabled threshold authentication

Uses Software

• HElib

Cites Work

• Unnamed Item
• A hierarchy of polynomial time lattice basis reduction algorithms
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Advances in cryptology -- CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17--21, 2014. Proceedings, Part I
• (Leveled) fully homomorphic encryption without bootstrapping
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Algorithms in HElib
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Bootstrapping for HElib
• Lattice-based FHE as secure as PKE
• Multi-key FHE from LWE, Revisited
• 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
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Two Round Multiparty Computation via Multi-key FHE
• On lattices, learning with errors, random linear codes, and cryptography