Book ChapterDOI
An Efficient Robust Secret Sharing Scheme with Optimal Cheater Resiliency
TLDR
A simple t-out-of-n secret sharing scheme, which can reconstruct the secret in presence of t cheating participants except with probability at most δ, provided t < n/2, is designed.Abstract:
In this paper, we consider the problem of (t, δ) robust secret sharing secure against rushing adversary. We design a simple t-out-of-n secret sharing scheme, which can reconstruct the secret in presence of t cheating participants except with probability at most δ, provided t < n/2. The later condition on cheater resilience is optimal for the case of public reconstruction of the secret, on which we focus in this work.read more
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.
Book
The Theory of Error-Correcting Codes
TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
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.
Book ChapterDOI
Self Protecting Pirates and Black-Box Traitor Tracing
Aggelos Kiayias,Moti Yung +1 more
TL;DR: In this article, it was shown that the Boneh-Franklin (BF) scheme and the Kurosawa-Desmedt (KDS) scheme have no black-box traceability in the self-protecting model when the number of traitors is super-logarithmic.