Welcome to the resource topic for 2024/1285
Title:
Robust Multiparty Computation from Threshold Encryption Based on RLWE
Authors: Antoine Urban, Matthieu Rambaud
Abstract:We consider protocols for secure multi-party computation (MPC) built from FHE under honest majority, i.e., for n=2t+1 players of which t are corrupt, that is robust. Surprisingly there exists no robust threshold FHE scheme based on BFV to design an MPC protocol. Precisely, all existing methods for generating a common relinearization key can abort as soon as one player deviates. We solve this issue, with a new relinearization key (adapted from [CDKS19, CCS’19]) which we show how to securely generate in parallel of the threshold encryption key, in the same broadcast. We thus obtain the first robust threshold BFV scheme, moreover using only one broadcast for the generation of keys instead of two previously.
Of independent interest, as an optional alternative, we propose the first threshold FHE decryption enabling simultaneously:
(i) robustness over asynchronous channels with honest majority; (ii) tolerating a power-of-small-prime ciphertext modulus, e.g., 2^e; and (iii) secret shares of sizes quasi-independent of n.
ePrint: https://eprint.iacr.org/2024/1285
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 .