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

Asynchronous Error-Decodable Secret-Sharing and Its Application

Ashish Choudhury

Published Jan 1, 2015• 0 citations
Publisher
DOI
10.1007/978-3-319-26961-0_22

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 Verifiable Secret-Sharing Protocols on a Good Day.

Soumya Basu, Dahlia Malkhi, Mike Reiter +1 more

•Jan 1, 2018•2 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

Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

Keith M. Martin, Maura B. Paterson, Douglas R. Stinson

Cryptography and Communications•Dec 15, 2010•16 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

General Error Decodable Secret Sharing Scheme and Its Application.

Kaoru Kurosawa

Consider a model of secret sharing schemes with cheaters. We say that a secret sharing scheme is error decodable if we can still recover the secret s correctly from a noisy share vector (share1', ..., sharen'). In this paper, we first prove that a perfect secret sharing scheme is error decodable if and only if the adversary structure Γ satisfies a certain condition called Q3. Next, for such Γ , we show a scheme such that the decoding algorithm runs in polynomial-time in |S | and the size of a linear secret sharing scheme which realizes Γ. We finally show an application to 1-round perfectly secure message transmission schemes (PSMT).

•Jan 1, 2009•7 citations
Consider a model of secret sharing schemes with cheaters. We say that a secret sharing scheme is error decodable if we can still recover the secret s correctly from a noisy share vector (share1', ..., sharen'). In this paper, we first prove that a perfect secret sharing scheme is error decodable if and only if the adversary structure Γ satisfies a certain condition called Q3. Next, for such Γ , we show a scheme such that the decoding algorithm runs in polynomial-time in |S | and the size of a linear secret sharing scheme which realizes Γ. We finally show an application to 1-round perfectly secure message transmission schemes (PSMT).