Choudhury, Ashish and Patra, Arpita and Ravi, Divya (2017) Round and Communication Efficient Unconditionally-Secure MPC with t < n/3 in Partially Synchronous Network. In: 10th International Conference on Information Theoretic Security (ICITS), NOV 29-DEC 02, 2017, Chinese Univ Hong Kong, Hong Kong, HONG KONG, pp. 83-109.
Full text not available from this repository. (Request a copy)Abstract
In this work, we study unconditionally-secure multi-party computation (MPC) tolerating t < n/3 corruptions, where n is the total number of parties involved. In this setting, it is well known that if the underlying network is completely asynchronous, then one can achieve only statistical security; moreover it is impossible to ensure input provision and consider inputs of all the honest parties. The best known statistically-secure asynchronous MPC (AMPC) with t < n/3 requires a communication of Omega(n(5)) field elements per multiplication. We consider a partially synchronous setting, where the parties are assumed to be globally synchronized initially for few rounds and then the network becomes completely asynchronous. In such a setting, we present a MPC protocol, which requires O(n(2)) communication per multiplication while ensuring input provision. Our MPC protocol relies on a new four round, communication efficient statistical verifiable secret-sharing (VSS) protocol with broadcast communication complexity independent of the number of secret-shared values.
| Item Type: | Conference Proceedings |
|---|---|
| Series.: | Lecture Notes in Computer Science |
| Publisher: | SPRINGER INTERNATIONAL PUBLISHING AG, GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND |
| Additional Information: | Copy right for this article belong to SPRINGER INTERNATIONAL PUBLISHING AG, GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 27 Aug 2018 14:57 |
| Last Modified: | 27 Aug 2018 14:57 |
| URI: | http://eprints.iisc.ac.in/id/eprint/60498 |
Actions (login required)
 |
View Item |
