On Linkability and Malleability in Self-blindable Credentials - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

On Linkability and Malleability in Self-blindable Credentials

Jaap-Henk Hoepman
  • Function : Author
  • PersonId : 986186
Wouter Lueks
  • Function : Author
  • PersonId : 986185
Sietse Ringers
  • Function : Author
  • PersonId : 999007


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.
Fichier principal
Vignette du fichier
978-3-319-24018-3_13_Chapter.pdf (441.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01442543 , version 1 (20-01-2017)





Jaap-Henk Hoepman, Wouter Lueks, Sietse Ringers. On Linkability and Malleability in Self-blindable Credentials. 9th Workshop on Information Security Theory and Practice (WISTP), Aug 2015, Heraklion, Crete, Greece. pp.203-218, ⟨10.1007/978-3-319-24018-3_13⟩. ⟨hal-01442543⟩
42 View
65 Download



Gmail Facebook Twitter LinkedIn More