Solving revocation with efficient update of anonymous credentials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6280 LNCS, Issue , 2010, Pages 454-471

  Camenisch, Jan ^a   Kohlweiss, Markulf ^b   Soriente, Claudio ^c  

^a IBM RESEARCH ZURICH   (Switzerland)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMOUS CREDENTIAL; ANONYMOUS CREDENTIAL SYSTEMS; CERTIFICATE REVOCATION LIST; CERTIFICATION AUTHORITIES; COMPUTATIONAL COSTS; DIGITAL SERVICES; NON-INTERACTIVE; TIME-PERIODS; UBIQUITOUS ACCESS; USER PRIVACY;

CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 77958052380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15317-4_28     Document Type: Conference Paper

References (33)

1. Windowscardspace(2010), http://www.microsoft.com/windows/products/ winfamily/cardspace/(accessed April 2010)
2. Au, M.H., Susilo, W., Mu, Y.: Constant-size dynamic k-TAA. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 111-125. Springer, Heidelberg (2006)
3. Bangerter, E., Camenisch, J., Lysyanskaya, A.: A cryptographic framework for the controlled release ofcertified data. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Se-curity Protocols 2004. LNCS, vol. 3957, pp. 20-42. Springer, Heidelberg (2006)
4. Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., Shacham, H.: Randomizable proofs and delegatable anonymous credentials. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 108-125. Springer, Heidelberg (2009)
5. Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: P-signatures and noninteractive anonymous credentials. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 356-374. Springer, Heidelberg (2008)
6. Bichsel, P., Camenisch, J., Groß, T., Shoup, V.: Anonymous credentials on a standard Java Card. In: ACM Conference on Computer and Communications Security (2009) (to appear)
7. Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. K. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41-55. Springer, Heidelberg (2004)
8. Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: Atluri, V., Pfitz-mann, B., McDaniel, P. (eds.) ACM CCS 2004, pp. 168-177. ACM, New York (2004)
9. Brands, S.: Rapid demonstration of linear relations connected by boolean operators. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 318-333. Springer, Heidelberg (1997)
10. Brands, S.: Rethinking Public Key Infrastructure and Digital Certificates\Building in Pri-vacy. PhD thesis, Eindhoven Institute of Technology, Eindhoven, The Netherlands (1999)
11. Brands, S.: Rethinking Public Key Infrastructures and Digital Certificates. MIT Press, Cam-bridge (2000)
12. Brands, S., Demuynck, L., De Decker, B.:A practical system for globally revoking the un-linkable pseudonyms of unknown users. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 400-415. Springer, Heidelberg (2007)
13. Brands, S., Demuynck, L., De Decker, B.: A practical system for globally revoking the un-linkable pseudonyms of unknown users. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 400-415. Springer, Heidelberg (2007)
14. Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: Proc. 11th ACM Conference on Computer and Communications Security, pp. 225-234. ACM Press, New York (2004)
15. Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system. In: Proc. 9th ACM Conference on Computer and Communications Secu-rity, ACM Press, New York (2002)
16. Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 481-500. Springer, Heidelberg (2009)
17. Camenisch, J., Lysyanskaya, A.: Efficient non-transferable anonymous multi-show creden-tial system with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93-118. Springer, Heidelberg (2001)
18. Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revo-cation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61-76. Springer, Heidelberg (2002)
19. 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, Heidel-berg (2003)
20. Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilin-ear maps. In: Franklin, M.K. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56-72. Springer, Heidelberg (2004)
21. Camenisch, J., Michels, M.: Proving in zero-knowledge that a number n is the product of two safeprimes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 107-122. Springer, Heidelberg (1999)
22. Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410-424. Springer, Heidelberg (1997)
23. Camenisch, J.L.: Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Zürich, Diss. ETH No. 12520. Hartung Gorre Verlag, Konstanz (1998)
24. Chaum, D.: Security without identification: Transaction systems to make big brother obso-lete. Communications of the ACM 28(10), 1030-1044 (1985)
25. Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89-105. Springer, Heidelberg (1993)
26. Cooper, D., Santesson, S., Farrell, S., Boeyen, S., Housley, R., Polk, W.: Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile. RFC 5280 (Proposed Standard) (May 2008)
27. Cramer, R., Damga°rd, I., MacKenzie, P.D.: Efficient zero-knowledge proofs of knowl-edge without intractability assumptions. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 354-372. Springer, Heidelberg (2000)
28. Cramer, R., Damga°rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified de-sign of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174-187. Springer, Heidelberg (1994)
29. Lapon, J., Kohlweiss, M., De Decker, B., Naessens, V.: Performance analysis of accumulator-based revocation mechanisms. In: Proceedings of the 25th International Conference on Infor-mation Security (SEC 2010), Brisbane, AU. IFIP Conference Proceedings, p. 12. Springer, Heidelberg (2010)
30. 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)
31. Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129-140. Springer, Heidelberg (1992)
32. Schnorr, C.P.: Efficient signature generation for smart cards. Journal of Cryptology 4(3), 239-252 (1991)
33. Tsang, P.P., Au, M.H., Kapadia, A., Smith, S.W.: Blacklistable anonymous credentials: blocking misbehaving users without ttps. In: CCS 2007: Proceedings of the 14th ACM con-ference on Computer and communications security, pp. 72-81 (2007)