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
Patent
Logging access attempts to an area
TL;DR: Logging events associated with accessing an area includes recording an event associated with access to the area to provide an event recording and authenticating at least the event recording to provide a single authenticated recording.
Journal ArticleDOI
Improving the round complexity of VSS in point-to-point networks
TL;DR: This work focuses here on the case of perfect VSS where the number of corrupted parties t satisfies t and revisits the following question: what is the optimal round complexity of verifiable secret sharing?
Secure multiparty computation for privacy preserving data mining
TL;DR: This document contains a student thesis (bachelor's or master's), as authored by a student at Eindhoven University of Technology.
Journal Article
General adversaries in unconditional multi-party computation
TL;DR: A generalized adversary model for unconditionally secure multi-party computation that generalizes the classical threshold results of Ben-Or, Goldwasser and Wigderson, Chaum, Crepeau, and Damgard, and Rabin and Ben- or, and reduces the complexity to polynomial.
Journal ArticleDOI
An Efficient Framework for Unconditionally Secure Multiparty Computation
Ashish Choudhury,Arpita Patra +1 more
TL;DR: This paper proposes a new and simple framework for generating shared and private random multiplication triples with unconditional security and presents the first ever MPC protocols with a linear (in the number of parties) communication overhead per multiplication gate in the circuit.
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.