Abstract
Asharov, Canetti, and Hazay (Eurocrypt 2011) studied how game-theoretic concepts can be used to capture the cryptographic properties of correctness, privacy, and fairness in two-party protocols in the presence of fail-stop adversaries. Based on their work, we characterize the properties of “two-message” oblivious transfer protocols by using a game-theoretic concept. Specifically, we present a single two-player game for two-message oblivious transfer in the game-theoretic framework, where it captures the cryptographic properties of correctness and privacy in the presence of malicious adversaries.
Keywords
This research was supported in part by a grant of I-System Co. Ltd., NTT Information Sharing Platform Laboratories, and Ministry of Education, Culture, Sports, Science and Technology.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abraham, I., Dolev, D., Gonen, R., Halpern, J.Y.: Distributed Computing Meets Game Theory: Robust Mechanisms for Rational Secret Sharing and Multiparty Computation. In: Ruppert, E., Malkhi, D. (eds.) PODC, pp. 53–62. ACM (2006)
Asharov, G., Canetti, R., Hazay, C.: Towards a Game Theoretic View of Secure Computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 426–445. Springer, Heidelberg (2011)
Asharov, G., Lindell, Y.: Utility Dependence in Correct and Fair Rational Secret Sharing. J. Cryptology 24(1), 157–202 (2011)
Ding, Y.Z., Harnik, D., Rosen, A., Shaltiel, R., Shaltiel, R.: Constant-Round Oblivious Transfer in the Bounded Storage Model. J. Cryptology, 165–202 (2007)
Dodis, Y., Rabin, T.: Cryptography and Game Theory. In: Nisan, N., Roughgarden, T., Tardos, É., Vazirani, V.V. (eds.) Algorithmic Game Theory, ch. 8, pp. 181–205. Cambridge University Press (2007)
Fuchsbauer, G., Katz, J., Naccache, D.: Efficient Rational Secret Sharing in Standard Communication Networks. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 419–436. Springer, Heidelberg (2010)
Gordon, S.D., Katz, J.: Rational Secret Sharing, Revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 229–241. Springer, Heidelberg (2006)
Halevi, S., Kalai, Y.T.: Smooth Projective Hashing and Two-Message Oblivious Transfer. J. Cryptology 25(1), 158–193 (2012)
Halpern, J.Y., Pass, R., Pass, R.: Game Theory with Costly Computation: Formulation and Application to Protocol Security. In: ICS, pp. 120–142 (2010)
Halpern, J.Y., Teague, V.: Rational Secret Sharing and Multiparty Computation: Extended Abstract. In: Babai, L. (ed.) STOC, pp. 623–632. ACM (2004)
Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols: Techniques and Constructions. Information Security and Cryptography Series. Springer, Heidelberg (2010)
Kol, G., Naor, M.: Cryptography and Game Theory: Designing Protocols for Exchanging Information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 320–339. Springer, Heidelberg (2008)
Kol, G., Naor, M.: Games for Exchanging Information. In: Dwork, C. (ed.) STOC, pp. 423–432. ACM (2008)
Lysyanskaya, A., Triandopoulos, N.: Rationality and Adversarial Behavior in Multi-party Computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 180–197. Springer, Heidelberg (2006)
Micali, S., Shelat, A.: Purely Rational Secret Sharing (Extended Abstract). In: Reingold [17], pp. 54–71
Ong, S.J., Parkes, D.C., Rosen, A., Vadhan, S.P.: Fairness with an Honest Minority and a Rational Majority. In: Reingold [17], pp. 36–53
Reingold, O. (ed.): TCC 2009. LNCS, vol. 5444. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Higo, H., Tanaka, K., Yamada, A., Yasunaga, K. (2012). A Game-Theoretic Perspective on Oblivious Transfer. In: Susilo, W., Mu, Y., Seberry, J. (eds) Information Security and Privacy. ACISP 2012. Lecture Notes in Computer Science, vol 7372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31448-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-31448-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31447-6
Online ISBN: 978-3-642-31448-3
eBook Packages: Computer ScienceComputer Science (R0)