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

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Universally composable non-committing encryptions in the presence of adaptive adversaries'. Together they form a unique fingerprint.

Cite this