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
Posted ContentDOI
Complexity of multi-party computation functionalities
TL;DR: This chapter surveys a set of results that constitute a Cryptographic Complexity Theory, and presents unified combinatorial characterizations of completeness and triviality for secure function evaluation using notions of isomorphism and the common information functionality of a given functionality.
Book ChapterDOI
Unconditionally Secure Computation with Reduced Interaction
TL;DR: In this article, the authors considered the problem of how much interaction is needed for unconditionally secure multiparty computation, and they showed lower bounds on the message complexity of both types of functions, considering two notions of message complexity called conservative and liberal, where conservative is the more standard one.
Journal ArticleDOI
Tightly coupled multi-group threshold secret sharing based on Chinese Remainder Theorem
TL;DR: A tightly coupled MGSS scheme based on Chinese Remainder Theorem is proposed that is capable of thwarting IP and SC attacks, and is more flexible and popular in applications compared with MLSS scheme.
Dissertation
Towards Practical Privacy-Preserving Protocols
TL;DR: Results are presented showing how real-world applications can be executed in a privacy-preserving way, not only desired by users of such applications, but since 2018 also based on a strong legal foundation with the GDPR in the European Union that enforces privacy protection of user data by design.
Posted Content
Multiparty computation unconditionally secure against Q^2 adversary structures
Adam Smith,Anton Stiglic +1 more
TL;DR: A protocol for multiparty computation which tolerates any Q^2 active adversary structure based on the existence of a broadcast channel, secure communication between each pair of participants, and a monotone span program with multiplication tolerating the structure is given.
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.