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
On minimal connectivity requirements for secure message transmission in directed networks
TL;DR: This work gives a generic characterization of SMT networks by studying the required number of extra vertex-disjoint feedback channels, conditioned on the existence of a certain number of forward channels, without attaching any such if condition.
Journal ArticleDOI
Secret sharing with cheaters using multi-receiver authentication
Posted Content
General Composition and Universal Composability in Secure Multiparty Computation.
TL;DR: Canetti as discussed by the authors showed that security under concurrent general composition, when interpreted in the natural way under the simulation paradigm, is equivalent to a variant of universal composability, where the only difference relates to the order of quantifiers in the definition.
Book ChapterDOI
On the Optimal Communication Complexity of Error-Correcting Multi-Server PIR
TL;DR: In this paper , the authors show that if error correction is perfect, i.e., the client always corrects errors, then the minimum communication cost of b-error-correcting server PIR is asymptotically equal to that of regular server pIR as a function of the database size n.
Posted Content
Secure and Efficient Protocols for Iris and Fingerprint Identification.
Marina Blanton,Paolo Gasti +1 more
TL;DR: In this paper, the first privacy-preserving identification protocol for iris codes was proposed and implemented for fingerprint identification based on FingerCodes with a substantial improvement in the performance compared to existing solutions.
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.