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
Fair secret reconstruction in (t, n) secret sharing
Lein Harn,Changlu Lin,Yong Li +2 more
TL;DR: This paper designs a secret reconstruction scheme which does not need any interactive dealer, complicate cryptographic primitives, or any assumption on the number of honest shareholders, and is called an asynchronously rational secret sharing scheme.
Book ChapterDOI
Evolving Secret Sharing: Dynamic Thresholds and Robustness
TL;DR: This paper presents a construction in which the share size of the t-th party is \(O(t^4\cdot \log t)\) bits, and resolves the open problem of how to share a secret among an unbounded number of parties of cardinality at least k.
Book ChapterDOI
Multi-party Computation with Hybrid Security
TL;DR: This paper examines to what extent it is possible to achieve conditional security based on a given intractability assumption with respect to some number T of corrupted players while simultaneously achieving unconditional security withrespect to a smaller threshold t≤ T.
Journal Article
Efficient Multiparty Protocols via Log-Depth Threshold Formulae.
TL;DR: In this paper, Chen et al. proposed a new approach for the design of efficient multiparty protocols, which combines the player emulation technique of Hirt and Maurer with constructions of logarithmic-depth formulae which compute threshold functions using only constant fan-in threshold gates.
Proceedings ArticleDOI
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
TL;DR: In this paper, Ishai et al. presented a hybrid-secure MPC protocol that provides an optimal trade-off between IT robustness and computational privacy for any robustness parameter ρ n/2.
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.