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

Journal of Cryptology

Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation

Arpita Patra, Ashish Choudhury, Chandrasekharan Pandu Rangan

Published Dec 10, 2013• 43 citations
Publisher
DOI
10.1007/s00145-013-9172-7

Related papers

Batch secret sharing for secure multi-party computation in asynchronous network

Zheng Huang, Zheng Gong, Qiang Li

Journal of Shanghai Jiaotong University (Science)•Feb 1, 2009•3 citations

Asynchronous Verifiable Secret-Sharing Protocols on a Good Day.

Soumya Basu, Dahlia Malkhi, Mike Reiter +1 more

•Jan 1, 2018•2 citations

Efficient Asynchronous Secure Multiparty Distributed Computation

Kannan Srinathan, Chandrasekharan Pandu Rangan

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

Efficient Secure Multiparty Computation Protocol in Asynchronous Network

Zheng Huang, Weidong Qiu, Qiang Li +1 more

Lecture notes in computer science•Jan 1, 2009•2 citations

Scalable Multiparty Computation from Non-linear Secret Sharing

Sanjam Garg, Abhishek Jain, Pratyay Mukherjee +1 more

Lecture notes in computer science•Jan 1, 2024•3 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