Generic construction of (identity-based) perfect concurrent signatures

  • Authors:
  • Sherman S. M. Chow;Willy Susilo

  • Affiliations:
  • Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, NY;Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia

  • Venue:
  • ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The notion of concurrent signatures was recently introduced by Chen, Kudla and Paterson. In concurrent signature schemes, two entities can produce two signatures that are not binding, until an extra piece of information (namely the keystone) is released by one of the parties. Subsequently, it was noted that the concurrent signature scheme proposed in the seminal paper cannot provide perfect ambiguity. Then, the notion of perfect concurrent signatures was introduced. In this paper, we define the notion of identity-based(or ID-based)perfectconcurrentsignatureschemes. We provide the first generic construction of (ID-based) perfect concurrent signature schemes from ring signature schemes. Using the proposed framework, we give two concrete ID-based perfect concurrent signature schemes based on two major paradigms of ID-based ring signature schemes. Security proofs are based on the random oracle model.