English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Verifiable credentials are a digital analogue of physical credentials. Theirauthenticity and integrity are protected by means of cryptographic techniques,and they can be presented to verifiers to reveal attributes or even predicatesabout the attributes included in the credential. One way to preserve privacyduring presentation consists in selectively disclosing the attributes in acredential. In this paper we present the most widespread cryptographicmechanisms used to enable selective disclosure of attributes identifying twocategories: the ones based on hiding commitments - e.g., mdl ISO/IEC 18013-5 -and the ones based on non-interactive zero-knowledge proofs - e.g., BBSsignatures. We also include a description of the cryptographic primitives usedto design such cryptographic mechanisms. We describe the design of thecryptographic mechanisms and compare them by performing an analysis on theirstandard maturity in terms of standardization, cryptographic agility andquantum safety, then we compare the features that they support with main focuson the unlinkability of presentations, the ability to create predicate proofsand support for threshold credential issuance. Finally we perform anexperimental evaluation based on the Rust open source implementations that wehave considered most relevant. In particular we evaluate the size ofcredentials and presentations built using different cryptographic mechanismsand the time needed to generate and verify them. We also highlight sometrade-offs that must be considered in the instantiation of the cryptographicmechanisms.

On Cryptographic Mechanisms for the Selective Disclosure of Verifiable Credentials