A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th 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
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A Group Signature Scheme with Improved Efficiency
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
How to Convert any Digital Signature Scheme into a Group Signature Scheme
Proceedings of the 5th International Workshop on Security Protocols
Some Open Issues and New Directions in Group Signatures
FC '99 Proceedings of the Third International Conference on Financial Cryptography
Group Signatures for Hierarchical Multigroups
ISW '97 Proceedings of the First International Workshop on Information Security
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
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
Proofs of Knowledge for Non-monotone Discrete-Log Formulae and Applications
ISC '02 Proceedings of the 5th International Conference on Information Security
Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
On the Portability of Generalized Schnorr Proofs
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Polynomial Interpolation of the k-th Root of the Discrete Logarithm
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Shorter verifier-local revocation group signature with backward unlinkability
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Relaxed security notions for signatures of knowledge
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Analysis of one popular group signature scheme
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Off-Line group signatures with smart cards
CARDIS'06 Proceedings of the 7th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Group signature schemes with membership revocation for large groups
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
On the security of a group signcryption scheme from distributed signcryption scheme
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
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
Foundations of group signatures: the case of dynamic groups
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Shorter verifier-local revocation group signatures from bilinear maps
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
A framework for practical universally composable zero-knowledge protocols
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Group signature with constant revocation costs for signers and verifiers
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Scalable group signatures with revocation
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
We consider the problem of revocation of identity in group signatures. Group signatures are a very useful primitive in cryptography, allowing a member of a group to sign messages anonymously on behalf of the group. Such signatures must be anonymous and unlinkable, but a group authority must be able to open them in case of dispute. Many constructions have been proposed, some of them are quite efficient. However, a recurrent problem remains concerning revocation of group members. When misusing anonymity, a cheating member must be revoked by the authority, making him unable to sign in the future, but without sacrifying the security of past group signatures. No satisfactory solution has been given to completely solve this problem. In this paper, we provide the first solution to achieve such action for the Camenish-Stadler [6] scheme. Our solution is efficient provided the number of revoked members remains small.