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
Foundations of Secure Computation: Perfect Security and Fairness
TL;DR: This thesis provides a full proof of security of the BGW protocol and presents a new multiplication protocol that is based on the original construction, but is simpler and achieves higher efficiency.
Proceedings Article
Public-randomness in public-key cryptography (extended abstract)
TL;DR: In this article, the power of public randomness in the context of public-key cryptosystems was investigated and the first completely non-interactive implementation of oblivious transfer was proposed.
Journal Article
Some applications of polynomials for the design of cryptographic protocols
TL;DR: This paper surveys some recent work on applications of polynomials (over finite fields) to the design of various cryptographic protocols.
Proceedings ArticleDOI
From Partial to Global Asynchronous Reliable Broadcast
TL;DR: This work considers reliable broadcast protocols assuming a communication network which provides each subset of b parties with reliable broadcast channels, and concludes that ΠRBC is an asymptotically optimal reliable broadcast protocol, and ΠnRBC, where parties are guaranteed to obtain output as in reliable broadcast but may need to run forever, is an optimal nonstop reliable broadcast Protocol.
Dissertation
Secure message transmission in the general adversary model
TL;DR: The first ever efficient, constant round PSMT protocols in the general adversary model is given, which shows the necessary and sufficient conditions for all levels of SMT in di�fferent adversary models.
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.