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
Multi party computations: past and present
TL;DR: Cryptography is traditionally concerned with two users, Alice and Bob, who want to communicate privately and authentically over an insecure channel, and in modern times engage in protocols such as coin flipping over the telephone, contract signing, and interactive zero-knowledge proofs.
Proceedings ArticleDOI
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
TL;DR: In this paper, the authors describe a new information-theoretic protocol (and a computationally secure variant) for secure three-party computation with an honest majority, and demonstrate that high-throughput secure computation is possible on standard hardware.
Journal ArticleDOI
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
Pesech Feldman,Silvio Micali +1 more
TL;DR: This paper exhibits a protocol that, in probabilistic polynomial time and without relying on any external trusted party, reaches Byzantine agreement in an expected constant number of rounds and in the worst natural fault model.
Book ChapterDOI
Perfectly-secure MPC with linear communication complexity
TL;DR: This protocol provides perfect security against an active, adaptive adversary corrupting t < n/3 players, which is optimal, and improves the efficiency of perfectly secure MPC protocols by a factor of Ω(n2).
Proceedings Article
Secure Computation (Abstract)
Silvio Micali,Phillip Rogaway +1 more
TL;DR: The reducibility of secure protocols is believed to be a cornerstone in a mature theory of secure computation, which is based on the idea that the adversary should know, in a very strong sense, certain information associated to the execution of a protocol.
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.