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


In this paper, a non-interactive string-commitment protocol in the common reference string model is presented and analyzed. We show that the proposed (length-flexible) commitment protocol realizes the universally composable security in the presence of adaptive adversaries in the standard computational model assuming that the underlying Paillier's public-key encryption (or Damgård and Jurik's public-key encryption scheme when a lengthflexible property is claimed) is semantically secure and the Damgård-Fazio- Nicolosi's non-interactive protocol is zero-knowledge in the registered public-key model.

Original languageEnglish
Title of host publicatione-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Revised Selected Papers
Number of pages10
Publication statusPublished - 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


Other7th International Joint Conference on e-Business and Telecommunications, ICETE 2010

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • General Mathematics


Dive into the research topics of 'Adaptive and composable non-interactive string-commitment protocols'. Together they form a unique fingerprint.

Cite this