Adaptive and composable non-interactive string-commitment protocols

Huafei Zhu, Tadashi Araragi, Takashi Nishide, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Designing non-committing encryptions tolerating adaptive adversaries is a challenging task. In this paper, a simple implementation of non-committing encryptions is presented and analyzed in the strongest security model. We show that the proposed non-committing encryption scheme is provably secure against adaptive adversaries in the universally composable framework assuming that the decisional Diffie-Hellman problem is hard.

Original languageEnglish
Title of host publicationSECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography
Pages354-361
Number of pages8
Publication statusPublished - Dec 1 2010
EventInternational Conference on Security and Cryptography, SECRYPT 2010 - Athens, Greece
Duration: Jul 26 2010Jul 28 2010

Publication series

NameSECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography

Other

OtherInternational Conference on Security and Cryptography, SECRYPT 2010
CountryGreece
CityAthens
Period7/26/107/28/10

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Science Applications

Cite this

Zhu, H., Araragi, T., Nishide, T., & Sakurai, K. (2010). Adaptive and composable non-interactive string-commitment protocols. In SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography (pp. 354-361). (SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography).