Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Efficient Secure Multiparty Computation Protocol in Asynchronous Network

Zheng Huang, Weidong Qiu, Qiang Li, Kefei Chen

Published Jan 1, 2009• 2 citations
Publisher
DOI
10.1007/978-3-642-02617-1_16

Related papers

Efficient Asynchronous Secure Multiparty Distributed Computation

Kannan Srinathan, Chandrasekharan Pandu Rangan

Lecture notes in computer science•Jan 1, 2000•42 citations

Asynchronous Secure Multiparty Computation in Constant Time

Ran Cohen

Lecture notes in computer science•Jan 1, 2016•32 citations

Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation

Arpita Patra, Ashish Choudhury, Chandrasekharan Pandu Rangan

Journal of Cryptology•Dec 10, 2013•43 citations

Breaking the O(n|C|) Barrier for Unconditionally Secure Asynchronous Multiparty Computation

Choudhary, Ashish

•Jan 1, 2013•0 citations

Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication Per Multiplication Gate

Arpita Patra, Ashish Choudhary, Chandrasekharan Pandu Rangan

•Jan 1, 2009•2 citations

Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience.

Arpita Patra, Ashish Choudhary, Chandrasekharan Pandu Rangan

Verifiable Secret Sharing (VSS) is a fundamental primitive used as a building block in many distributed cryptographic tasks, such as Secure Multiparty Computation (MPC) and Byzantine Agreement (BA). An important variant of VSS is Asynchronous VSS (AVSS) which is designed to work over asynchronous networks. AVSS is a two phase (Sharing, Reconstruction) protocol carried out among n parties in the presence of a computationally unbounded active adversary, who can corrupt up to t parties. We assume that every two parties in the network are directly connected by a pairwise secure channel. In this paper, we present a new statistical AVSS protocol with optimal 5 resilience; i.e. with n = 3t + 1. Our protocol privately communicates

•Jan 1, 2009•7 citations
Verifiable Secret Sharing (VSS) is a fundamental primitive used as a building block in many distributed cryptographic tasks, such as Secure Multiparty Computation (MPC) and Byzantine Agreement (BA). An important variant of VSS is Asynchronous VSS (AVSS) which is designed to work over asynchronous networks. AVSS is a two phase (Sharing, Reconstruction) protocol carried out among n parties in the presence of a computationally unbounded active adversary, who can corrupt up to t parties. We assume that every two parties in the network are directly connected by a pairwise secure channel. In this paper, we present a new statistical AVSS protocol with optimal 5 resilience; i.e. with n = 3t + 1. Our protocol privately communicates