An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
From MaRDI portal
Recommendations
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Multi-key homomorphic encryption from TFHE
- Multi-key fully-homomorphic encryption in the plain model
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Secure MPC: laziness leads to GOD
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic Encryption Standard
- How to share a secret
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Secure multiparty computation and secret sharing
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
Cited in
(5)- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- Threshold fully homomorphic encryption over the torus
- Resolving the efficiency-utility dilemma of threshold linearly homomorphic encryption via message-space adapter
- HERDS: multi-key fully homomorphic encryption with sublinear bootstrapping
- HRA-secure homomorphic lattice-based proxy re-encryption with tight security
This page was built for publication: An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697678)
