multiplication 3
Round and Advice Able Unconditionally-secure MPC with $t < n/3$ in Partially Ancillary NetworkAshish Choudhury and Arpita Patra and Divya RaviAbstract: In this work, we abstraction unconditionally-secure multi-party ciphering (MPC) tolerating $t < n/3$ corruptions, area $n$ is the absolute cardinal of parties involved. In this setting, it is able-bodied accepted that if the basal arrangement is absolutely asynchronous, again one can accomplish alone statistical security; also it is absurd to ensure ascribe accouterment and accede inputs of all the honest parties. The best accepted statistically-secure asynchronous MPC (AMPC) with $t<n/3$ requires a advice of $O(n^5)$ acreage elements per multiplication. We accede a partially ancillary setting, area the parties are affected to be globally synchronized initially for few circuit and again the arrangement becomes absolutely asynchronous. In such a setting, we present a MPC protocol, which requires $O(n^2)$ advice per multiplication while ensuring ascribe provision. Our MPC agreement relies on a new four round, advice able statistical absolute secret-sharing (VSS) agreement with advertisement advice complication absolute of the cardinal of secret-shared values. Category / Keywords: Absolute Secret Sharing, Partial Synchronous, Multi-party computation, statistical securityOriginal Publication (with above differences): ICITS 2017 Date: accustomed 10 Oct 2017, aftermost revised 15 Oct 2017Contact author: divya 18oct at gmail comAvailable format(s): PDF | BibTeX Citation Version: 20171016:045328 (All versions of this report) Short URL: ia.cr/2017/1006 Altercation forum: Show altercation | Start new discussion
[ Cryptology ePrint annal ]
