A signature scheme with efficient protocols

  • Authors:
  • Jan Camenisch;Anna Lysyanskaya

  • Affiliations:
  • IBM Research, Zurich Research Laboratory, Rüschlikon;Computer Science Department, Brown University, Providence, RI

  • Venue:
  • SCN'02 Proceedings of the 3rd international conference on Security in communication networks
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Digital signature schemes are a fundamental cryptographic primitive, of use both in its own right, and as a building block in cryptographic protocol design. In this paper, we propose a practical and provably secure signature scheme and show protocols (1) for issuing a signature on a committed value (so the signer has no information about the signed value), and (2) for proving knowledge of a signature on a committed value. This signature scheme and corresponding protocols are a building block for the design of anonymity-enhancing cryptographic systems, such as electronic cash, group signatures, and anonymous credential systems. The security of our signature scheme and protocols relies on the Strong RSA assumption. These results are a generalization of the anonymous credential system of Camenisch and Lysyanskaya.