Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

ACM Symposium on Theory of Computing (STOC)

How to play ANY mental game

Oded Goldreich, Silvio M. Micali, Avi Wigderson

Published Jan 1, 1987• 3,594 citations
Publisher

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.
DOI
10.1145/28395.28420

Related papers

Verifiable secret sharing and multiparty protocols with honest majority

Tal Rabin, Michael Ben-Or

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.

ACM Symposium on Theory of Computing (STOC)•Jan 1, 1989•940 citations

A probabilistic approach to quantum Bayesian games of incomplete information

Azhar Iqbal, James M. Chappell, Qiang Li +2 more

Quantum Information Processing•Sep 19, 2014•23 citations

Quantum Games of Continuous Distributed Incomplete Information

Chen Xi, Gan Qin, Zhou Xian-Yi +1 more

We study two-player quantum games of incomplete information in which both the sides have partial information. The previous results of Du et al. [Phys. Rev. E 68 (2003) 016124] are incorporated in our more general formalism. Because of different roles played by the total information uncertainty and the information asymmetry, the game exhibits many interesting features.

Chinese Physics Letters•Apr 14, 2005•18 citations

A quantum approach to static games of complete information

Luca Marinatto, Tullio Weber

arXiv:quant-ph/0004081•Physics Letters A•Aug 1, 2000•296 citations

Quantum Games of Continuous Distributed Incomplete Information

陈曦, 秦敢, 周先意 +1 more

We study two-player quantum games of incomplete information in which both the sides have partial information.The previous results of Du et al. [Phys. Rev. E 68 (2003) 016124] are incorporated in our more general formalism.Because of different roles played by the total information uncertainty and the information asymmetry, the game exhibits many interesting features.

Chinese Physics Letters•Jan 1, 2005•1 citation

A Cryptographic Solution to a Game Theoretic Problem

Yevgeniy Dodis, Shai Halevi, Tal Rabin

Lecture notes in computer science•Jan 1, 2000•85 citations
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.