Book ChapterDOI
Secret Sharing Schemes on Compartmental Access Structure in Presence of Cheaters
Jyotirmoy Pramanik,Partha Sarathi Roy,Sabyasachi Dutta,Avishek Adhikari,Kouichi Sakurai +4 more
- pp 171-188
TLDR
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.Abstract:
Various adversarial scenarios have been considered in secret sharing for threshold access structure. However, threshold access structure can not provide efficient solution when participants are classified in different compartments. Of many access structures for which ideal secret sharing schemes can be realized, compartmental access structure is an important one. This paper is targeted to initiate the study of secret sharing schemes for compartmental access structure secure against malicious adversary. 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. Moreover in case of cheater identification and robustness, proposed protocols are secure against rushing adversary who are allowed to submit (possibly forged) shares after observing shares of the honest participants in the reconstruction phase.read more
Citations
More filters
Journal ArticleDOI
Linear (t,n) Secret Sharing Scheme with Reduced Number of Polynomials
TL;DR: A new polynomial based linear secret sharing scheme is proposed, which is based on Shamir’ssecret sharing scheme and ElGamal cryptosystem and has half computation overhead than the previous linear scheme.
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.
Book ChapterDOI
Evolving Secret Sharing with Essential Participants
TL;DR: This work considers the problem of evolving secret sharing with t essential participants, namely, over t-(k, ∞) access structure, a generalization of (k,∞) secret sharing (t = 0), and generalizes this access structure to a possible case of unbounded number of essential participants and provides a construction for secret sharing.
Posted ContentDOI
Evolving Secret Sharing in Almost Semi-honest Model
TL;DR: Li et al. as mentioned in this paper introduced a new cheating model, called the almost semi-honest model, where a shareholder who joins later can check the authenticity of share of previous ones, and they used collision resistant hash function to construct such a secret sharing scheme with malicious node identification.
Book ChapterDOI
Cheating Detectable Ramp Secret Sharing with Optimal Cheating Resiliency
TL;DR: In this paper, the authors formalized the definition of cheating in ramp secret sharing schemes and proposed two constructions, which are optimal cheating resilient against a centralized adversary with unbounded computational resources.
References
More filters
Proceedings ArticleDOI
Verifiable secret sharing and multiparty protocols with honest majority
Tal Rabin,Michael Ben-Or +1 more
TL;DR: In this paper, the authors present a verifiable secret sharing protocol for games with incomplete information and show that the secrecy achieved is unconditional and does not rely on any assumption about computational intractability.
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 ChapterDOI
Some ideal secret sharing schemes
TL;DR: This paper constructs ideal secret sharing schemes for more general access structures which include the multilevel and compartmented access structures proposed by Simmons.
Journal ArticleDOI
A literature survey on smart cities
TL;DR: The origin and main issues facing the smart city concept are introduced, and the fundamentals of a smart city by analyzing its definition and application domains are presented.
Book ChapterDOI
How to (Really) Share a Secret
TL;DR: Although it is implicit, it is almost never stated explicitly that in a single-key cryptographic communications link, the transmitter and the receiver must unconditionally trust each other since either can do anything that the other can.
Related Papers (5)
Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication
Masahito Hayashi,Takeshi Koshiba +1 more