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
Proceedings ArticleDOI
Collaborative filtering with privacy
TL;DR: This work describes an algorithm whereby a community of users can compute a public "aggregate" of their data that does not expose individual users' data, and uses homomorphic encryption to allow sums of encrypted vectors to be computed and decrypted without exposing individual data.
Proceedings ArticleDOI
How to withstand mobile virus attacks (extended abstract)
Rafail Ostrovsky,Moti Yung +1 more
TL;DR: A study of distributed adversarial model of computation in which faults are non-stationary and can move through the net work, analogous to a spread of a virus or a worm is initiated.
Journal ArticleDOI
Resilient Network Coding in the Presence of Byzantine Adversaries
Sidharth Jaggi,Michael Langberg,Sachin Katti,Tracey Ho,Dina Katabi,Muriel Medard,Michelle Effros +6 more
TL;DR: This paper introduces the first distributed polynomial-time rate-optimal network codes that work in the presence of Byzantine nodes, and presents algorithms that target adversaries with different attacking capabilities.
Proceedings ArticleDOI
Receipt-free secret-ballot elections (extended abstract)
Josh Benaloh,Dwight Tuinstra +1 more
TL;DR: This paper presents the first verifiable secret-ballot election protocols in which participants are unable to prove to others how they voted, and describes how this defect is embedded within prior election protocols.
Book ChapterDOI
Fair Computation of General Functions in Presence of Immoral Majority
Shafi Goldwasser,Leonid A. Levin +1 more
TL;DR: A method for n players to compute correctly, privately, and fairly any computable function f(x1,...,xn) where xi, is the input of the i-th player, and proposes a simpler definition of security for multi-player protocols which still implies previous definitions of privacy and correctness.
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.