Counting Abuses Using Flexible Off-line Credentials

  • Kemal Bicakci
  • Bruno Crispo
  • Andrew S. Tanenbaum
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3574)


Mobile and ad-hoc networks allow businesses to provide a new range of applications and services and at the same time they introduce new constraints that have important effects on the way in which security primitives must be designed. This is challenging because it translates to a demand of richer and more flexible security primitives that often need to satisfy stricter requirements than traditional wired network scenarios. In this paper we focus on one of this primitive, namely security credentials. We present a solution that extends the existing protocols used to implement off-line credentials such that, not only abuses can be detected but they can also be counted. Our solution addresses the problem of 1-time and 2-times credentials and we will conclude by discussing the challenges that need to be solved to generalize the primitive to k=n.


Random Number Credit Card Blind Signature Hash Image Security Credential 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 319–327. Springer, Heidelberg (1990)Google Scholar
  2. 2.
    Chaum, D.: Online cash checks. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 288–293. Springer, Heidelberg (1990)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Brands, S.: A technical overview of digital credentials. Research Report (February 2002)Google Scholar
  5. 5.
    Camenisch, J., 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
  6. 6.
    Bussard, L., Molva, R.: One-Time Capabilities for Authorizations without Trust. In: Proc. of Second IEEE International Conference on Pervasive Computing and Communications(PerCom 2004), Orlando, Florida, March 14-17 (2004)Google Scholar
  7. 7.
    Lamport, L.: Constructing digital signatures from a one-way function. Technical report SRI-CS-98. SRI International Computer Science Laboratory (October 1979)Google Scholar
  8. 8.
    Bicakci, K., Tsudik, G., Tung, B.: How to construct optimal one-time signatures. Computer Networks (Elsevier) 43(3), 339–349 (2003)zbMATHCrossRefGoogle Scholar
  9. 9.
    Chaum, D.: Blind signatures for untraceable payments. In: Proc. of CRYPTO 1982, pp. 199–203 (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kemal Bicakci
    • 1
  • Bruno Crispo
    • 1
  • Andrew S. Tanenbaum
    • 1
  1. 1.Department of Computer ScienceVrije UniversiteitAmsterdamThe Netherlands

Personalised recommendations