A cryptographic solution to a game theoretic problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1880, Issue , 2000, Pages 112-130

  Dodis, Yevgeniy ^a   Halevi, Shai ^b   Rabin, Tal ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; GAME THEORY;

CORRELATED EQUILIBRIA; CRYPTOGRAPHIC PROTOCOLS; ERROR PROBABILITIES; EXTENSIVE-FORM GAMES; FREE COMMUNICATIONS; GAME-THEORETIC PROBLEMS; SOLUTION CONCEPTS; TRUSTED THIRD PARTIES;

COMPUTER GAMES;

EID: 84974555688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_7     Document Type: Conference Paper

References (34)

1. M. Abe. Universally Verifiable Mix-net with Verification Work Independent on the number of Mix-centers. In Proceedings of EUROCRYPT ’98, pp. 437-447, 1998.
2. R. Aumann. Subjectivity and Correlation in Randomized Strategies. In Journal of Mathematical Economics, 1, pp. 67-95, 1974
3. I. Barany. Fair distribution protocols or how the players replace fortune. Mathematics of Operations Research, 17(2):327-340, May 1992.
4. M. Bellare, R. Impagliazzo, and M. Naor. Does parallel repetition lower the error in computationally sound protocols? In 38th Annual Symposium on Foundations of Computer Science, pages 374-383. IEEE, 1997.
5. J. Benaloh. Dense Probabilistic Encryption. In Proc. of the Workshop on Selected Areas in Cryptography, pp. 120-128, 1994.
6. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 1-10, 1988.
7. M. Blum. Coin flipping by telephone: A protocol for solving impossible problems. In CRYPTO’81. ECE Report 82-04, ECE Dept., UCSB, 1982.
8. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. JCSS, 37(2):156-189, 1988.
9. R. Canetti, Security and Composition of Multi-parti Cryptographic Protocols. Journal of Cryptology, 13(1):143-202.
10. D. Chaum. Blind signatures for untraceable payment. In Advances in Cryptology-CRYPTO’82, pages 199-203. Plenum Press, 1982.
11. D. Chaum, C. Crépeau, and E. Damgård. Multiparty unconditionally secure protocols. In Advances in Cryptology-CRYPTO’87, volume 293of 99 Lecture Notes in Computer Science, pages 462-462. Springer-Verlag, 1988.
12. R. Cramer, I. Damgard, and P. MacKenzie. Efficient zero-knowledge proofs of knowledge without intractability assumptions. Proceedings of PKC 2000 January 2000, Melbourne, Australia.
13. Y. Dodis, S. Halevi and T. Rabin. Cryptographic Solutions to a Game Theoretic Problem. http://www.research.ibm.com/security/DHR00.ps.
14. C. Dwork, M. Naor, and A. Sahai. Concurrent zero knowledge. In Proceedings of the 30th Annual ACM STOC, pages 409-418. ACM Press, 1998.
15. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In CRYPTO’84, LNCS 196, pages 10-18. Springer-Verlag, 1985.
16. U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. In Proceedings of the 22nd Annual ACM STOC, pages 416-426. ACM Press, 1990.
17. M. Fischer, R. Wright. An Application of Game-Theoretic Techniques to Cryptography. In Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 99-118, 1993.
18. F. Forges. Can sunspots repalce the mediator? In J. of Math. Economics, 17:347-368, 1988.
19. F. Forges. Universal Mechanisms, In Econometrica, 58:1341-1364, 1990.
20. D. Fudenberg, J. Tirole. Game Theory. MIT Press, 1992.
21. J. Garay, R. Gennaro, C. Jutla, and T. Rabin. Secure distributed storage and retrieval. In Proc. 11th International Workshop on Distributed Algorithms (WDAG ’97), LNCS 1320, pages 275-289. Springer-Verlag, 1997.
22. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 218-229, 1987.
23. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, April 1984.
24. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186-208, 1989.
25. M. Jakobsson. A Practical Mix. In Proceedings of EUROCRYPT ’98, pp. 448-461, 1998.
26. J. Kilian. (More) Completeness Theorems for Secure Two-Party Computation In Proc. of STOC, 2000.
27. E. Lehrer and S. Sorin. One-shot public mediated talk. Discussion Paper 1108, Northwestern University, 1994.
28. P. MacKenzie. Efficient ZK Proofs of Knowledge. Unpublished manuscript, 1998.
29. G. Mailath, L. Samuelson and A. Shaked. Correlated Equilibria and Local Interaction In Economic Theory, 9, pp. 551-556, 1997.
30. R. Myerson. Communication, correlated equilibria and incentive compatibility. In Handbook of Game Theory, Vol. 2, Elsevier, Amsterdam, pp. 827-847, 1994.
31. J.F. Nash. Non-Cooperative Games. Annals of Mathematics, 54 pages 286-295.
32. M. Osborne, A. Rubinstein. A Course in Game Theory. The MIT Press, 1994.
33. T. Sander, A. Young, and M. Yung. Non-interactive CryptoComputing for NC1. In 40th Annual Symposium on Foundations of Computer Science, pages 554-567. IEEE, 1999.
34. A. C. Yao. Protocols for secure computations (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, pages 160-164. IEEE, Nov. 1982.