Rational protocol design: Cryptography against incentive-driven adversaries

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2013, Pages 648-657

  Garay, Juan ^a   Katz, Jonathan ^b   Maurer, Ueli ^c   Tackmann, Björn ^c   Zikas, Vassilis ^d  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c ETH ZURICH   (Switzerland)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Composition; Cryptographic protocols; Game theory; Secure computation

Indexed keywords

ADAPTIVE CORRUPTIONS; AUTHENTICATED CHANNEL; COMMUNICATION RESOURCES; CRYPTOGRAPHIC CONCEPTS; CRYPTOGRAPHIC PROTOCOLS; IMPOSSIBILITY RESULTS; SECURE COMPUTATION; SECURE FUNCTION EVALUATION;

CHEMICAL ANALYSIS; COMMUNICATION; COMPUTER SCIENCE; DESIGN; GAME THEORY;

CRYPTOGRAPHY;

EID: 84893486709     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2013.75     Document Type: Conference Paper

References (35)

1. J. Y. Halpern and V. Teague, "Rational secret sharing and multiparty computation: Extended abstract, " in STOC 2004, L. Babai, Ed. Chicago, Illinois, USA: ACM Press, Jun. 13-16, 2004, pp. 623-632.
2. I. Abraham, D. Dolev, R. Gonen, and J. Y. Halpern, "Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation, " in PODC 2006, E. Ruppert and D. Malkhi, Eds. Denver, Colorado, USA: ACM Press, Jul. 23-26, 2006, pp. 53-62.
3. G. Kol and M. Naor, "Cryptography and game theory: Designing protocols for exchanging information, " in TCC 2008, ser. LNCS, R. Canetti, Ed., vol. 4948. San Francisco, CA, USA: Springer, Berlin, Germany, Mar. 19-21, 2008, pp. 320-339.
4. G. Fuchsbauer, J. Katz, and D. Naccache, "Efficient rational secret sharing in standard communication networks, " in TCC 2010, ser. LNCS, D. Micciancio, Ed., vol. 5978. Zurich, Switzerland: Springer, Berlin, Germany, Feb. 9-11, 2010, pp. 419-436.
5. J. Y. Halpern and R. Pass, "Game theory with costly computation: Formulation and application to protocol security, " in ICS 2010, A. C.-C. Yao, Ed. Tsinghua University Press, 2010, pp. 120-142.
6. G. Asharov, R. Canetti, and C. Hazay, "Towards a game-theoretic view of secure computation, " in EUROCRYPT 2011, ser. LNCS, K. G. Paterson, Ed., vol. 6632. Springer, 2011, pp. 426-445.
7. A. Groce and J. Katz, "Fair computation with rational players, " in EUROCRYPT 2012, ser. LNCS, D. Pointcheval and T. Johansson, Eds., vol. 7237. Springer, 2012, pp. 81-98.
8. Y. Dodis, S. Halevi, and T. Rabin, "A cryptographic solution to a game theoretic problem, " in CRYPTO 2000, ser. LNCS, M. Bellare, Ed., vol. 1880. Santa Barbara, CA, USA: Springer, Berlin, Germany, Aug. 20-24, 2000, pp. 112-130.
9. M. Lepinski, S. Micali, C. Peikert, and A. Shelat, "Completely fair SFE and coalition-safe cheap talk, " in PODC 2004, S. Chaudhuri and S. Kutten, Eds. St. John's, Newfoundland, Canada: ACM Press, Jul. 25-28, 2004, pp. 1-10.
10. M. Lepinski, S. Micali, and A. Shelat, "Collusion-free protocols, " in STOC 2005, H. N. Gabow and R. Fagin, Eds. Baltimore, Maryland, USA: ACM Press, May 22- 24, 2005, pp. 543-552.
11. S. Izmalkov, S. Micali, and M. Lepinski, "Rational secure computation and ideal mechanism design, " in FOCS 2005. Pittsburgh, PA, USA: IEEE Computer Society Press, Oct. 23-25, 2005, pp. 585-595.
12. S. Izmalkov, M. Lepinski, and S. Micali, "Verifiably secure devices, " in TCC 2008, ser. LNCS, R. Canetti, Ed., vol. 4948. San Francisco, CA, USA: Springer, Berlin, Germany, Mar. 19-21, 2008, pp. 273-301.
13. Y. Aumann and Y. Lindell, "Security against covert adversaries: Efficient protocols for realistic adversaries, " in TCC 2007, ser. LNCS, S. Vadhan, Ed., vol. 4392. Springer, 2007, pp. 137-156.
14. M. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press, 1994.
15. S. D. Gordon and J. Katz, "Rational secret sharing, revisited, " in SCN 2006, ser. LNCS, R. D. Prisco and M. Yung, Eds., vol. 4116. Maiori, Italy: Springer, Berlin, Germany, Sep. 6-8, 2006, pp. 229-241.
16. G. Kol and M. Naor, "Games for exchanging information, " in STOC 2008, C. Dwork, Ed. Victoria, British Columbia, Canada: ACM Press, May 17-20, 2008, pp. 423-432.
17. J. Y. Halpern, "Beyond Nash equilibrium: Solution concepts for the 21st century, " in PODC 2008, R. A. Bazzi and B. Patt-Shamir, Eds. Toronto, Ontario, Canada: ACM Press, Aug. 18-21, 2008, pp. 1-10.
18. R. Gradwohl, N. Livne, and A. Rosen, "Sequential rationality in cryptographic protocols, " in FOCS 2010. IEEE Computer Society Press, 2010, pp. 623-632.
19. D. Gordon and J. Katz, "Partial fairness in secure twoparty computation, " in EUROCRYPT 2010, ser. LNCS, H. Gilbert, Ed., vol. 6110. Springer, 2010, pp. 157-176.
20. A. Beimel, Y. Lindell, E. Omri, and I. Orlov, "1/psecure multiparty computation without honest majority and the best of both worlds, " in CRYPTO 2011, ser. LNCS, P. Rogaway, Ed., vol. 6841. Springer, 2011, pp. 277-296.
21. J. Alwen, A. Shelat, and I. Visconti, "Collusion-free protocols in the mediated model, " in CRYPTO 2008, LNCS, D. Wagner, Ed., vol. 5157. Santa Barbara, CA, USA: Springer, Berlin, Germany, Aug. 17-21, 2008, pp. 497-514.
22. J. Alwen, J. Katz, Y. Lindell, G. Persiano, A. Shelat, and I. Visconti, "Collusion-free multiparty computation in the mediated model, " in CRYPTO 2009, ser. LNCS, S. Halevi, Ed., vol. 5677. Santa Barbara, CA, USA: Springer, Berlin, Germany, Aug. 16-20, 2009, pp. 524- 540.
23. J. Alwen, J. Katz, U. Maurer, and V. Zikas, "Collusionpreserving computation, " in CRYPTO 2012, ser. LNCS, R. Canetti and J. Garay, Eds. Santa Barbara, CA, USA: Springer, Berlin, Germany, Aug. 2012, pp. 124-143.
24. A. Groce, J. Katz, A. Thiruvengadam, and V. Zikas, "Byzantine agreement with a rational adversary, " in ICALP 2012, ser. LNCS. Springer, Berlin, Germany, 2012, pp. 561-572.
25. R. Canetti, "Security and composition of multiparty cryptographic protocols, " Journal of Cryptology, vol. 13, pp. 143-202, April 2000.
26. J. Katz, U. Maurer, B. Tackmann, and V. Zikas, "Universally composable synchronous computation, " in TCC 2013, ser. LNCS, A. Sahai, Ed., vol. 7785. Springer, March 2013, pp. 477-498.
27. J. A. Garay, J. Katz, U. Maurer, B. Tackmann, and V. Zikas, "Rational protocol design: Cryptography against incentive-driven adversaries, " Cryptology ePrint Archive, Report 2013/496, August 2013, (Full version).
28. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game, or a completeness theorem for protocols with honest majority, " in STOC '87, A. Aho, Ed. New York City, New York, USA: ACM Press, May 25-27, 1987, pp. 218-229.
29. J. A. Garay, D. Johnson, A. Kiayias, and M. Yung, "Resource-based corruptions and the combinatorics of hidden diversity, " in ITCS 2013, R. D. Kleinberg, Ed. ACM, 2013, pp. 415-428.
30. J. Katz, "On achieving the 'best of both worlds' in secure multiparty computation, " in STOC 2007, U. Feige, Ed. San Diego, California, USA: ACM Press, June 11-13, 2007, pp. 11-20.
31. R. Canetti, U. Feige, O. Goldreich, and M. Naor, "Adaptively secure multi-party computation, " in STOC '96, G. L. Miller, Ed. Philadelphia, Pennsylvania, USA: ACM Press, May 22-24, 1996, pp. 639-648.
32. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai, "Universally composable two-party and multi-party secure computation, " in STOC 2002, J. H. Reif, Ed. Montŕeal, Qúebec, Canada: ACM Press, May 19-21, 2002, pp. 494-503.
33. R. Canetti, "Universally composable security: A new paradigm for cryptographic protocols, " in FOCS 2001. Las Vegas, Nevada, USA: IEEE Computer Society Press, Oct. 14-17, 2001, pp. 136-145. Updated full version available at http://eprint.iacr.org/2000/067.
34. R. Canetti and R. Ostrovsky, "Secure Computation with honest-looking parties: What if nobody is truly honest?" in STOC '99, J. S. Vitter, L. L. Larmore, F. Thomson Leighton, Eds. Atlanta, Georgia, USA: ACM Press, May 1-4, 1999, pp. 255-264.
35. Y. Ishai, E. Kushilevitz, Y. Lindell, and E. Petrank. "On combining privacy with guaranteed output delivery in secure multiparty computation, " in CRYPTO 2006, ser. LNCS, Cynthia Dwork, Ed., vol. 4117. Santa Barbara, CA, USA: Springer, Berlin, Germany, Aug. 20-24, 2006, pp. 483-500.