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
Journal ArticleDOI
Rational secret sharing as extensive games
Zhifang Zhang,Mulan Liu +1 more
TL;DR: This paper first model 2-out-of-2 rational secret sharing in an extensive game with imperfect information, and then provides a strategy for achieving secret recovery in this game, proving that the strategy is a sequential equilibrium which means after any history of the game no player can benefit from deviations so long as the other players stick to the strategy.
Book ChapterDOI
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
Yuval Ishai,Mor Weiss +1 more
TL;DR: A Probabilistically Checkable Proof allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form “x ∈ L” by querying only few bits of the proof.
Journal ArticleDOI
Conference key agreement protocol with non-interactive fault-tolerance over broadcast network
Jiin-Chiou Cheng,Chi-Sung Laih +1 more
TL;DR: A novel strategy, where any malicious conferee may be identified and removed from the conferee list without any interaction and, with such a non-interactive fault-tolerance, conferences could be established and started efficiently.
Book ChapterDOI
Cheating immune (2, n )-threshold visual secret sharing
TL;DR: This paper provides new (2,n)-threshold visual cryptography schemes and provides a formal definition of cheating which requires that a group of cheaters be able to deterministically force a honest participant to reconstruct a wrong secret.
Book ChapterDOI
Broadcast-Optimal Two-Round MPC
TL;DR: This work provides a complete characterization of the trade-off between number of broadcast rounds and achievable security level for two-round MPC tolerating arbitrarily many active corruptions and considers all possible combinations of broadcast and point-to-point rounds against the three standard levels of security for maliciously secure MPC protocols.
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.