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
Citations
More filters
Book
Advances in cryptology : Eurocrypt 2011 : 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15-19, 2011 : proceedings
TL;DR: This book constitutes the refereed proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2011, held in Tallinn, Estonia, in May 2011, and contains 31 papers, presented together with 2 invited talks.
Journal ArticleDOI
Cheating identifiable secret sharing scheme using symmetric bivariate polynomial
TL;DR: This paper considers cheating problem in bivariate polynomial based secret sharing scheme, and proposes two cheating identification algorithms respectively that are efficient with respect of cheater identification capabilities and achieves stronger capability of cheating identification with the collaboration of the rest n − m users who are not involved in secret reconstruction.
Book ChapterDOI
Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
TL;DR: This paper considers two very important issues namely detection and identification of k-out-of-n secret sharing schemes against rushing cheaters who are allowed to submit (possibly forged) shares after observing shares of the honest users in the reconstruction phase.
Book ChapterDOI
Secret Sharing Schemes on Compartmental Access Structure in Presence of Cheaters
TL;DR: This paper presents definitions of cheating detectable, cheater identifiable and robust secret sharing schemes in compartmental access structure and their realization through five different constructions in the information-theoretic setting and proposes protocols secure against rushing adversary.
Journal ArticleDOI
Ramp secret sharing with cheater identification in presence of rushing cheaters
TL;DR: The security model for cheater identifiable ramp secret sharing schemes is defined and two constructions for cheating cheaters are provided, one of which is secure against rushing cheaters who are allowed to submit their shares during secret reconstruction after observing other participants’ responses in one round.
References
More filters
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.
Book
Advances in Cryptology-Eurocrypt '93
TL;DR: An explicit relation between authentication codes and codes correcting independent errors is shown, which gives rise to several upper bounds on A-codes and how to construct A- codes starting from error correcting codes.
BookDOI
Advances in Cryptology - EUROCRYPT 2008
TL;DR: In this paper, a key recovery attack on Hidden Monomial Multivariate Schemes (HMAC/NMAC-MD4 and NMAC-DCMD5) is presented.
Journal ArticleDOI
Perfectly secure message transmission
TL;DR: These are the first algorithms for secure communication in a general network to simultaneously achieve the three goals of perfect secrecy, perfect resiliency, and worst-case time linear in the diameter of the network.