Book ChapterDOI
Secret Sharing Schemes with Veto Capabilities
Carlo Blundo,Alfredo De Santis,Luisa Gargano,Ugo Vaccaro +3 more
- Vol. 781, pp 82-89
TLDR
A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any non-qualified subset has absolutely no information on the secret.Abstract:
A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any non-qualified subset has absolutely no information on the secretread more
Citations
More filters
Journal ArticleDOI
Counting-based secret sharing technique for multimedia applications
TL;DR: This work presented two different modeling variations that are mainly different in the secret-sharing keys generation where both are studied elaborating their pros and cons.
Journal ArticleDOI
On the information rate of secret sharing schemes
TL;DR: The first proof of the existence of access structures with optimal information rate and optimal average information rate less that 1/2 + e is given, where e is an arbitrary positive constant.
Journal ArticleDOI
Detection and identification of cheaters in (t, n) secret sharing scheme
Lein Harn,Changlu Lin +1 more
TL;DR: This paper considers the situation that there are more than t shareholders participated in the secret reconstruction and uses the shares generated by the dealer to reconstruct the secret and, at the same time, to detect and identify cheaters.
Book ChapterDOI
On the information rate of secret sharing schemes
TL;DR: In this article, it was shown that any graph with n vertices admits a secret sharing scheme with information rate Ω((log n)/n), where n is an arbitrary positive constant.
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
How to play ANY mental game
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
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
Polynomial Codes Over Certain Finite Fields
I. S. Reed,G. Solomon +1 more
TL;DR: A mapping of m symbols into 2 symbols will be shown to be (2 m)/2 or ( 2 m 1)/2 symbol correcting, depending on whether m is even or odd.