Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the generation of cryptographically strong pseudorandom sequences
ACM Transactions on Computer Systems (TOCS)
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
How to Convert any Digital Signature Scheme into a Group Signature Scheme
Proceedings of the 5th International Workshop on Security Protocols
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Efficient and generalized group signatures
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Discrete Applied Mathematics - Special issue: Coding and cryptography
Discrete Applied Mathematics - Special issue: Coding and cryptography
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
An improved group signature scheme
TrustBus'05 Proceedings of the Second international conference on Trust, Privacy, and Security in Digital Business
Efficient member revocation in group signature schemes
TrustBus'05 Proceedings of the Second international conference on Trust, Privacy, and Security in Digital Business
| Hi-index | 0.00 |
Group signature schemes allow a group member to sign messages anonymously on behalf of the group. In case of dispute, only a designated group manager can reveal the identity of the member. During last decade, group signature schemes have been intensively investigated in the literature and applied to various applications. However, there has been no scheme properly handling the situation that a group member wants to leave a group or is excluded by a group manager. As noted in [2], the complexity of member deletion stands in the way of real world applications of group signatures and the member deletion problem has been a pressing open problem. In this paper, we propose an efficient group signature scheme that allows member deletion. The length of the group public key and the size of signatures are independent of the size of the group and the security of the scheme relies on the RSA assumption. In addition, the method of tracing all signatures of a specific member is introduced.