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
Proceedings ArticleDOI
Enhancing the efficiency of (v, r, n)-fairness secret sharing scheme
Ren-Junn Hwang,Chin-Chen Chang +1 more
TL;DR: It is shown that the proposed (v, r, n)-fairness secret sharing scheme is more efficient than Lee and Laih's scheme.
Book ChapterDOI
Theory and practice of multiparty computation
TL;DR: A short summary of the invited talk given by the author at the SCN conference can be found in this paper, along with a discussion of the authors' approach to the problem.
Journal Article
Secure multi-party computation made simple
TL;DR: A simple approach to secure multi-party computation is presented, based on essentially no mathematical structure or sophisticated subprotocols, which yields protocols secure for mixed corruption and general adversary structures in a simpler formulation and with simpler proofs.
Perfect Implementation of Normal-Form Mechanisms
TL;DR: It is proved that any normal-form mechanism can be perfectly implemented via envelopes and an envelope-randomizing device (i.e., the same tools used for running fair lotteries or tallying secret votes) and put forward the notion of a perfect implementation of a normal- form mechanism M.
Posted Content
Round Efficient Unconditionally Secure Multiparty Computation Protocol.
TL;DR: The proposed UMPC protocol is the most round efficient protocol so far and ranks second according to communication complexity.
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.