Welcome to the resource topic for 2022/780
Title:
An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption
Authors: Christian Mouchet, Elliott Bertrand, and Jean-Pierre Hubaux
Abstract:We propose and implement a multiparty homomorphic encryption (MHE) scheme with a t-out-of-N-threshold access-structure that is efficient and does not require a trusted dealer in the common reference-string model. We construct this scheme from the ring-learning-with-error (RLWE) assumptions, and as an extension of the MHE scheme of Mouchet et al. (PETS 21). By means of a specially adapted share-resharing procedure, this extension can be used to relax the N-out-of-N-threshold access structure of the original scheme into a t-out-of-N-threshold one. This procedure introduces only a single round of communication during the setup phase to instantiate the t-out-of-N-threshold access structure. Then, the procedure requires only local operations for any set of t parties to compute a t-out-of-t additive sharing of the secret key; this sharing can be used directly in the scheme of Mouchet et al. We show that, by performing the re-sharing over the MHE ciphertext-space with a carefully chosen exceptional set, this reconstruction procedure can be made secure and has negligible memory and CPU-time overhead. Hence, in addition to fault tolerance, lowering the corruption threshold also yields considerable efficiency benefits, by enabling the distribution of batched secret-key operations among the online parties. We implemented and open-sourced our scheme in the Lattigo library.
ePrint: https://eprint.iacr.org/2022/780
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .