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
Asynchronous Secret Reconstruction and Its Application to the Threshold Cryptography
Lein Harn,Changlu Lin +1 more
TL;DR: It is shown that when there are more than t users participating and shares are released asynchronously in the secret reconstruction, an attacker can always release his share last and therefore, can successfully impersonate to be a legitimate shareholder without being detected.
Journal ArticleDOI
Scalable mechanisms for rational secret sharing
TL;DR: This work describes mechanisms for rational secret sharing that are scalable in the sense that they requires each player to send only an expected $$O(\log n)$$O(logn) bits) bits, and a cryptographic mechanism for rational $$t$$t-out-of-$$n$$nsecret sharing that is everlasting $$\epsilon $$ϵ-Nash equilibrium.
Posted Content
A Novel Approach for Verifiable Secret Sharing by using a One Way Hash Function
Keyur Parmar,Devesh C. Jinwala +1 more
TL;DR: A novel approach for verifiable secret sharing is presented in this paper where both the dealer and shareholders are not assumed to be honest, and a one way hash function and probabilistic homomorphic encryption function are used to provide verifiability and fair reconstruction of a secret.
Proceedings ArticleDOI
A practical scheme for quantum oblivious transfer and private database sampling
TL;DR: An unconditionally secure Oblivious Transfer protocol relying on two rounds of entanglement-free quantum communication, where a player (Bob) can obtain a random sample of fixed size from a classical database, while the database owner (Alice) remains oblivious as to which bits were accessed.
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.