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
Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort
TL;DR: The first quantum protocol that admits security-with-identifiable-abort, which allows the honest parties to agree on the identity of a corrupted party in case of an abort, was proposed in this paper.
Journal ArticleDOI
Shared Secret Reconstruction
Jingmin He,Ed Dawson +1 more
TL;DR: This paper proposes and analyzes several methods to achieve a fair reconstruction of shared secrets and emphasizes that all involved participants should have the same chance to be able to reconstruct the shared secret.
Dissertation
General construction methods of secret sharing schemes and visual secret sharing schemes
TL;DR: The notion of ideal perfect SS schemes is extended to define well-realized ramp SS schemes, and the coding rate obtained by this method is optimal in the multiple assignment maps, and hence, it is more efficient than the cumulative map.
Posted Content
Resource Fairness and Composability of Cryptographic Protocols.
TL;DR: In this article, the notion of resource-fair protocols is introduced, which is similar to the security definition in the universal composability (UC) framework, but works in a model that allows any party to request additional resources from the environment to deal with dishonest parties that may prematurely abort.
Proceedings ArticleDOI
Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
TL;DR: In this paper, a cryptographic primitive called succinctly reconstructed distributed signatures (SRDS) was defined for constructing O(1) balanced Byzantine agreement protocols with O( √ n) bits per party.
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.