A game-theoretic perspective on oblivious transfer

Authors:
Haruna Higo;Keisuke Tanaka;Akihiro Yamada;Kenji Yasunaga
Affiliations:
Tokyo Institute of Technology, Japan;Tokyo Institute of Technology, Japan;Tokyo Institute of Technology, Japan;Institute of Systems, Information Technologies and Nanotechnologies, Japan
Venue:
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Year:
2012

Citing 14
Cited 0

Rational secret sharing and multiparty computation: extended abstract

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Constant-Round Oblivious Transfer in the Bounded Storage Model

Journal of Cryptology
Games for exchanging information

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fairness with an Honest Minority and a Rational Majority

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Purely Rational Secret Sharing (Extended Abstract)

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Cryptography and game theory: designing protocols for exchanging information

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Utility Dependence in Correct and Fair Rational Secret Sharing

Journal of Cryptology
Efficient Secure Two-Party Protocols: Techniques and Constructions

Efficient Secure Two-Party Protocols: Techniques and Constructions
Towards a game theoretic view of secure computation

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Efficient rational secret sharing in standard communication networks

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Smooth Projective Hashing and Two-Message Oblivious Transfer

Journal of Cryptology
Rational secret sharing, revisited

SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Rationality and adversarial behavior in multi-party computation

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

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.