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
Book ChapterDOI
Bounds and constructions for 1-round (0, δ)-secure message transmission against generalized adversary
TL;DR: A lower bound on the communication complexity of canonical 1-round (0, δ)-SMT against a generalized adversary is derived and a construction using a linear secret sharing scheme and a special type of hash function is given.
Journal ArticleDOI
Physical publicly verifiable randomness from pulsars
TL;DR: In this paper , the same bit sequence can be obtained at both observatories, but the ubiquitous presence of radiometer noise needs to be accounted for when determining the expected bit error rate between two independent sequences.
Posted Content
Cryptography for Big Data Security Book Chapter for Big Data: Storage, Sharing, and Security (3S)
BookDOI
Information Theoretic Security
TL;DR: This work builds the first constant-rate non-malleable code with linear-time complexity and optimal-rate (i.e. rate 1 − o(1)); and improves the previous result in the bit-wise independent tampering model.
Book ChapterDOI
A Performance and Resource Consumption Assessment of Secure Multiparty Computation.
Marcel von Maltitz,Georg Carle +1 more
TL;DR: A first comprehensive study of performance characteristics of SMC protocols using a promising implementation based on secret sharing, a common and state-of-the-art foundation to show that such a solution is practically applicable in intranet environments and -- with limitations -- in Internet settings.
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.