Proceedings ArticleDOI
Verifiable secret sharing and multiparty protocols with honest majority
Tal Rabin,Michael Ben-Or +1 more
- pp 73-85
TLDR
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.Abstract:
Under the assumption that each participant can broadcast a message to all other participants and that each pair of participants can communicate secretly, we present a verifiable secret sharing protocol, and show that any multiparty protocol, or game with incomplete information, can be achieved if a majority of the players are honest. The secrecy achieved is unconditional and does not rely on any assumption about computational intractability. Applications of these results to Byzantine Agreement are also presented.Underlying our results is a new tool of Information Checking which provides authentication without cryptographic assumptions and may have wide applications elsewhere.read more
Citations
More filters
ReportDOI
Verifiable Secret Redistribution for Threshold Sharing Schemes
TL;DR: A new protocol for the verifiable redistribution of secrets from (m,n) to (m',n') access structures for threshold sharing schemes is presented, which enables the addition or removal of shareholders and also guards against mobile adversaries that cause permanent damage.
Posted Content
Secure Multiparty Computation for Privacy-Preserving Data Mining.
Yehuda Lindell,Benny Pinkas +1 more
TL;DR: The issue of e-ciency is discussed and the di-cul- ties involved in constructing highly e-cient protocols are demonstrated and the relationship between secure multiparty computation and privacy-preserving data mining is discussed.
Book ChapterDOI
Protocols for multiparty coin toss with dishonest majority
Amos Beimel,Eran Omri,Ilan Orlov +2 more
TL;DR: This work presents an r-round m-party coin-tossing protocol with optimal bias of O(1/r), and extends Moran et al. results to the multiparty model when less than 2/3 of the parties are malicious.
Proceedings ArticleDOI
On the complexity of verifiable secret sharing and multiparty computation
TL;DR: It is shown that even if protocols are given black-box access for free to an idealized secret sharing scheme secure for the access structure in question, it is not possible to handle all relevant access structures efficiently, not even if the adversary is passive and static.
Journal ArticleDOI
Secret Sharing With Public Reconstruction
Amos Beimel,Benny Chor +1 more
TL;DR: It is proved that the first implementation is optimal (up to constant factors) by showing a tight /spl Omega/(n/t) lower bound for the increase in the shares' size.
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
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 Article
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
TL;DR: The above bounds on t , where t is the number of players in actors, are tight!
Proceedings ArticleDOI
Completeness theorems for non-cryptographic fault-tolerant distributed computation
TL;DR: In this article, the authors show that every function of n inputs can be efficiently computed by a complete network of n processors in such a way that if no faults occur, no set of size t can be found.
Proceedings ArticleDOI
Multiparty unconditionally secure protocols
TL;DR: It is shown that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest and the secrecy achieved is unconditional.