Cryptology ePrint Archive: Report 2015/842

On Linkability and Malleability in Self-blindable Credentials

Jaap-Henk Hoepman and Wouter Lueks and Sietse Ringers

Abstract: Self-blindable credential schemes allow users to anonymously prove ownership of credentials. This is achieved by randomizing the credential before each showing in such a way that it still remains valid. As a result, each time a different version of the same credential is presented. A number of such schemes have been proposed, but unfortunately many of them are broken, in the sense that they are linkable (i.e., failing to protect the privacy of the user), or malleable (i.e., they allow users to create new credentials using one or more valid credentials given to them). In this paper we prove a general theorem that relates linkability and malleability in self-blindable credential schemes, and that can test whether a scheme is linkable or malleable. After that we apply the theorem to a number of self-blindable credential schemes to show that they suffer from one or both of these issues.

Category / Keywords: cryptographic protocols / anonymous credentials, self-blindable credentials, elliptic curve cryptosystem

Original Publication (in the same form): The 9th WISTP International Conference on Information Security Theory and Practice (WISTP’2015)

Date: received 31 Aug 2015

Contact author: s ringers at rug nl

Available format(s): PDF | BibTeX Citation

Version: 20150831:152651 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]