Privacy-preserving digital credentials are cryptographic tools that allow a user to prove a predicate about his/her identity or qualifications, without the verifying party learning additional information beyond the status of that predicate. The Identity Mixer (Idemix) [CL01] is a framework providing such credentials. In Idemix, we can distinguish two types of credentials: (1) one-time show credentials which can be shown only once before unveiling the identity of their holder, and (2) multi-show credentials which can be shown infinitely many times without the showings being linked to each other, or to the identity of their holder. In this paper, we bridge the gap between the two previous types of credentials, and extend Idemix to k-show credentials (for k > 1.) The k-show credentials we propose can be shown anonymously, but linkably, up to k-times. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Layouni, M., & Vangheluwe, H. (2007). Anonymous k-show credentials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4582 LNCS, pp. 181–192). Springer Verlag. https://doi.org/10.1007/978-3-540-73408-6_13
Mendeley helps you to discover research relevant for your work.