Lattice-based fully dynamic multi-key FHE with short ciphertexts
From MaRDI portal
Publication:2835588
DOI10.1007/978-3-662-53018-4_8zbMATH Open1351.94029OpenAlexW2499150512MaRDI QIDQ2835588FDOQ2835588
Authors: Zvika Brakerski, Renen Perlman 
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
Recommendations
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bootstrapping for HElib
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Title not available (Why is that?)
- (Leveled) fully homomorphic encryption without bootstrapping
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Trapdoors for lattices: simpler, tighter, faster, smaller
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Advances in cryptology -- CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17--21, 2014. Proceedings, Part I
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Multi-key FHE from LWE, revisited
- Multi-identity and multi-key leveled FHE from learning with errors
- Two round multiparty computation via multi-key FHE
- Faster Bootstrapping with Polynomial Error
- Algorithms in HElib
- Lattice-based FHE as secure as PKE
Cited In (24)
- Multi-key Homomorphic Proxy Re-Encryption
- TFHE: fast fully homomorphic encryption over the torus
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Dynamic multi target homomorphic attribute-based encryption
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Two-round adaptively secure multiparty computation from standard assumptions
- Multi-key FHE from LWE, revisited
- Private puncturable PRFs from standard lattice assumptions
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Maliciously secure massively parallel computation for all-but-one corruptions
- The bottleneck complexity of secure multiparty computation
- Multi-key fully-homomorphic encryption in the plain model
- Multiparty reusable non-interactive secure computation from LWE
- Secure software leasing
- From FE combiners to secure MPC and back
- BETA: biometric-enabled threshold authentication
- Multikey fully homomorphic encryption and applications
- Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
- Maliciously circuit-private multi-key FHE and MPC based on LWE
- Targeted homomorphic attribute-based encryption
- A practical TFHE-based multi-key homomorphic encryption with linear complexity and low noise growth
- Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
Uses Software
This page was built for publication: Lattice-based fully dynamic multi-key FHE with short ciphertexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835588)
