Skip to Main content Skip to Navigation
Conference papers

On Linkability and Malleability in Self-blindable Credentials

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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01442543
Contributor : Hal Ifip <>
Submitted on : Friday, January 20, 2017 - 4:47:44 PM
Last modification on : Monday, October 9, 2017 - 1:18:03 PM
Long-term archiving on: : Friday, April 21, 2017 - 4:19:42 PM

File

978-3-319-24018-3_13_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

119

Files downloads

229