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
Patent
Controlling group access to doors
TL;DR: In this article, an entity controlling access of a plurality of users to at least one disconnected door includes mapping the plurality of user to a group, for each time interval d of a sequence of dates.
Book ChapterDOI
Approximate quantum error-correcting codes and secret sharing schemes
TL;DR: In this paper, it was shown that error-tolerant secret sharing schemes can be constructed in the quantum model with fidelity exponentially close to 1, at the price of increasing the size of the register.
Universally Composable Security: A New Paradigm for Cryptographic Protocols (Extended Abstract)
TL;DR: The notion of universally composable security as discussed by the authors was proposed for defining security of cryptographic protocols, and it has been applied to a wide array of cryptographic tasks, including authenticated and secure communication, key exchange, public-key encryption, signature, commitment, oblivious transfer, zero knowledge and more.
Book ChapterDOI
On the Foundations of Modern Cryptography
TL;DR: This essay surveys some of these paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems as well as some of the fundamental results obtained using them.
Proceedings ArticleDOI
A robust threshold elliptic curve digital signature providing a new verifiable secret sharing scheme
TL;DR: A new verifiable secret sharing scheme (VSS) other than Feldman's and Pedersen's schemes suitable to protect elliptic curve secret keys and is able to tolerate n/3 malicious adversary with the cost of higher complexity.
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.