Abstract
Anonymous credential systems are a key ingredient for a secure and privacy protecting electronic world. In their full-fledged form, they can realize a broad range of requirements of authentication systems. However, these many features result in a complex system that can be difficult to use. In this paper, we aim to make credential systems easier to employ by providing an architecture and high-level specifications for the different components, transactions and features of the identity mixer anonymous credential system. The specifications abstract away the cryptographic details but they are still sufficiently concrete to enable all features. We demonstrate the use of our framework by applying it to an e-cash scenario.
Chapter PDF
Similar content being viewed by others
References
Bangerter, E., Camenisch, J., Lysyanskaya, A.: A cryptographic framework for the controlled release of certified data. In: SPW 2004. LNCS, Springer, Heidelberg (2004)
Bichsel, P., Camenisch, J., Groß, T., Shoup, V.: Anonymous credentials on a standard Java Card. In: Proc. 16th ACM CCS, pp. 600–610 (November 2009)
Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: Proc. 11th ACM CCS, pp. 168–177 (2004)
Brands, S.: Electronic cash systems based on the representation problem in groups of prime order. In: CRYPTO 1993, pp. 26.1– 26.15 (1993)
Brands, S.: Rethinking Public Key Infrastructure and Digital Certificates–Building in Privacy. PhD thesis, Eindhoven Institute of Technology, Eindhoven, The Netherlands (1999)
Brands, S., Demuynck, L., Decker, B.D.: A practical system for globally revoking the unlinkable pseudonyms of unknown users. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 400–415. Springer, Heidelberg (2007)
Brands, S., Paquin, C.: U-Prove cryptographic specification v1.0 (March 2010)
Camenisch, J., Chaabouni, R., Shelat, A.: Efficient protocols for set membership and range proofs. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 234–252. Springer, Heidelberg (2008)
Camenisch, J., Groß, T.: Efficient attributes for anonymous credentials. In: Proc.15th ACM CCS, pp. 345–356 (November 2008)
Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., Meyerovich, M.: How to win the clonewars: efficient periodic n-times anonymous authentication. In: Proc. 13th ACM CCS, pp. 201–210 (2006)
Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Compact E-cash. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 302–321. Springer, Heidelberg (2005)
Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Balancing accountability and privacy using e-cash (extended abstract). In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 141–155. Springer, Heidelberg (2006)
Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: Jarecki, S., Tsudik, G. (eds.) Public Key Cryptography – PKC 2009. LNCS, vol. 5443, pp. 481–500. Springer, Heidelberg (2009)
Camenisch, J., Lysyanskaya, A.: Efficient non-transferable anonymous multi- show credential system with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93–118. Springer, Heidelberg (2001)
Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 268–289. Springer, Heidelberg (2003)
Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56–72. Springer, Heidelberg (2004)
Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms (2002), http://eprint.iacr.org/2002/161
Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system. In: Proc. 9th ACM CCS (2002)
Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Comm. of the ACM 24(2), 84–88 (1981)
Damgård, I.B., Fujisaki, E.: An integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125–142. Springer, Heidelberg (2002)
Nakanishi, T., Fujii, H., Hira, Y., Funabiki, N.: Revocable group signature schemes with constant costs for signing and verifying. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 463–480. Springer, Heidelberg (2009)
IBM Research– Zurich, Security Team. Specification of the identity mixer cryp- tographic library. IBM Research Report RZ 3730, IBM Research Division (April 2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bichsel, P., Camenisch, J. (2010). Mixing Identities with Ease. In: de Leeuw, E., Fischer-Hübner, S., Fritsch, L. (eds) Policies and Research in Identity Management. IDMAN 2010. IFIP Advances in Information and Communication Technology, vol 343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17303-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-17303-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17302-8
Online ISBN: 978-3-642-17303-5
eBook Packages: Computer ScienceComputer Science (R0)