Lecture notes in computer science

Round and Communication Efficient Unconditionally-Secure MPC with $$t<n/3$$ in Partially Synchronous Network

Ashish Choudhury, Arpita Patra, Divya Ravi

Published Jan 1, 2017• 5 citations

Publisher

DOI: 10.1007/978-3-319-72089-0_6

Related papers

Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience

Arpita Patra, Ashish Choudhary, Chandrasekharan Pandu Rangan

Lecture notes in computer scienceJan 1, 200911 citations

Unconditionally Secure MPC for Boolean Circuits with Constant Communication

Yubo Zeng, Kang Yang, Dengguo Feng +1 more

Lecture notes in computer scienceJan 1, 20260 citations

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience

Arpita Patra, Ashish Choudhury, Chandrasekharan Pandu Rangan

Lecture notes in computer scienceJan 1, 201014 citations

On Communication Models and Best-Achievable Security in Two-Round MPC

Aarushi Goel, Abhishek Jain, Manoj Prabhakaran +1 more

Lecture notes in computer scienceJan 1, 20218 citations

Communication-Efficient Unconditional MPC with Guaranteed Output Delivery

Vipul Goyal, Yanyi Liu, Yifan Song

Lecture notes in computer scienceJan 1, 201953 citations

Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network.

Ashish Choudhury, Arpita Patra, Divya Ravi

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 $\varOmega (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 $\mathcal {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.

Jan 1, 20170 citations

Lecture notes in computer science

Round and Communication Efficient Unconditionally-Secure MPC with $t<n/3$ in Partially Synchronous NetworkRound and Communication Efficient Unconditionally-Secure MPC with $$t<n/3$$ in Partially Synchronous Network

Ashish Choudhury, Arpita Patra, Divya Ravi

Published Jan 1, 2017• 5 citations

Publisher

DOI: 10.1007/978-3-319-72089-0_6

Related papers

Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience

Arpita Patra, Ashish Choudhary, Chandrasekharan Pandu Rangan

Lecture notes in computer scienceJan 1, 200911 citations

Unconditionally Secure MPC for Boolean Circuits with Constant Communication

Yubo Zeng, Kang Yang, Dengguo Feng +1 more

Lecture notes in computer scienceJan 1, 20260 citations

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience

Arpita Patra, Ashish Choudhury, Chandrasekharan Pandu Rangan

Lecture notes in computer scienceJan 1, 201014 citations

On Communication Models and Best-Achievable Security in Two-Round MPC

Aarushi Goel, Abhishek Jain, Manoj Prabhakaran +1 more

Lecture notes in computer scienceJan 1, 20218 citations

Communication-Efficient Unconditional MPC with Guaranteed Output Delivery

Vipul Goyal, Yanyi Liu, Yifan Song

Lecture notes in computer scienceJan 1, 201953 citations

Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network.

Ashish Choudhury, Arpita Patra, Divya Ravi

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 $\varOmega (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 $\mathcal {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.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 $\varOmega (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 $\mathcal {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.

Jan 1, 20170 citations

Round and Communication Efficient Unconditionally-Secure MPC with

t<n/3

in Partially Synchronous Network

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

\varOmega (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

\mathcal {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.