Flexible and Time-Based Anonymous Access Restrictions

  • Kristof Verslype
  • Bart De Decker
Part of the Communications in Computer and Information Science book series (CCIS, volume 130)


The presented system allows service providers to restrict the number of times a user can access a specific service during a single timeframe, while different accesses by the same user are unlinkable. The length of each timeframe and the access limit in that timeframe can be flexibly and dynamically chosen by the service provider and can depend upon the personal properties disclosed by the user.


Anonymity Privacy Security Pseudonym Unlinkability Anonymous credentials 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellare, M., Goldreich, O.: On defining proofs of knowledge, pp. 390–420. Springer, Heidelberg (1992)zbMATHGoogle Scholar
  2. 2.
    Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 103–112. ACM, New York (1988)CrossRefGoogle Scholar
  3. 3.
    Boudot, F.: Efficient proofs that a committed number lies in an interval, pp. 431–444. Springer, Heidelberg (2000)zbMATHGoogle Scholar
  4. 4.
    Brands, S.: A technical overview of digital credentials (1999)Google Scholar
  5. 5.
    Brands, S.: Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, Cambridge (2000)Google Scholar
  6. 6.
    Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system (2002)Google Scholar
  7. 7.
    Camenisch, J.L., Lysyanskaya, A.: An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93–118. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., Meyerovich, M.: How to win the clone wars: Efficient periodic n-times anonymous authentication. Cryptology ePrint Archive, Report 2006/454 (2006)Google Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Chaum, D.: Security without identification: transaction systems to make big brother obsolete. ACM Commun. 28(10), 1030–1044 (1985)CrossRefGoogle Scholar
  11. 11.
    Cramer, R., Damgård, I.B., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)Google Scholar
  12. 12.
    Damgard, I., Dupont, K., Pedersen, M.: Unclonable group identification (2006)Google Scholar
  13. 13.
    Damgard, I., Pedersen, T., Pfitzmann, B.: Statistical secrecy and multi-bit commitments (1996)Google Scholar
  14. 14.
    Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 416–431. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792–807 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Nguyen, L., Safavi-Naini, R.: Dynamic k-times anonymous authentication. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 318–333. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  17. 17.
    Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)Google Scholar
  18. 18.
    Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology, 103–112 (1991)Google Scholar
  19. 19.
    Teranishi, I., Furukawa, J., Sako, K.: k-times anonymous authentication (extended abstract). In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 308–322. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Kristof Verslype
    • 1
  • Bart De Decker
    • 1
  1. 1.Department of Computer ScienceHeverleeBelgium

Personalised recommendations