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
Secure Distributed Linear Algebra in a Constant Number of Rounds
Ronald Cramer,Ivan Damgård +1 more
TL;DR: The results offer solutions that are significantly more efficient than previous techniques for secure linear algebra, they work for arbitrary fields and therefore extend the class of functions previously known to be computable in constant round and with unconditional security.
Patent
Method for secure accounting and auditing on a communications network
Moni Naor,Binyamin Pinkas +1 more
TL;DR: In this paper, the authors proposed a method for secure accounting and auditing of a communications network that operates in an environment in which many servers serve an even larger number of clients (e.g. the web), and are required to meter the interaction between servers and clients.
Book ChapterDOI
Secure and efficient metering
Moni Naor,Benny Pinkas +1 more
TL;DR: An environment in which many servers serve an even larger number of clients, and it is required to meter the interaction between servers and clients is considered, based on efficient cryptographic techniques several secure and efficient constructions of metering systems are suggested.
Book ChapterDOI
SCRAPE: Scalable Randomness Attested by Public Entities
Ignacio Cascudo,Bernardo David +1 more
TL;DR: In this paper, the authors present a coin tossing protocol for an honest majority that allows for any entity to verify that an output was honestly generated by observing publicly available information (even after the execution is complete), while achieving both guaranteed output delivery and scalability.
Proceedings ArticleDOI
From partial consistency to global broadcast
Mattias Fitzi,Ueli Maurer +1 more
TL;DR: This paper considers unconditionally secure protocols for reliable broadcast among a set of players, some of which may be corrupted by an active (Byzantine) adversary, and shows that global broadcast is achievable if and only if the number of corrupted players is less than .
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.