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
On the Power of an Honest Majority in Three-Party Computation Without Broadcast
TL;DR: The goal is to characterize the set of functionalities that can be computed with full security, assuming an honest majority, but no broadcast, in the case of three-party asymmetric functionalities, providing a variety of necessary and sufficient conditions to enable fully secure computation.
Proceedings ArticleDOI
Secret shares to protect health records in Cloud-based infrastructures
William J Buchanan,Elochukwu Ukwandu,Nicole van Deursen,Lu Fan,Gordon Russell,Owen Lo,Christoph Thuemmler +6 more
TL;DR: A novel Cloud-based architecture (SECRET) which supports keyless encryption methods and which can be used for the storage of patient information, along with supporting failover and a break-glass policy is outlined.
Book ChapterDOI
Robust Secret Sharing for End-to-End Key Establishment with Physical Layer Keys Under Active Attacks
TL;DR: Investigations show that a secure key exchange is even possible with a high number of attackers in the system, and the basic idea is to use a robust secret sharing scheme under different attack scenarios.
Proceedings ArticleDOI
Quantum private data sampling
TL;DR: A novel quantum communication protocol for "Private Data Sampling", where a player (Bob) obtains a random sample of limited size of a classical database, while the database owner (Alice) remains oblivious as to which bits were accessed.
Journal Article
The match-making problem
Jeroen Graaf,van de +1 more
TL;DR: A cryptographic protocol to evaluate an and-gate such that a party can keep his or her input bit secret from the other party is discussed, because it can be generalized to any logical circuit for any number of participants.
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.