Formalising Linked-Data based Verifiable Credentials for Selective Disclosure
Authors:
- 1 June 2022
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 52-65
Abstract
In this paper, we propose a formal definition for Linked-Data based verifiable credential to enable secure selective disclosure among one or multiple verifiable creden-tials a user has. Previous schemes considered using a single verifiable credential and could not hide the user's identifying information when performing selective disclosure. We pro-pose the first Linked-Data based verifiable credentials that can perform selective disclosure free from the restrictions the previous scheme had, and prove its property. We also discuss a novel use of combining multiple certificates issued by independent issuers to still allow users to perform selective disclosure on the set of credentials. Our scheme has been implemented as an open source Web-based application that generates a verifiable presentation for a given selection of attributes. The performance evaluation is also provided in the paper.Keywords
This publication has 16 references indexed in Scilit:
- Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous CredentialsJournal of Cryptology, 2018
- The JavaScript Object Notation (JSON) Data Interchange Format2017
- Canonical Forms for Isomorphic and Equivalent RDF GraphsACM Transactions on the Web, 2017
- Anonymous credentials light2013
- Linked Data2011
- Constant-Size Dynamic k-TAA2006
- Signature Schemes and Anonymous Credentials from Bilinear Maps2004
- Short Group Signatures2004
- A Signature Scheme with Efficient Protocols2003
- Security without identification: transaction systems to make big brother obsoleteCommunications of the ACM, 1985