Proceedings Article10.1145/28395.28420
How to play ANY mental game
Oded Goldreich,Silvio Micali,Avi Wigderson +2 more
- 01 Jan 1987
- pp 218-229
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.
read more
Abstract: We present 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. Our algorithm automatically solves all the multi-party protocol problems addressed in complexity-based cryptography during the last 10 years. It actually is a completeness theorem for the class of distributed protocols with honest majority. Such completeness theorem is optimal in the sense that, if the majority of the players is not honest, some protocol problems have no efficient solution [C].
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique (Extended Abstract)
Luís T. A. N. Brandão
- 01 Jan 2013
TL;DR: In this article, a cut-and-choose of garbled circuits (C&C-GCs) based secure two-party computation (S2PC) protocol is proposed.
Accurate and large-scale privacy-preserving data mining using the election paradigm
Emmanouil Magkos,Manolis Maragoudakis,Vassilis Chrissikopoulos,Stefanos Gritzalis +3 more
- 01 Nov 2009
TL;DR: This paper argues in favor of using some well-known cryptographic primitives, borrowed from the literature on Internet elections, based on the classical homomorphic election model, and particularly on an extension for supporting multi-candidate elections in a fully distributed setting.
40
•Posted Content
Data-Oblivious External-Memory Algorithms for the Compaction, Selection, and Sorting of Outsourced Data
TL;DR: In this paper, data-oblivious algorithms in the external-memory model for compaction, selection, and sorting are presented, with a high probability of success, using $O((N/B) + log M/B + O(n/B))$ I/Os.
40
Patent
Simultaneous electronic transactions with subscriber verification
Silvio Micali
- 29 Sep 1997
TL;DR: In this paper, the exchange of unpredictable values in the presence of a trusted party has been studied, where a group of subscribers may be authenticated by a digital signature and a key of at least one party is also produced by the trusted party.
40
•Posted Content
Practical Adaptive Oblivious Transfer from Simple Assumptions.
Matthew Green,Susan Hohenberger +1 more
TL;DR: In this article, the authors proposed an adaptive oblivious transfer (OT) protocol, where a sender commits to a database of messages and then repeatedly interacts with a receiver in such a way that the receiver obtains one message per interaction of his choice (and nothing more) while the sender learns nothing about any of the choices.
References
How to generate and exchange secrets
Andrew Chi-Chih Yao
- 27 Oct 1986
TL;DR: A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature.
4.1K
The knowledge complexity of interactive proof-systems
Shafi Goldwasser,Silvio Micali,Charles Rackoff +2 more
- 04 Oct 2019
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage.
How to generate cryptographically strong sequences of pseudo random bits
Manuel Blum,Silvio Micali +1 more
- 04 Oct 2019
TL;DR: A general algorithmic scheme for constructing polynomial-time deterministic algorithms that stretch a short secret random input into a long sequence of unpredictable pseudo-random bits is presented.
1.4K
A randomized protocol for signing contracts
TL;DR: The 1-out-of-2 oblivious transfer as discussed by the authors allows one party to transfer exactly one secret, out of two recognizable secrets, to his counterpart, while the sender is ignorant of which secret has been received.
How to generate cryptographically strong sequences of pseudo-random bits
Manuel Blum,Silvio Micali +1 more
TL;DR: In this article, the authors give a set of conditions that allow one to generate 50-50 unpredictable bits, and present a general algorithmic scheme for constructing polynomial-time deterministic algorithms that stretch a short secret random input into a long sequence of unpredictable pseudo-random bits.
1.3K