arXivDaily arXiv每日学术速递 周一至周五更新
看起来今天可以划水了
arXiv 2401.08196cs.CR
收藏

面向可验证凭证选择性披露的密码学机制研究

On Cryptographic Mechanisms for the Selective Disclosure of Verifiable Credentials

Andrea Flamini, Giada Sciarretta, Mario Scuro, Amir Sharif, Alessandro Tomasi, Silvio Ranise

备注：
37 pages, 6 tables, 3 figures
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

AI总结：

本文系统梳理并比较了基于隐藏承诺和基于非交互式零知识证明的两类可验证凭证选择性披露密码学机制，并通过Rust实现实验评估其凭证大小、生成与验证时间及标准化成熟度、不可链接性、谓词证明和阈值签发等特性，揭示实例化中的关键权衡。

摘要：

可验证凭证是物理凭证的数字对应物。其真实性和完整性通过密码学技术加以保护，并且可以向验证者出示以揭示属性，甚至揭示关于凭证中所含属性的谓词。在出示过程中保护隐私的一种方式是选择性地披露凭证中的属性。本文介绍了用于实现属性选择性披露的最广泛使用的密码学机制，并将其划分为两类：一类基于隐藏承诺——例如mdl ISO/IEC 18013-5——另一类基于非交互式零知识证明——例如BBS签名。我们还描述了用于设计这些密码学机制的密码学原语。我们描述了这些密码学机制的设计，并通过对其在标准化、密码学敏捷性和量子安全性方面的标准成熟度进行分析来对它们进行比较，然后比较它们所支持的特性，重点关注出示的不可链接性、创建谓词证明的能力以及对阈值凭证签发的支持。最后，我们基于我们认为最相关的Rust开源实现进行了实验评估。特别是，我们评估了使用不同密码学机制构建的凭证和出示的大小，以及生成和验证它们所需的时间。我们还强调了在实例化这些密码学机制时必须考虑的一些权衡。

英文摘要：

Verifiable credentials are a digital analogue of physical credentials. Their authenticity and integrity are protected by means of cryptographic techniques, and they can be presented to verifiers to reveal attributes or even predicates about the attributes included in the credential. One way to preserve privacy during presentation consists in selectively disclosing the attributes in a credential. In this paper we present the most widespread cryptographic mechanisms used to enable selective disclosure of attributes identifying two categories: 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., BBS signatures. We also include a description of the cryptographic primitives used to design such cryptographic mechanisms. We describe the design of the cryptographic mechanisms and compare them by performing an analysis on their standard maturity in terms of standardization, cryptographic agility and quantum safety, then we compare the features that they support with main focus on the unlinkability of presentations, the ability to create predicate proofs and support for threshold credential issuance. Finally we perform an experimental evaluation based on the Rust open source implementations that we have considered most relevant. In particular we evaluate the size of credentials and presentations built using different cryptographic mechanisms and the time needed to generate and verify them. We also highlight some trade-offs that must be considered in the instantiation of the cryptographic mechanisms.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

↑