SERVICE AND TIMEFRAME DEPENDENT UNLINKABLE ONE-TIME PSEUDONYMS

Kristof Verslype, Bart De Decker

Abstract

A solution is presented to allow a service provider to limit the number of times per timeframe that a user can access each single service, while maintaining complete unlinkability of different visits by that user. Since the solution is built upon existing building blocks such as anonymous credentials, it is extremely flexible.

References

  1. Bellare, M. and Goldreich, O. (1992). On defining proofs of knowledge. pages 390-420. Springer-Verlag.
  2. Blum, M., Feldman, P., and Micali, S. (1988). Noninteractive zero-knowledge and its applications. In STOC 7888: Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 103-112, New York, NY, USA. ACM.
  3. Boudot, F. (2000). Efficient proofs that a committed number lies in an interval. pages 431-444. Springer Verlag.
  4. Brands, S. (1999). A technical overview of digital credentials.
  5. Brands, S. (2000). Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, Cambridge, MA, USA.
  6. Camenisch, J. and Herreweghen, E. V. (2002). Design and implementation of the idemix anonymous credential system.
  7. Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., and Meyerovich, M. (2006a). How to win the clone wars: Efficient periodic n-times anonymous authentication. Cryptology ePrint Archive, Report 2006/454.
  8. Camenisch, J., Hohenberger, S., and Lysyanskaya, A. (2006b). Balancing accountability and privacy using e-cash (extended abstract. In In SCN, volume 4116 of LNCS, pages 141-155. Springer.
  9. Camenisch, J. and Lysyanskaya, A. (2001). An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. In EUROCRYPT 7801: Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, pages 93-118, London, UK. SpringerVerlag.
  10. Chaum, D. (1985). Security without identification: transaction systems to make big brother obsolete. Commun. ACM, 28(10):1030-1044.
  11. Cramer, R., Damga┬░rd, I., and Schoenmakers, B. (1994). Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO 7894: Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, pages 174-187, London, UK. Springer-Verlag.
  12. Damgard, I., Dupont, K., and Pedersen, M. (2006). Unclonable group identification.
  13. Damgard, I., Pedersen, T., and Pfitzmann, B. (1996). Statistical secrecy and multi-bit commitments.
  14. Nguyen, L. and Safavi-naini, R. (2005). Dynamic k-times anonymous authentication. In In ACNS 2005, number 3531 in LNCS, pages 318-333. Springer Verlag.
  15. Pedersen, T. (1992). Non-interactive and informationtheoretic secure verifiable secret sharing. In CRYPTO 7891: Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, pages 129-140, London, UK. Springer-Verlag.
  16. Schnorr, C. P. (1991). Efficient signature generation by smart cards. In Journal of Cryptology, pages 103-112, New York, NY, USA. Springer.
  17. Teranishi, I., Furukawa, J., and Sako, K. (2004). k-times anonymous authentication (extended abstract. In In Asiacrypt, volume 3329 of LNCS, pages 308-322. Springer.
Download


Paper Citation


in Harvard Style

Verslype K. and De Decker B. (2009). SERVICE AND TIMEFRAME DEPENDENT UNLINKABLE ONE-TIME PSEUDONYMS . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2009) ISBN 978-989-674-005-4, pages 13-20. DOI: 10.5220/0002231100130020


in Bibtex Style

@conference{secrypt09,
author={Kristof Verslype and Bart De Decker},
title={SERVICE AND TIMEFRAME DEPENDENT UNLINKABLE ONE-TIME PSEUDONYMS},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2009)},
year={2009},
pages={13-20},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002231100130020},
isbn={978-989-674-005-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2009)
TI - SERVICE AND TIMEFRAME DEPENDENT UNLINKABLE ONE-TIME PSEUDONYMS
SN - 978-989-674-005-4
AU - Verslype K.
AU - De Decker B.
PY - 2009
SP - 13
EP - 20
DO - 10.5220/0002231100130020