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
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract)
TL;DR: In this paper, the authors study information-theoretic secure multiparty protocols that achieve full security, including guaranteed output delivery, at the presence of an active adversary that corrupts a constant fraction of the parties.
Proceedings Article
Cryptography and mechanism design
TL;DR: Mechanism Design is the algorithmic component of Game Theory, the synthesis of protocols for selfish parties to achieve certain properties in order to decide on some "social choice".
Book ChapterDOI
Secure computation with partial message loss
TL;DR: In this article, the authors proposed a secure MPC protocol with an intermediate assumption on message delivery, where message delivery is not guaranteed even if only a small fraction of messages are lost due to transient network problems.
Book ChapterDOI
Distribution of CA-Role in Block-Chain Systems
TL;DR: A practical distributed CA-based PKI scheme is proposed that is well-associated with existed mechanisms (such as POW) in the original system and solutions of verification and multi-level assigning issues are constructed via verifiable secret sharing and multilevel secret sharing tools.
Efficient cryptographic tools for secure distributed computing
TL;DR: A set of efficient and practical tools that can be used to enhance security of existing distributed systems are presented, yielding the first reasonably efficient threshold pseudo-random permutation (PRP) and considering incentive compatibility in the context of distributed systems.
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.