Choudhury, Ashish and Orsini, Emmanuela and Patra, Arpita and Smart, Nigel P (2016) Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. In: 10th International Conference on Security and Cryptography for Networks (SCN), AUG 31-SEP 02, 2016, Amalfi, ITALY, pp. 147-168.
![]() |
PDF
Sec_Cry_Net_9841_147_2016.pdf - Published Version Restricted to Registered users only Download (526kB) | Request a copy |
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 Damgard 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.
Item Type: | Conference Proceedings |
---|---|
Series.: | Lecture Notes in Computer Science |
Additional Information: | Copy right for this article belongs to the SPRINGER INT PUBLISHING AG, GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND |
Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
Date Deposited: | 21 Jan 2017 08:41 |
Last Modified: | 21 Jan 2017 08:41 |
URI: | http://eprints.iisc.ac.in/id/eprint/55952 |
Actions (login required)
![]() |
View Item |