Efficient group signature schemes for large groups

Extended abstract
  • Jan Camenisch
  • Markus Stadler
Conference paper

DOI: 10.1007/BFb0052252

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1294)
Cite this paper as:
Camenisch J., Stadler M. (1997) Efficient group signature schemes for large groups. In: Kaliski B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg

Abstract

A group signature scheme allows members of a group to sign messages on the group's behalf such that the resulting signature does not reveal their identity. Only a designated group manager is able to identify the group member who issued a given signature. Previously proposed realizations of group signature schemes have the undesirable property that the length of the public key is linear in the size of the group. In this paper we propose the first group signature scheme whose public key and signatures have length independent of the number of group members and which can therefore also be used for large groups. Furthermore, the scheme allows the group manager to add new members to the group without modifying the public key. The realization is based on methods for proving the knowledge of signatures.

Download to read the full conference paper text

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Jan Camenisch
    • 1
  • Markus Stadler
    • 2
  1. 1.Department of Computer ScienceETH ZurichZurichSwitzerland
  2. 2.Ubilab Union Bank of SwitzerlandZurichSwitzerland

Personalised recommendations