Differential Trust: Dynamic Multi-Authority Anonymous Credentials with Epoch-Weighted Updates
Chen Li, Jianting Ning, Xiulong Liu, Yulin Liu
摘要
Anonymous credentials (ACs) are fundamental to privacy-preserving authentication, allowing users to prove possession of attributes without revealing their identities. State-of-the-art ACs distribute credential issuance across multiple authorities, typically employing techniques such as Shamir's secret sharing or aggregate signatures. While this approach enhances system robustness and eliminates single point of failure, it treats all authorities equally in the credential issuance phase. This uniform treatment disregards the varying levels of trustworthiness or stake held by different authorities. Such limitation has become particularly problematic in modern decentralized systems like Proof-of-Stake networks, where the inherent trust differentiation among nodes cannot be leveraged in the credential issuance process. To address this limitation, we propose the notion of M ulti- A uthority A nonymous C redentials with E poch-Based W eights (MA-ACEW), the first Multi-Authority Anonymous Credential (MA-AC) model that considers authorities' weight distribution in credential issuance. Crucially, MA-ACEW enables efficient credential updates when authority weight distributions change across epochs. The core of MA-ACEW is our novel Epoch-Bound Pointcheval-Sanders Signature (EB-PS) primitive, which binds signatures to specific time epochs. This temporal binding enables both weight-based credential issuance within epochs and efficient non-interactive credential updates across epochs. We formalize the EUF-eCMA unforgeability requirement for EB-PS and prove our construction satisfies it under a novel STB-GPS assumption. We then prove that our MA-ACEW construction achieves unforgeability, anonymity, and blindness. Finally, we present benchmarks demonstrating the efficiency of EB-PS and MA-ACEW. Remarkably, presenting a credential aggregated from 128 partial ones takes only 10.68 ms on average.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper11
- Coconut: Threshold Issuance Selective Disclosure Credentials with Applications to Distributed LedgersAlberto Sonnino, Mustafa Al-Bassam, Shehar Bano, Sarah Meiklejohn 等NDSS 2019 · 被引用 218 次
- FlyClient: Super-Light Clients for CryptocurrenciesBenedikt Bünz, Lucianna Kiffer, Loi Luu, Mahdi ZamaniS&P 2020 · 被引用 151 次
- Updatable Anonymous Credentials and Applications to Incentive SystemsJohannes Blömer, Jan Bobolz, Denis Diemert, Fabian EidensCCS 2019 · 被引用 52 次
- With a Little Help from My Friends: Constructing Practical Anonymous CredentialsLucjan Hanzlik, Daniel SlamanigCCS 2021 · 被引用 52 次
- Anonymous Tokens with Private Metadata BitBen Kreuter, Tancrède Lepoint, Michele Orrù, Mariana RaykovaCRYPTO 2020 · 被引用 35 次
相关 Paper
- Aggregate Signatures with Versatile Randomization and Issuer-Hiding Multi-Authority Anonymous CredentialsOmid Mir, Balthazar Bauer, Scott Griffy, Anna Lysyanskaya 等CCS 2023 · 被引用 29 次
- Server-Aided Anonymous CredentialsRutchathon Chairattana-Apirom, Franklin Harding, Anna Lysyanskaya, Stefano TessaroCRYPTO 2025 · 被引用 10 次
- Do You Need a Receipt? Anonymous Credential Revocation at Continental Scale via Private Record CertificationKasra EdalatNejad, Sebastian Faust, Jonas Hofmann, Philipp-Florens Lehwalder 等USENIX Security 2026 · 被引用 1 次
- Multi-Holder Anonymous Credentials from BBS SignaturesAndrea Flamini, Eysa Lee, Anna LysyanskayaCRYPTO 2025 · 被引用 6 次
- Device-Bound Anonymous Credentials With(out) Trusted HardwareKarla Friedrichs, Franklin Harding, Anja Lehmann, Anna LysyanskayaEUROCRYPT 2026 · 被引用 1 次
