An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption

DOI10.1007/s00145-023-09452-8OpenAlexW4328050503WikidataQ123137321 ScholiaQ123137321MaRDI QIDQ2697678

Elliott Bertrand, Christian Mouchet, Jean-Pierre Hubaux

Publication date: 13 April 2023

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-023-09452-8

zbMATH Keywords

secure multiparty computationmultiparty homomorphic encryptionthreshold access-structures

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Uses Software

• GitHub
• PALISADE
• Lattigo

Cites Work

• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• Threshold cryptosystems from threshold fully homomorphic encryption
• 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
• Homomorphic encryption for arithmetic of approximate numbers
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• How to share a secret
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
• Homomorphic Encryption Standard
• Secure Multiparty Computation and Secret Sharing

This page was built for publication: An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption