A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
From MaRDI portal
Publication:2001181
DOI10.1007/s00500-017-2896-9zbMath1415.94464OpenAlexW2767843857MaRDI QIDQ2001181
Publication date: 2 July 2019
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-017-2896-9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bonsai trees, or how to delegate a lattice basis
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Key Homomorphic PRFs and Their Applications
- Computational Fuzzy Extractors
- Faster Bootstrapping with Polynomial Error
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Multi-key FHE from LWE, Revisited
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- Lossy Trapdoor Functions and Their Applications
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Trapdoors for hard lattices and new cryptographic constructions
- Fully Homomorphic Encryption over the Integers
- Efficient Lattice (H)IBE in the Standard Model
- A Framework for Efficient and Composable Oblivious Transfer
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- 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: A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
