Efficient attributes for anonymous credentials

ACM Transactions on Information and System Security

Volumn 15, Issue 1, 2012, Pages

  Camenisch, Jan ^a   Groß, Thomas ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Algorithms; Performance; Security

Indexed keywords

ANONYMOUS CREDENTIAL; ANONYMOUS CREDENTIAL SYSTEMS; CELL PHONE; DISCRETE BINARY; ELECTRONIC IDENTITY; MODULAR EXPONENTIATIONS; PERFORMANCE; PERFORMANCE IMPACT; PRIME NUMBER; REALISTIC APPLICATIONS; SECURITY; SMALL DEVICES; STRONG RSA ASSUMPTION;

ALGORITHMS; COMPUTER SCIENCE; SAFETY ENGINEERING;

SMART CARDS;

EID: 84859475923     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/2133375.2133379     Document Type: Conference Paper

References (48)

1. ATENIESE, G., CAMENISCH, J., JOYE, M., AND TSUDIK, G. 2000. A practical and provably secure coalitionresistant group signature scheme. In Advances in Cryptology (CRYPTO). M. Bellare Ed., Lecture Notes in Computer Science, vol. 1880. Springer Verlag, 255-270.
2. BARIĆ, N. AND PFITZMANN, B. 1997. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology (EUROCRYPT). W. Fumy Ed., Lecture Notes in Computer Science, vol. 1233. Springer Verlag, 480-494. (Pubitemid 127067821)
3. BICHSEL, P., CAMENISCH, J., GROSS, T., AND SHOUP, V. 2009. Anonymous credentials on a standard Java Card. In Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS). ACM Press, 600-610.
4. BONEH, D., BOYEN, X., AND SHACHAM, H. 2004. Short group signatures. In Advances in Cryptology (CRYPTO). M. K. Franklin Ed., Lecture Notes in Computer Science, vol. 3152. Springer Verlag, 41-55.
5. BOUDOT, F. 2000. Efficient proofs that a committed number lies in an interval. In Advances in Cryptology (EUROCRYPT). B. Preneel Ed., Lecture Notes in Computer Science, vol. 1807. Springer Verlag, 431-444.
6. BRANDS, S. 1993. An efficient off-line electronic cash system based on the representation problem. Tech. rep. CS-R9323, CWI.
7. BRANDS, S. 1995a. Restrictive blinding of secret-key certificates. Tech. rep. CS-R9509, CWI.
8. BRANDS, S. 1995b. Secret-key certificates. Tech. rep. CS-R9510, CWI.
9. BRANDS, S. 1997. Rapid demonstration of linear relations connected by boolean operators. In Advances in Cryptology (EUROCRYPT). W. Fumy Ed., Lecture Notes in Computer Science, vol. 1233. Springer Verlag, 318-333. (Pubitemid 127067810)
10. BRANDS, S. 1999. Rethinking public key infrastructure and digital certificates-building in privacy. Ph.D. thesis, Eindhoven Institute of Technology, The Netherlands.
11. CAMENISCH, J. L. 1998. Group signature schemes and payment systems based on the discrete logarithm problem. Ph.D. thesis, No. 12520, ETH Zürich. Hartung Gorre Verlag, Konstanz.
12. CAMENISCH, J. AND STADLER, M. 1997. Efficient group signature schemes for large groups. In Advances in Cryptology (CRYPTO). B. Kaliski Ed., Lecture Notes in Computer Science, vol. 1296. Springer Verlag, 410-424. (Pubitemid 127112569)
13. CAMENISCH, J. AND MICHELS, M. 1999. Proving in zero-knowledge that a number n is the product of two safe primes. In Advances in Cryptology (EUROCRYPT). J. Stern Ed., Lecture Notes in Computer Science, vol. 1592. Springer Verlag, 107-122.
14. CAMENISCH, J. AND LYSYANSKAYA, A. 2001. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In Advances in Cryptology (EUROCRYPT). B. Pfitzmann Ed., Lecture Notes in Computer Science, vol. 2045. Springer Verlag, 93-118. (Pubitemid 33275827)
15. CAMENISCH, J. AND LYSYANSKAYA, A. 2002. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Advances in Cryptology (CRYPTO). M. Yung Ed., Lecture Notes in Computer Science, vol. 2442. Springer Verlag, 61-76.
16. CAMENISCH, J. AND LYSYANSKAYA, A. 2003. A signature scheme with efficient protocols. In Proceedings of the 3rd International Conference on Security in Communication Networks (SCN'02). S. Cimato, C. Galdi, and G. Persiano Eds., Lecture Notes in Computer Science, vol. 2576. Springer Verlag, 268-289.
17. CAMENISCH, J. AND LYSYANSKAYA, A. 2004. Signature schemes and anonymous credentials from bilinear maps. In Advances in Cryptology (CRYPTO). M. K. Franklin Ed., Lecture Notes in Computer Science, vol. 3152. Springer Verlag, 56-72.
18. CAMENISCH, J. AND GROSS, T. 2011. Efficient attributes for anonymous credentials (extended version). Cryptology ePrint Archive Report 2010/496, IACR. http://eprint.iacr.org/.
19. CAMENISCH, J., HOHENBERGER, S., AND LYSYANSKAYA, A. 2005. Compact E-cash. In Advances in Cryptology (Eurocrypt). R. Cramer Ed., Lecture Notes in Computer Science, vol. 3494. Springer, 302-321. (Pubitemid 41313960)
20. CAMENISCH, J.,HOHENBERGER, S.,KOHLWEISS, M., LYSYANSKAYA, A., AND MEYEROVICH, M. 2006. How to win the clonewars: efficient periodic n-times anonymous authentication. In Proceedings of the ACM Conference on Computer and Communications Security. A. Juels, R. N. Wright, and S. D. C. di Vimercati Eds., ACM, 201-210. (Pubitemid 47131369)
21. CAMENISCH, J., GROSS, T., AND SCOTT-HEYDT BENJAMIN, T. 2011. Efficient tight interval proofs with Camenisch-Groß encoding. IBM Res. rep. RZ 3800, IBM Research Division.
22. CELEBI, S. 2009. Design and implementation of efficient attribute-encoding in anonymous credentials. M.S. thesis, ETH Zurich.
23. CHAN, A., FRANKEL, Y., AND TSIOUNIS, Y. 1998. Easy come-easy go divisible cash. In Advances in Cryptology (EUROCRYPT). K. Nyberg Ed., Lecture Notes in Computer Science, vol. 1403. Springer Verlag, 561-575.
24. CHAUM, D. 1981. Untraceable electronicmail, return addresses, and digital pseudonyms. Comm. ACM 24, 2, 84-88. (Pubitemid 11480996)
25. CHAUM, D. 1983. Blind signatures for untraceable payments. In Advances in Cryptology (CRYPTO). D. Chaum, R. L. Rivest, and A. T. Sherman Eds., Plenum Press, 199-203.
26. CHAUM, D. 1985. Security without identification: Transaction systems to make big brother obsolete. Comm. ACM 28, 10, 1030-1044. (Pubitemid 15587967)
27. CHAUM, D. AND EVERTSE, J.-H. 1987. A secure and privacy-protecting protocol for transmitting personal information between organizations. In Advances in Cryptology (CRYPTO). M. Odlyzko Ed., Lecture Notes in Computer Science, vol. 263. Springer Verlag, 118-167.
28. CHAUM, D. AND VAN HEYST, E. 1991. Group signatures. In Advances in Cryptology (EUROCRYPT). D. W. Davies Ed., Lecture Notes in Computer Science, vol. 547. Springer Verlag, 257-265.
29. CHAUM, D. AND PEDERSEN, T. P. 1993. Wallet databases with observers. In Advances in Cryptology (CRYPTO). E. F. Brickell Ed., Lecture Notes in Computer Science, vol. 740. Springer Verlag, 89-105.
30. CRAMER, R., DAMGÅRD, I., AND SCHOENMAKERS, B. 1994. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology (CRYPTO). Y. G. Desmedt Ed., Lecture Notes in Computer Science, vol. 839. Springer Verlag, 174-187.
31. DAMGÅRD, I. AND FUJISAKI, E. 2001. An integer commitment scheme based on groups with hidden order. http://eprint.iacr.org/2001.
32. FIAT, A. AND SHAMIR, A. 1987. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology (CRYPTO). A.M. Odlyzko Ed., Lecture Notes in Computer Science, vol. 263. Springer Verlag, 186-194.
33. FRANKEL, Y., TSIOUNIS, Y., AND YUNG, M. 1998. Fair off-line e-cash made easy. In Advances in Cryptology (ASIACRYPT). K. Kim and T. Matsumoto Eds., Lecture Notes in Computer Science, vol. 1514. Springer Verlag, 257-270. (Pubitemid 128151425)
34. FUJIOKA, A., OKAMOTO, T., AND OHTA, K. 1992. A practical secret voting scheme for large scale elections. In Advances in Cryptology (ASIACRYPT). J. Seberry and Y. Zheng Eds., Lecture Notes in Computer Science, vol. 718. Springer, 244-251.
35. FUJISAKI, E. AND OKAMOTO, T. 1997. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology (CRYPTO). B. Kaliski Ed., Lecture Notes in Computer Science, vol. 1294. Springer Verlag, 16-30. (Pubitemid 127112542)
36. GOLDWASSER, S., MICALI, S., AND RIVEST, R. 1988. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17, 2, 281-308.
37. IBM. 2010. Specification of the Identity Mixer cryptographic library, v. 2.3.2. Specification, IBM Research. http://prime.inf.tu-dresden.de/idemix/.
38. KIAYIAS, A. AND YUNG, M. 2006. Secure scalable group signature with dynamic joins and separable authorities. Int. J. Secur. Netw. 1, 1/2, 24-45.
39. KIAYIAS, A., YUNG, M., AND TSIOUNIS, Y. 2004. Traceable signatures. In Advances in Cryptology (EUROCRYPT). C. Cachin and J. Camenisch Eds., Lecture Notes in Computer Science, vol. 3027. Springer, 571-589.
40. MILLER, G. L. 1976. Riemann's hypothesis and tests for primality. J. Comput. Syst. Sci. 13, 300-317.
41. NAOR, M., PINKAS, B., AND SUMNER, R. 1999. Privacy preserving auctions and mechanism design. In Proceedings of the 1st ACM Conference on Electronic Commerce.
42. PEDERSEN, T. P. 1992. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology (CRYPTO). J. Feigenbaum Ed., Lecture Notes in Computer Science, vol. 576, Springer Verlag, 129-140.
43. RABIN, M. O. 1980. Probabilistic algorithm for testing primality. J. Number Theory 12, 128-138.
44. RABIN, M. O. AND SHALLIT, J. O. 1986. Randomized algorithms in number theory. Comm. Pure Appl. Math. 39, 239-256.
45. SCHNORR, C. P. 1991. Efficient signature generation for smart cards. J. Cryptology 4, 3, 239-252.
46. SHOUP, V. 2008. A Computational Introduction to Number Theory and Algebra 2nd Ed. Cambridge University Press. http://www.shoup.net/ntb/.
47. SPF INT ÉRIEUR. 2005. Instructions generales relatives à la carte d'indentité électronique. SPF Intérieur, Service Registres de la Population et Cartes d'identité, Bruxelles. http://www.registrenational.fgov.be.
48. WORLD HEALTH ORGANIZATION (WHO). 2005. International Statistical Classification of Diseases and Health Related Problems (ICD-10). 2nd Ed., 10th Rev. Ed. World Health Organization, Geneva.