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
Posted Content
Multiparty Computation Goes Live.
Peter Bogetoft,Dan Lund Christensen,Ivan Damgård,Martin Geisler,Thomas P. Jakobsen,Mikkel Krøigaard,Janus Dam Nielsen,Jesper Buus Nielsen,Kurt Nielsen,Jakob Pagter,Michael I. Schwartzbach,Tomas Toft +11 more
TL;DR: In this note, the first large-scale and practical application of multiparty computation, which took place in January 2008, is reported on.
Journal ArticleDOI
Strong accumulators from collision-resistant hashing
TL;DR: This work gives a simple construction of a strong universal accumulator scheme, which is provably secure under the assumption that collision-resistant hash functions exist, and shows how to use stronguniversal accumulators to solve a problem of practical relevance, the so-called e-Invoice Factoring Problem.
Book ChapterDOI
Round-Efficient Secure Computation in Point-to-Point Networks
Jonathan Katz,Chiu-Yuen Koo +1 more
TL;DR: It is argued that if the goal is to optimize round complexity in point-to-point networks, then it is preferable to design protocols -- assuming a broadcast channel -- minimizing the number of rounds in which broadcast is used rather than minimizing the total number of Rounds.
Journal ArticleDOI
Secure Outsourced Biometric Authentication With Performance Evaluation on Smartphones
TL;DR: Key observations are: 1) scaled Manhattan without PCA gives the best tradeoff between security, accuracy, and overhead and 2) with PCA, memory availability on current smartphones limits the number of features that can be used with scaled Manhattan, and prevents the scaled Euclidean protocol from running.
Book ChapterDOI
Non-malleable Secret Sharing for General Access Structures
Vipul Goyal,Ashutosh Kumar +1 more
TL;DR: Goyal and Kumar as mentioned in this paper proposed constructions of 2-out-of-2 non-malleable secret sharing (NMSS) codes in the 2 split-state model.
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.