Eecient Group Signature Schemes for Large Groups

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 rst 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.

[1]  David Chaum,et al.  Blind Signature System , 1983, CRYPTO.

[2]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[3]  Adi Shamir,et al.  Efficient Signature Schemes Based on Polynomial Equations , 1984, CRYPTO.

[4]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[5]  L. Adleman,et al.  Solving bivariate quadratic congruences in random polynomial time , 1987 .

[6]  Kevin S. Mccurley,et al.  Odds and ends from cryptology and computational number theory , 1990 .

[7]  David Chaum,et al.  Group Signatures , 1991, EUROCRYPT.

[8]  Stefan A. Brands,et al.  An Efficient Off-line Electronic Cash System Based On The Representation Problem. , 1993 .

[9]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[10]  Lidong Chen,et al.  New Group Signature Schemes (Extended Abstract) , 1994, EUROCRYPT.

[11]  Seung Joo Kim,et al.  Convertible Group Signatures , 1996, ASIACRYPT.

[12]  M. Stadler.  Publicly Veriiable Secret Sharing , 1996 .

[13]  Tatsuaki Okamoto.  Threshold Key-Recovery Systems for RSA , 1997, Security Protocols Workshop.

[14]  Holger Petersen,et al.  How to Convert any Digital Signature Scheme into a Group Signature Scheme , 1997, Security Protocols Workshop.

[15]  Stefan Brands,et al.  Rapid Demonstration of Linear Relations Connected by Boolean Operators , 1997, EUROCRYPT.

[16]  J. Camenisch,et al.  Proof systems for general statements about discrete logarithms , 1997 .

[17]  J. Camenisch.  E cient and Generalized Group Signatures , 1997 .