A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
A digital multisignature scheme using bijective public-key cryptosystems
ACM Transactions on Computer Systems (TOCS)
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Unconditionally Secure Digital Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Treshold Cryptosystems (invited talk)
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
A Digital Multisignature Scheme Based on the Fiat-Shamir Scheme
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Some Open Issues and New Directions in Group Signatures
FC '99 Proceedings of the Third International Conference on Financial Cryptography
Survey on anonymous communications in computer networks
Computer Communications
Study on ring signature and its application
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
Hyper-elliptic curves based group signature
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
On the security of the Li-Hwang-Lee-Tsai threshold group signature scheme
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Extracting group signatures from traitor tracing schemes
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Hyper-elliptic curves based ring signature
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
| Hi-index | 0.00 |
Group signatures, introduced by Chaum and van Heijst at Eurocrypt'91, allow members of a group to make signatures on behalf of the group while remaining anonymous. Furthermore, in case of disputes a designated group authority, who is given some auxiliary information, can identify the signer. Chaum and van Heijst presented four schemes, one of which protects the anonymity of the signer information-theoretically. However, this scheme as well as subsequent schemes with this property requires that the signer basically needs a new secret key for each signature and that the group authority secretly stores a very long string. This paper analyses such group signature schemes and obtains lower bounds on the length of both the secret keys of the group members and the auxiliary information of the authority depending on the number of signatures each is allowed to make and the number of group members. These bounds are optimal as they are met by the scheme suggested by Chaum and van Heijst.