Advertisement

Journal of Cryptology

, Volume 29, Issue 4, pp 879–926 | Cite as

Toward a Game Theoretic View of Secure Computation

  • Gilad Asharov
  • Ran Canetti
  • Carmit HazayEmail author
Article

Abstract

We demonstrate how Game Theoretic concepts and formalism can be used to capture cryptographic notions of security. In the restricted but indicative case of two-party protocols in the face of malicious fail-stop faults, we first show how the traditional notions of secrecy and correctness of protocols can be captured as properties of Nash equilibria in games for rational players. Next, we concentrate on fairness. Here we demonstrate a Game Theoretic notion and two different cryptographic notions that turn out to all be equivalent. In addition, we provide a simulation-based notion that implies the previous three. All four notions are weaker than existing cryptographic notions of fairness. In particular, we show that they can be met in some natural setting where existing notions of fairness are provably impossible to achieve.

Keywords

Secure computation Fairness Game theory 

References

  1. 1.
    I. Abraham, D. Dolev, R. Gonen, J.Y. Halpern, Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation, in PODC (2006), pp. 53–62Google Scholar
  2. 2.
    S. Agrawal, M. Prabhakaran, On fair exchange, fair coins and fair sampling, in CRYPTO’13 (2013), pp. 259–276Google Scholar
  3. 3.
    G. Asharov, Y. Lindell. Utility dependence in correct and fair rational secret sharing. J. Cryptol. 24(1), 157–202 (2011)Google Scholar
  4. 4.
    D. Beaver, S. Goldwasser, Multiparty computation with faulty majority, in 30th FOCS (1989), pp. 468–473Google Scholar
  5. 5.
    M. Blum. How to exchange (secret) keys. ACM Trans. Comput. Syst. 1(2), 175–193 (1983)Google Scholar
  6. 6.
    R. Cleve, Limits on the security of coin flips when half the processors are faulty, in 18th STOC (1986), pp. 364–369Google Scholar
  7. 7.
    R. Cleve, Controlled gradual disclosure schemes for random bits and their applications, in CRYPTO’89 (1989), pp. 573–588Google Scholar
  8. 8.
    Y. Dodis, S. Halevi, T. Rabin, A cryptographic solution to a game theoretic problem, in CRYPTO’00. LNCS, vol. 1880 (Springer, 2000), pp. 112–130Google Scholar
  9. 9.
    Y. Dodis, T. Rabin, Cryptography and game theory, in Algorithmic Game Theory, edited by N. Nisan, T. Roughgarden, E. Tardos, V.V. Vazirani (Cambridge University Press, Cambridge, 2007). http://www.cambridge.org/us/academic/subjects/computer-science/algorithmics-complexity-computeralgebra-and-computational-g/algorithmic-game-theory?format=HB
  10. 10.
    G. Fuchsbauer, J. Katz, D. Naccache, Efficient rational secret sharing in standard communication networks, in 7th TCC. LNCS, vol. 5978 (Springer, 2010), pp. 419–436Google Scholar
  11. 11.
    J.A. Garay, P.D. MacKenzie, M. Prabhakaran, K. Yang, Resource fairness and composability of cryptographic protocols, in 3rd Theory of Cryptography Conference TCC 2006. LNCS, vol. 3876 (Springer, 2006), pp. 404–428Google Scholar
  12. 12.
    O. Goldreich, Foundations of Cryptography: Volume 2—Basic Applications. Cambridge University Press, Cambridge (2004)Google Scholar
  13. 13.
    S. Goldwasser, L.A. Levin, Fair computation of general functions in presence of immoral majority, in CRYPTO 1990. LCNS, vol. 537 (Springer, 1991), pp. 77–93Google Scholar
  14. 14.
    S. Goldwasser, S. Micali, Probabilistic encryption and how to play mental poker keeping secret all partial information. J. Comput. Syst. Sci. 28(2), 270–299 (1984)Google Scholar
  15. 15.
    S. Goldwasser, S. Micali, C. Rachoff, The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186–208 (1989)Google Scholar
  16. 16.
    S.D. Gordon, C. Hazay, J. Katz, Y. Lindell, Complete fairness in secure two-party computation. J. SIGACT News 43(1), 21–23 (2012)Google Scholar
  17. 17.
    S.D. Gordon, J. Katz, Rational secret sharing, in Security and cryptography for networks (SCN). LNCS, vol. 4116 (Springer, 2006), pp. 229–241Google Scholar
  18. 18.
    S.D. Gordon, J. Katz, Partial fairness in secure two-party computation. J. Cryptol. 25(1), 14–40 (2012)Google Scholar
  19. 19.
    R. Gradwohl, N. Livne, A. Rosen, Sequential rationality in cryptographic protocols, in FOCS (2010), pp. 623–632Google Scholar
  20. 20.
    A. Groce, J. Katz, Fair computation with rational players, in Eurocrypt (2012), pp. 81–98Google Scholar
  21. 21.
    J. Halpern, V. Teague, Efficient rational secret sharing in standard communication networks, in 36th STOC (2004), pp. 623–632Google Scholar
  22. 22.
    J. Halpern, R. Pass, Game theory with costly computation, in ICS (2010), pp. 120-142Google Scholar
  23. 23.
    S. Izmalkov, M. Lepinski, S. Micali, Verifiably secure devices, in 5th TCC. LNCS, vol. 4948 (Springer, 2008), pp. 273–301Google Scholar
  24. 24.
    S. Izmalkov, S. Micali, M. Lepinski, Rational secure computation and ideal mechanism design, in 46th FOCS (2005), pp. 585–595Google Scholar
  25. 25.
    J. Katz, Bridging game theory and cryptography: recent results and future directions, in 5th TCC. LNCS, vol. 4948 (Springer, 2008), pp. 251–272Google Scholar
  26. 26.
    G. Kol, M. Naor, Games for exchanging information, in 40th STOC (2008), pp. 423–432Google Scholar
  27. 27.
    G. Kol, M. Naor, Cryptography and game theory: designing protocols for exchanging information, in 5th TCC. LNCS, vol. 4948 (Springer, 2008), pp. 320–339Google Scholar
  28. 28.
    A. Lysyanskaya, N. Triandopoulos, Rationality and adversarial behavior in multi-party computation, in CRYPTO’06. LNCS, vol. 4117 (Springer, 2006), pp. 180–197Google Scholar
  29. 29.
    S. Micali, Certified email with invisible post offices, 1997. Technical report; an invited presentation at the RSA 1997 conferenceGoogle Scholar
  30. 30.
    S.J. Ong, D.C. Parkes, A. Rosen, S.P. Vadhan, Fairness with an honest minority and a rational majority, in 6th TCC. LNCS, vol. 5444 (Springer, 2009), pp. 36–53Google Scholar
  31. 31.
    R. Pass, A. Shelat, Renegotiation-safe protocols, in Innovations in Computer Science (ICS, 2011)Google Scholar

Copyright information

© International Association for Cryptologic Research 2015

Authors and Affiliations

  1. 1.School of Computer Science and EngineeringHebrew University of JerusalemJerusalemIsrael
  2. 2.School of Computer ScienceTel Aviv UniversityTel AvivIsrael
  3. 3.Department of Computer ScienceBoston UniversityBostonUSA
  4. 4.Faculty of EngineeringBar-Ilan UniversityRamat GanIsrael

Personalised recommendations