A Group Signature Scheme with Improved Efficiency (Extended Abstract)

  • Jan Camenisch
  • Markus Michels
Conference paper

DOI: 10.1007/3-540-49649-1_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1514)
Cite this paper as:
Camenisch J., Michels M. (2000) A Group Signature Scheme with Improved Efficiency (Extended Abstract). In: Ohta K., Pei D. (eds) Advances in Cryptology — ASIACRYPT’98. ASIACRYPT 1998. Lecture Notes in Computer Science, vol 1514. Springer, Berlin, Heidelberg

Abstract

The concept of group signatures allows a group member to sign messages anonymously on behalf of the group. However, in the case of a dispute, the identity of a signature’s originator can be revealed by a designated entity. In this paper we propose a new group signature scheme that is well suited for large groups, i.e., the length of the group’s public key and of signatures do not depend on the size of the group. Our solution based on a variation of the RSA problem is more efficient than previous ones satisfying these requirements.

Keywords

Group signature scheme for large groups digital signature schemes revocable anonymity 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Jan Camenisch
    • 1
  • Markus Michels
    • 2
  1. 1.BRICS Department of Computer ScienceUniversity of Aarhusårhus CDenmark
  2. 2.r3 security engineering agEntrust TechnologyGlattzentrum/ZurichSwitzerland

Personalised recommendations