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
Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC
Ghada Almashaqbeh,Fabrice Benhamouda,Seungwook Han,Daniel Jaroslawicz,Tal Malkin,Alex Nicita,Tal Rabin,Abhishek Shah,Eran Tromer +8 more
Posted Content
Leakage of Dataset Properties in Multi-Party Machine Learning
TL;DR: In this paper, the authors show that a "curious" party can infer the distribution of sensitive attributes in other parties' data with high accuracy, even when parties obtain only black-box access to the final model.
Journal ArticleDOI
Unmediated communication with partially verifiable types
TL;DR: It is shown that with five or more players, all outcomes that are feasible with the help of a mediator can also be achieved with direct communication between players if verifiable information can be encrypted.
Book ChapterDOI
Brief announcement: synchronous Las Vegas URMT iff asynchronous Monte Carlo URMT
TL;DR: In the unconditionally reliable message transmission (URMT) problem, two non-faulty nodes, the sender S and the receiver R are part of a communication network modelled as a digraph over a set of nodes influenced by an unbounded active adversary that may corrupt some subset of these nodes.
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.