Welcome to the resource topic for 2015/705
Title:
Linear Overhead Optimally-resilient Robust MPC Using Preprocessing
Authors: Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
Abstract:We present a new technique for robust secret reconstruction with O(n) communication complexity. By applying this technique, we achieve O(n) communication complexity per multiplication for a wide class of robust practical Multi-Party Computation (MPC) protocols. In particular our technique applies to robust threshold computationally secure protocols in the case of t<n/2 in the pre-processing model. Previously in the pre-processing model, O(n) communication complexity per multiplication was only known in the case of computationally secure non-robust protocols in the dishonest majority setting (i.e. with t<n) and in the case of perfectly-secure robust protocols with t<n/3. A similar protocol was sketched by Damgård and Nielsen, but no details were given to enable an estimate of the communication complexity. Surprisingly our robust reconstruction protocol applies for both the synchronous and asynchronous settings.
ePrint: https://eprint.iacr.org/2015/705
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 .