{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:19:01Z","timestamp":1709831941809},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T00:00:00Z","timestamp":1439510400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00145-015-9212-6","type":"journal-article","created":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T20:09:53Z","timestamp":1439496593000},"page":"879-926","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Toward a Game Theoretic View of Secure Computation"],"prefix":"10.1007","volume":"29","author":[{"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Canetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmit","family":"Hazay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,14]]},"reference":[{"key":"9212_CR1","unstructured":"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\u201362"},{"key":"9212_CR2","unstructured":"S. Agrawal, M. Prabhakaran, On fair exchange, fair coins and fair sampling, in CRYPTO\u201913 (2013), pp. 259\u2013276"},{"key":"9212_CR3","doi-asserted-by":"crossref","unstructured":"G. Asharov, Y. Lindell. Utility dependence in correct and fair rational secret sharing. J. Cryptol. 24(1), 157\u2013202 (2011)","DOI":"10.1007\/s00145-010-9064-z"},{"key":"9212_CR4","unstructured":"D. Beaver, S. Goldwasser, Multiparty computation with faulty majority, in 30th FOCS (1989), pp. 468\u2013473"},{"key":"9212_CR5","doi-asserted-by":"crossref","unstructured":"M. Blum. How to exchange (secret) keys. ACM Trans. Comput. Syst. 1(2), 175\u2013193 (1983)","DOI":"10.1145\/357360.357368"},{"key":"9212_CR6","unstructured":"R. Cleve, Limits on the security of coin flips when half the processors are faulty, in 18th STOC (1986), pp. 364\u2013369"},{"key":"9212_CR7","unstructured":"R. Cleve, Controlled gradual disclosure schemes for random bits and their applications, in CRYPTO\u201989 (1989), pp. 573\u2013588"},{"key":"9212_CR8","doi-asserted-by":"crossref","unstructured":"Y. Dodis, S. Halevi, T. Rabin, A cryptographic solution to a game theoretic problem, in CRYPTO\u201900. LNCS, vol. 1880 (Springer, 2000), pp. 112\u2013130","DOI":"10.1007\/3-540-44598-6_7"},{"key":"9212_CR9","unstructured":"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"},{"key":"9212_CR10","doi-asserted-by":"crossref","unstructured":"G. Fuchsbauer, J. Katz, D. Naccache, Efficient rational secret sharing in standard communication networks, in 7th TCC. LNCS, vol. 5978 (Springer, 2010), pp. 419\u2013436","DOI":"10.1007\/978-3-642-11799-2_25"},{"key":"9212_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013428","DOI":"10.1007\/11681878_21"},{"key":"9212_CR12","unstructured":"O. Goldreich, Foundations of Cryptography: Volume 2\u2014Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"9212_CR13","doi-asserted-by":"crossref","unstructured":"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\u201393","DOI":"10.1007\/3-540-38424-3_6"},{"key":"9212_CR14","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption and how to play mental poker keeping secret all partial information. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"9212_CR15","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, C. Rachoff, The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","DOI":"10.1137\/0218012"},{"key":"9212_CR16","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, C. Hazay, J. Katz, Y. Lindell, Complete fairness in secure two-party computation. J. SIGACT News\u00a043(1), 21\u201323 (2012)","DOI":"10.1145\/2160649.2160656"},{"key":"9212_CR17","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, J. Katz, Rational secret sharing, in Security and cryptography for networks (SCN). LNCS, vol. 4116 (Springer, 2006), pp. 229\u2013241","DOI":"10.1007\/11832072_16"},{"key":"9212_CR18","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, J. Katz, Partial fairness in secure two-party computation. J. Cryptol. 25(1), 14\u201340 (2012)","DOI":"10.1007\/s00145-010-9079-5"},{"key":"9212_CR19","unstructured":"R. Gradwohl, N. Livne, A. Rosen, Sequential rationality in cryptographic protocols, in FOCS (2010), pp. 623\u2013632"},{"key":"9212_CR20","unstructured":"A. Groce, J. Katz, Fair computation with rational players, in Eurocrypt (2012), pp. 81\u201398"},{"key":"9212_CR21","unstructured":"J. Halpern, V. Teague, Efficient rational secret sharing in standard communication networks, in 36th STOC (2004), pp. 623\u2013632"},{"key":"9212_CR22","unstructured":"J. Halpern, R. Pass, Game theory with costly computation, in ICS (2010), pp. 120-142"},{"key":"9212_CR23","doi-asserted-by":"crossref","unstructured":"S. Izmalkov, M. Lepinski, S. Micali, Verifiably secure devices, in 5th TCC. LNCS, vol. 4948 (Springer, 2008), pp. 273\u2013301","DOI":"10.1007\/978-3-540-78524-8_16"},{"key":"9212_CR24","unstructured":"S. Izmalkov, S. Micali, M. Lepinski, Rational secure computation and ideal mechanism design, in 46th FOCS (2005), pp. 585\u2013595"},{"key":"9212_CR25","doi-asserted-by":"crossref","unstructured":"J. Katz, Bridging game theory and cryptography: recent results and future directions, in 5th TCC. LNCS, vol. 4948 (Springer, 2008), pp. 251\u2013272","DOI":"10.1007\/978-3-540-78524-8_15"},{"key":"9212_CR26","unstructured":"G. Kol, M. Naor, Games for exchanging information, in 40th STOC (2008), pp. 423\u2013432"},{"key":"9212_CR27","doi-asserted-by":"crossref","unstructured":"G. Kol, M. Naor, Cryptography and game theory: designing protocols for exchanging information, in 5th TCC. LNCS, vol. 4948 (Springer, 2008), pp. 320\u2013339","DOI":"10.1007\/978-3-540-78524-8_18"},{"key":"9212_CR28","doi-asserted-by":"crossref","unstructured":"A. Lysyanskaya, N. Triandopoulos, Rationality and adversarial behavior in multi-party computation, in CRYPTO\u201906. LNCS, vol. 4117 (Springer, 2006), pp. 180\u2013197","DOI":"10.1007\/11818175_11"},{"key":"9212_CR29","unstructured":"S. Micali, Certified email with invisible post offices, 1997. Technical report; an invited presentation at the RSA 1997 conference"},{"key":"9212_CR30","doi-asserted-by":"crossref","unstructured":"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\u201353","DOI":"10.1007\/978-3-642-00457-5_3"},{"key":"9212_CR31","unstructured":"R. Pass, A. Shelat, Renegotiation-safe protocols, in Innovations in Computer Science (ICS, 2011)"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9212-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9212-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9212-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9212-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T05:13:49Z","timestamp":1599455629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9212-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,14]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9212"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9212-6","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,14]]},"assertion":[{"value":"10 February 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}