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
Implementation of smart-card access control with threshold scheme
P. C. Leong,E. C. Tan +1 more
TL;DR: An electronic implementation of a security scheme to control access to a building that permits the use of a standalone controller and eliminates the need for expensive wiring to a remote central database of authorized users.
Book ChapterDOI
Multi-Party Computation with Omnipresent Adversary
Hossein Ghodosi,Josef Pieprzyk +1 more
TL;DR: In this article, the authors examined the privacy of MPC protocols, and introduced the notion of an omnipresent adversary, which cannot be eliminated from the protocol, and showed that up to a minority of participants who are not corrupted by an active adversary can be corrupted passively, with the restriction that at any time, the number of corrupted participants does not exceed a predetermined threshold.
Journal ArticleDOI
On the (in)efficiency of non-interactive secure multiparty computation
Maki Yoshida,Satoshi Obana +1 more
TL;DR: This paper considers non-interactive MPC (NIMPC) against honest-but-curious adversaries in the information-theoretic setting, and presents a simple lower bound on the communication complexity derived from the correctness requirement of NIMPC.
Journal ArticleDOI
Cheating-immune secret sharing schemes from codes and cumulative arrays
TL;DR: This work revisits two methods, that uses linear codes, to construct Boolean functions satisfying multiple cryptographic criteria and shows that these methods can be used to build new cheating-immune (n, n)-secret sharing schemes.
Proceedings ArticleDOI
An Efficient V-Fairness (t, n) Threshold Secret Sharing Scheme
TL;DR: Lee and Laih proposed a v-fairness (t, n) secret sharing scheme such that the participants can recover a secret without providing their shadows simultaneously.
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.