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
Dissertation
Broadcast and verifiable secret sharing: new security models and round optimal constructions
Jonathan Katz,Ranjit Kumaresan +1 more
TL;DR: This dissertation considers the design of fault-tolerant protocols for broadcast and verifiable secret sharing with stronger security guarantees and improved round complexity, and builds an efficient perfectly secure VSS protocol tolerating t < n/3 corrupted parties and shows two improvements regarding the round complexity of information-theoretic VSS.
Posted Content
Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity.
TL;DR: A new and simple framework for generating shared random multiplication triples that can be adapted to any honest majority setting and avoids using the multiplication protocols that are typically communica- tion intensive.
Posted Content
Simple and Asymptotically Optimal t-Cheater Identifiable Secret Sharing Scheme.
TL;DR: A very simple k-out-of-n secret sharing scheme, which can identify up to t cheaters, with probability at least 1 − ε, where 0 < ε < 1/2, provided t < k/2.
Book ChapterDOI
On private computation in incomplete networks
TL;DR: This paper says that a function can be computed privately in a network if there is a protocol in which each processor learns only the information implied by its input and the output of the protocol.
Proceedings ArticleDOI
Privacy Preserving Multiagent Probabilistic Reasoning about Ambiguous Contexts: A Case Study
TL;DR: This paper proposes to apply MSBNs to uncertain contexts representation and reasoning in ubiquitous environments to provide context-aware services and applications in distributed multiagent 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.