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
New application of reliable agreement: underlying an unsecured business environment
TL;DR: The Two-Phase Agreement (TPA) protocol is proposed to make easy the sub-companies' communication with the main-company or decision-making in company conference.
Proceedings Article
Secret Sharing with Public Reconstruction (Extended Abstract)
Amos Beimel,Benny Chor +1 more
TL;DR: In this paper, the authors investigated the cost of performing the reconstruction over public communication channels, and showed that a naive implementation of this task distributes O(n) one times pads to each party.
Journal ArticleDOI
Concretely efficient secure multi-party computation protocols: survey and more
Dengguo Feng,Kang Yang +1 more
TL;DR: This survey comprehensively survey existing work on concretely efficient MPC protocols with both semi-honest and malicious security, in both dishonest-majority and honest-majority settings, to provide the recent development and key approaches of MPC to researchers.
Book ChapterDOI
Fair Threshold Decryption with Semi-Trusted Third Parties
TL;DR: This paper presents fair threshold decryption schemes, where either all of the participants can decrypt or none of them can, and considers a number of variants of these schemes to address realistic alternative trust scenarios.
Posted Content
Information-Theoretically Secure Protocols and Security Under Composition.
TL;DR: In this article, the authors investigated the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these protocols under concurrent composition.
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.