International Workshop on Public Key Cryptography

PKC 2007: Public Key Cryptography – PKC 2007 pp 134-149

Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures

  • Huafei Zhu
  • Willy Susilo
  • Yi Mu
Conference paper

DOI: 10.1007/978-3-540-71677-8_10

Volume 4450 of the book series Lecture Notes in Computer Science (LNCS)

Abstract

In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signatures in the multi-party setting. We then extend the state-of-the-art security model of verifiably committed signatures in the two-party setting to that of multi-party setting. Since there exists trivial setup-driven solutions to multi-party verifiably committed signatures (e.g., two-signature based solutions, we propose solutions to the multi-party stand-alone verifiably committed signatures in the setup-free model, and show that our implementation is provably secure under the joint assumption that the underlying Zhu’s signature scheme is secure against adaptive chosen-message attack, Fujisaki-Okamoto’s commitment scheme is statistically hiding and computationally binding and Paillier’s encryption is semantically secure and one-way as well as the existence of collision-free one-way hash functions.

Keywords

multi-partysetup-freestand-aloneverifiably committed signatures
Download to read the full conference paper text

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Huafei Zhu
    • 1
  • Willy Susilo
    • 2
  • Yi Mu
    • 2
  1. 1.Cryptography Lab, Institute for Infocomm Research, A-starSingapore
  2. 2.School of Computer Science and Software Engineering, University of WollongongAustralia