Paper 2015/950

A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer

Shota Goto and Junji Shikata

Abstract

In this paper, we consider the following question: Does composing protocols having game-theoretic security result in a secure protocol in the sense of game-theoretic security? In order to discuss the composability of game-theoretic properties, we study security of cryptographic protocols in terms of the universal composability (UC) and game theory simultaneously. The contribution of this paper is the following: (i) We propose a compiler of two-party protocols in the local universal composability (LUC) framework such that it transforms any two-party protocol secure against semi-honest adversaries into a protocol secure against malicious adversaries in the LUC framework; (ii) We consider the application of our compiler to oblivious transfer (OT) protocols, by which we obtain a construction of OT meeting both UC security and game-theoretic security.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Minor revision. Cryptography and Coding - 15th IMA International Conference, IMACC 2015
Keywords
game-theoretic securityuniversal composabilitylocal universal composabilityoblivious transfer
Contact author(s)
goto-shota-zx @ ynu jp
History
2015-09-30: received
Short URL
https://ia.cr/2015/950
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/950,
      author = {Shota Goto and Junji Shikata},
      title = {A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer},
      howpublished = {Cryptology ePrint Archive, Paper 2015/950},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/950}},
      url = {https://eprint.iacr.org/2015/950}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.