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

On General Perfect Secret Sharing Schemes

G. R. Blakley, Gregory Kabatianski

Published Jan 1, 1995• 11 citations
Publisher
DOI
10.1007/3-540-44750-4_29

Related papers

Recent Advances in Non-perfect Secret Sharing Schemes

Oriol Farràs

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

Optimal Non-perfect Uniform Secret Sharing Schemes

Oriol Farràs, Torben Brandt Hansen, Tarik Kaced +1 more

Lecture notes in computer science•Jan 1, 2014•21 citations

A perfect threshold secret sharing scheme to identify cheaters

Marco Carpentieri

Designs Codes and Cryptography•May 1, 1995•69 citations

Some improved bounds on the information rate of perfect secret sharing schemes

Ernest F. Brickell, Douglas R. Stinson

Journal of Cryptology•Oct 1, 1992•147 citations

Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes

Ernest F. Brickell, Doug R. Stinson

Lecture notes in computer science•Jan 1, 1991•21 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).