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

1 Citation (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 publicatione-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Revised Selected Papers
Pages274-288
Number of pages15
DOIs
Publication statusPublished - Mar 2 2012
Event7th International Joint Conference on e-Business and Telecommunications, ICETE 2010 - Athens, Greece
Duration: Jul 26 2010Jul 28 2010

Publication series

NameCommunications in Computer and Information Science
Volume222 CCIS
ISSN (Print)1865-0929

Other

Other7th International Joint Conference on e-Business and Telecommunications, ICETE 2010
CountryGreece
CityAthens
Period7/26/107/28/10

Fingerprint

Encryption
Cryptography
Security Model
Diffie-Hellman
Framework

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

Cite this

Zhu, H., Araragi, T., Nishide, T., & Sakurai, K. (2012). Universally composable non-committing encryptions in the presence of adaptive adversaries. In e-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Revised Selected Papers (pp. 274-288). (Communications in Computer and Information Science; Vol. 222 CCIS). https://doi.org/10.1007/978-3-642-25206-8_18

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

e-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Revised Selected Papers. 2012. p. 274-288 (Communications in Computer and Information Science; Vol. 222 CCIS).

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

Zhu, H, Araragi, T, Nishide, T & Sakurai, K 2012, Universally composable non-committing encryptions in the presence of adaptive adversaries. in e-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Revised Selected Papers. Communications in Computer and Information Science, vol. 222 CCIS, pp. 274-288, 7th International Joint Conference on e-Business and Telecommunications, ICETE 2010, Athens, Greece, 7/26/10. https://doi.org/10.1007/978-3-642-25206-8_18
Zhu H, Araragi T, Nishide T, Sakurai K. Universally composable non-committing encryptions in the presence of adaptive adversaries. In e-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Revised Selected Papers. 2012. p. 274-288. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-25206-8_18
Zhu, Huafei ; Araragi, Tadashi ; Nishide, Takashi ; Sakurai, Kouichi. / Universally composable non-committing encryptions in the presence of adaptive adversaries. e-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Revised Selected Papers. 2012. pp. 274-288 (Communications in Computer and Information Science).
@inproceedings{f559cf529e144254a36d9fee256e94a2,
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 = "2012",
month = "3",
day = "2",
doi = "10.1007/978-3-642-25206-8_18",
language = "English",
isbn = "9783642252051",
series = "Communications in Computer and Information Science",
pages = "274--288",
booktitle = "e-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Revised Selected Papers",

}

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 - 2012/3/2

Y1 - 2012/3/2

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=84863414611&partnerID=8YFLogxK

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

U2 - 10.1007/978-3-642-25206-8_18

DO - 10.1007/978-3-642-25206-8_18

M3 - Conference contribution

AN - SCOPUS:84863414611

SN - 9783642252051

T3 - Communications in Computer and Information Science

SP - 274

EP - 288

BT - e-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Revised Selected Papers

ER -