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

Cryptography and Communications

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

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

Published Dec 15, 2010• 16 citations
Publisher
DOI
10.1007/s12095-010-0039-6

Related papers

Round-efficient perfectly secure message transmission scheme against general adversary

Kaoru Kurosawa

Designs Codes and Cryptography•Jul 16, 2011•2 citations

Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary

Ashish Choudhury, Kaoru Kurosawa, Arpita Patra

Lecture notes in computer science•Jan 1, 2011•1 citation

Optimal One Round Almost Perfectly Secure Message Transmission (Short Paper)

Mohammed Ashraful Alam Tuhin, Reihaneh Safavi–Naini

Lecture notes in computer science•Jan 1, 2012•4 citations

Bounds and Constructions for 1-Round (0,δ)-Secure Message Transmission against Generalized Adversary

Reihaneh Safavi–Naini, Mohammed Ashraful Alam Tuhin

Lecture notes in computer science•Jan 1, 2012•0 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 secretscorrectly 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 calledQ3. 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).

IEEE Transactions on Information Theory•Sep 1, 2011•8 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 secretscorrectly 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 calledQ3. 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).
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).