SERVICE AND TIMEFRAME DEPENDENT UNLINKABLE ONE-TIME PSEUDONYMS

Kristof Verslype, Bart De Decker

2009

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.

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