Game-theoretic security for bit commitment

5Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Higo, Tanaka, Yamada, and Yasunaga (ACISP 2012) studied oblivious transfer (OT) from a game-theoretic viewpoint in the malicious model. Their work can be considered as an extension of the study on two-party computation in the fail-stop model by Asharov, Canetti, and Hazay (EUROCRYPT 2011). This paper focuses on bit commitment, and continues to study it from a perspective of game theory. In a similar manner to the work on OT, we consider bit commitment in the malicious model. In order to naturally capture the security properties of bit commitment, we characterize them with a single game where both parties are rational. In particular, we define a security notion from a game theoretic viewpoint, and prove the equivalence between it and the standard security notion. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Higo, H., Tanaka, K., & Yasunaga, K. (2013). Game-theoretic security for bit commitment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8231 LNCS, pp. 303–318). https://doi.org/10.1007/978-3-642-41383-4_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free