Book ChapterDOI
A Construction of Practical Secret Sharing Schemes using Linear Block Codes
Michael Bertilsson,Ingemar Ingemarson +1 more
- pp 67-79
TLDR
This paper generalizes results from constructions of threshold schemes using linear block codes to construct secret sharing schemes for arbitrary access structure and presents a solution to the problem of retrieving the secret.Abstract:
In this paper we address the problem of constructing secret sharing schemes for general access structures. The construction is inspired by linear block codes. Already in the beginning of the eighties constructions of threshold schemes using linear block codes were presented in [6] and [7]. In this paper we generalize those results to construct secret sharing schemes for arbitrary access structure. We also present a solution to the problem of retrieving the secret.read more
Citations
More filters
Book ChapterDOI
Secret-sharing schemes: a survey
TL;DR: This survey describes the most important constructions of secret-sharing schemes and explains the connections between secret- sharing schemes and monotone formulae and monOTone span programs, and presents the known lower bounds on the share size.
Book ChapterDOI
General secure multi-party computation from any linear secret-sharing scheme
TL;DR: It is shown that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) for the players, provided that the access structure of the LSSS allows MPC or VSS at all.
Book
Secure Multiparty Computation and Secret Sharing
TL;DR: This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and secret sharing, focusing on asymptotic results with interesting applications related to MPC.
Proceedings ArticleDOI
SoK: General Purpose Compilers for Secure Multi-Party Computation
TL;DR: This work surveys general-purpose compilers for secure multi-party computation and evaluates eleven systems on a range of criteria, including language expressibility, capabilities of the cryptographic back-end, and accessibility to developers.
Book ChapterDOI
Nonperfect secret sharing schemes and matroids
TL;DR: This paper shows that nonperfect secret sharing schemes (NSS) have matroid structures and presents a direct link between the secret sharing matroids and entropy for both perfect and nonperfect schemes.
References
More filters
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Proceedings ArticleDOI
Safeguarding cryptographic keys
TL;DR: Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosystem, 1 , 5 or the system master key and certain other keys in a DES cryptos system, 3 are so important that they present a dilemma.
Journal ArticleDOI
On secret sharing systems
TL;DR: A linear coding scheme for secret sharing is exhibited which subsumes the polynomial interpolation method proposed by Shamir and can also be viewed as a deterministic version of Blakley's probabilistic method.
Journal ArticleDOI
On sharing secrets and Reed-Solomon codes
TL;DR: Decoding algorithms for Reed-Solomon codes provide extensions and generalizations of Shamir's method, which is closely related to Reed- Solomon coding schemes.