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
Book ChapterDOI
Secure communication in broadcast channels: the answer to Franklin and Wright's question
Yongge Wang,Yvo Desmedt +1 more
TL;DR: This paper will answer the question whether there exists an efficient protocol to achieve probabilisticly reliable and perfectly private communication when ⌈3t/2⌉ ≥ n > t affirmatively and study related problems.
Book ChapterDOI
Secure Computation from Elastic Noisy Channels
TL;DR: In this paper, the authors study a form of unreliable noisy channels where the unreliability is one-sided, that they name elastic noisy channels: thus, an adversarial receiver can increase the reception reliability unbeknown to the sender, but the sender cannot change the channel characteristic.
Journal ArticleDOI
The Cost of Fault Tolerance in Multi-Party Communication Complexity
TL;DR: This article proves that the impact of failures is significant, at least for the Sum aggregate function in general topologies, and proves that fault-tolerant communication complexity needs to be studied separately from non-fault-tolerance communication complexity, instead of being considered as an “amended” version of the latter.
A Multiparty Computation for Randomly Ordering Players and Making Random Selections
TL;DR: In this writing, a protocol (named “RandomSelect”) is presented using multiplayer computation that provides a means for players to make local choices that when combined, jointly select a permutation randomly.
Journal ArticleDOI
Nearly optimal robust secret sharing
TL;DR: It is proved that a known general approach to improve Shamir’s celebrated secret sharing scheme can make it robust for n parties against any collusion of size, and existing systems employing Shamir-type secret sharing schemes can be made much more robust than previously thought with minimal change.
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.