A secure and privacy-protecting protocol for transmitting personal information between organizations
Proceedings on Advances in cryptology---CRYPTO '86
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Randomizable Proofs and Delegatable Anonymous Credentials
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Selected Areas in Cryptography
Transferable Constant-Size Fair E-Cash
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Fully anonymous group signatures without random oracles
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
P-signatures and noninteractive anonymous credentials
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Structure-preserving signatures and commitments to group elements
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Efficient message space extension for automorphic signatures
ISC'10 Proceedings of the 13th international conference on Information security
Commuting signatures and verifiable encryption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Double-trapdoor anonymous tags for traceable signatures
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Protecting privacy by sanitizing personal data: a new approach to anonymous credentials
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
| Hi-index | 0.00 |
Anonymous credential systems allow users to obtain a certified credential (a driving license, a student card, etc.) from one organization and then later prove possession of this certified credential to another party, while minimizing the information given to the latter. At CANS 2010, Guajardo, Mennink and Schoenmakers have introduced the concept of anonymous credential schemes with encrypted attributes, where the attributes to be certified are encrypted and unknown to the user and/or issuing organization. Their construction is secure in the random oracle model and based on blind signatures, which, unfortunately, restrict the credentials to be used only once (one-show) to remain unlinkable. In their paper, Guajardo et al. left as an open problem to construct multi-show credential schemes with encrypted attributes, or to show the impossibility of such a construction. We here provide a positive answer to this problem: our multi-show anonymous credential scheme with encrypted attributes relies on the non-interactive Groth-Sahai proof system and the recent work on commuting signatures from Fuchsbauer (Eurocrypt 2011) and is proven secure in the standard model.