Adaptive and composable non-committing encryptions

Huafei Zhu, Tadashi Araragi, Takashi Nishide, Kouichi Sakurai

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

5 Citations (Scopus)


In this paper, a new non-committing encryption protocol without failure during the course of a channel setup procedure is constructed and analyzed in the universally composable (UC) framework. We show that the proposed non-committing scheme realizes the UC-security in the presence of adaptive adversary assuming that the decisional Diffie-Hellman problem is hard.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 15th Australasian Conference, ACISP 2010, Proceedings
Number of pages10
Publication statusPublished - 2010
Event15th Australasian Conference on Information Security and Privacy, ACISP 2010 - Sydney, NSW, Australia
Duration: Jul 5 2010Jul 7 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6168 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other15th Australasian Conference on Information Security and Privacy, ACISP 2010
CitySydney, NSW

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Adaptive and composable non-committing encryptions'. Together they form a unique fingerprint.

Cite this