Adaptive and composable non-interactive string-commitment protocols

Abstract

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. © 2012 Springer-Verlag.