Universally composable non-committing encryptions in the presence of adaptive adversaries

Huafei Zhu, Tadashi Araragi, Takashi Nishide, Kouichi Sakurai

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

2 Citations (Scopus)

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
Pages389-398
Number of pages10
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

Cryptography

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Science Applications

Cite this

Zhu, H., Araragi, T., Nishide, T., & Sakurai, K. (2010). Universally composable non-committing encryptions in the presence of adaptive adversaries. In SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography (pp. 389-398). (SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography).

Universally composable non-committing encryptions in the presence of adaptive adversaries. / Zhu, Huafei; Araragi, Tadashi; Nishide, Takashi; Sakurai, Kouichi.

SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography. 2010. p. 389-398 (SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography).

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

Zhu, H, Araragi, T, Nishide, T & Sakurai, K 2010, Universally composable non-committing encryptions in the presence of adaptive adversaries. in SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography. SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography, pp. 389-398, International Conference on Security and Cryptography, SECRYPT 2010, Athens, Greece, 7/26/10.
Zhu H, Araragi T, Nishide T, Sakurai K. Universally composable non-committing encryptions in the presence of adaptive adversaries. In SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography. 2010. p. 389-398. (SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography).
Zhu, Huafei ; Araragi, Tadashi ; Nishide, Takashi ; Sakurai, Kouichi. / Universally composable non-committing encryptions in the presence of adaptive adversaries. SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography. 2010. pp. 389-398 (SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography).
@inproceedings{45de980256bb42808f0afa7fe452670f,
title = "Universally composable non-committing encryptions in the presence of adaptive adversaries",
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.",
author = "Huafei Zhu and Tadashi Araragi and Takashi Nishide and Kouichi Sakurai",
year = "2010",
month = "12",
day = "1",
language = "English",
isbn = "9789898425188",
series = "SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography",
pages = "389--398",
booktitle = "SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography",

}

TY - GEN

T1 - Universally composable non-committing encryptions in the presence of adaptive adversaries

AU - Zhu, Huafei

AU - Araragi, Tadashi

AU - Nishide, Takashi

AU - Sakurai, Kouichi

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78651447246&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78651447246&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:78651447246

SN - 9789898425188

T3 - SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography

SP - 389

EP - 398

BT - SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography

ER -