How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
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
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the 11th ACM conference on Computer and communications security
Group signatures with verifier-local revocation
Proceedings of the 11th ACM conference on Computer and communications security
Collision-free accumulators and fail-stop signature schemes without trees
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Group signatures: better efficiency and new theoretical aspects
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
| Hi-index | 0.00 |
This paper presents the concept of anonymous identification card, a technique enabling a card holder to demonstrates his/her authenticity without disclosing real identity. Anonymous identification card can be used in settings in which people need to demonstrate their eligibility to do certain things, meanwhile they are sensitive to their privacy, not hoping to disclose their identity information to a verifier. We proposed an efficient anonymous authentication scheme for this anonymous identification card, with the support of rogue card revocation. The most advantage of our scheme is its simplicity and efficiency such that all computation can be carried out by a resource-limited identification card. We proved our scheme is secure under the strong RSA assumption and the decisional Diffie-Hellman assumption.