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

Asynchronous Verifiable Secret-Sharing Protocols on a Good Day.

Soumya Basu, Dahlia Malkhi, Mike Reiter, Alin Tomescu

Published Jan 1, 2018• 2 citations
OpenAlex

Related papers

Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation

Arpita Patra, Ashish Choudhury, Chandrasekharan Pandu Rangan

Journal of Cryptology•Dec 10, 2013•43 citations

Asynchronous Error-Decodable Secret-Sharing and Its Application

Ashish Choudhury

Lecture notes in computer science•Jan 1, 2015•0 citations

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

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

Arpita Patra, Ashish Choudhary, Chitra Rangan

Abstract. Verifiable Secret Sharing (VSS) is a fundamental primitive used in many distributed cryptographic tasks, such as Multiparty Computation (MPC) and Byzantine Agreement (BA). It is a two phase (sharing, reconstruction) protocol. The VSS and MPC protocols are carried out among n parties, where t out of n parties can be under the influence of a Byzantine (active) adversary, having unbounded computing power. It is well known that protocols for perfectly secure VSS and perfectly secure MPC exist in an asynchronous network iff n ≥ 4t+1. Hence, we call any perfectly secure VSS (MPC) protocol designed over an asynchronous network with n = 4t + 1 as optimally resilient VSS (MPC) protocol. A secret is d-shared among the parties if there exists a random degreed polynomial whose constant term is the secret and each honest party possesses a distinct point on the degree-d polynomial. Typically VSS is used as a primary tool to generate t-sharing of secret(s). In this paper, we present an optimally resilient, perfectly secure Asynchronous VSS (AVSS)

•Jan 1, 2010•0 citations

Linear-Communication Asynchronous Complete Secret Sharing with Optimal Resilience

Xiaoyu Ji, Junru Li, Yifan Song

Lecture notes in computer science•Jan 1, 2024•12 citations

Broadcast (and Round) Efficient Verifiable Secret Sharing

Juan A. Garay, Clint Givens, Rafail Ostrovsky +1 more

Lecture notes in computer science•Jan 1, 2014•10 citations
Abstract. Verifiable Secret Sharing (VSS) is a fundamental primitive used in many distributed cryptographic tasks, such as Multiparty Computation (MPC) and Byzantine Agreement (BA). It is a two phase (sharing, reconstruction) protocol. The VSS and MPC protocols are carried out among n parties, where t out of n parties can be under the influence of a Byzantine (active) adversary, having unbounded computing power. It is well known that protocols for perfectly secure VSS and perfectly secure MPC exist in an asynchronous network iff n ≥ 4t+1. Hence, we call any perfectly secure VSS (MPC) protocol designed over an asynchronous network with n = 4t + 1 as optimally resilient VSS (MPC) protocol. A secret is d-shared among the parties if there exists a random degreed polynomial whose constant term is the secret and each honest party possesses a distinct point on the degree-d polynomial. Typically VSS is used as a primary tool to generate t-sharing of secret(s). In this paper, we present an optimally resilient, perfectly secure Asynchronous VSS (AVSS)