Paper 2025/041 Original: eprint.iacr.org/2025/041 ↗

Keyed-Verification Anonymous Credentials with Highly Efficient Partial Disclosure

Omid Mirzamohammadi
Jan Bobolz
Mahdi Sedaghat
Emad Heydari Beni
Aysajan Abidin
Dave Singelee
Bart Preneel
Abstract

An anonymous credential (AC) system with partial disclosure allows users to prove possession of a credential issued by an issuer while selectively disclosing a subset of their attributes to a verifier in a privacy-preserving manner. In keyed-verification AC (KVAC) systems, the issuer and verifier share a secret key. Existing KVAC schemes rely on computationally expensive zero-knowledge proofs during credential presentation, with the presentation size growing linearly with the number of attributes. In this work, we propose two highly efficient KVAC constructions that eliminate the need for zero-knowledge proofs during the credential presentation and achieve constant-size presentations. Our first construction adapts the approach of Fuchsbauer, Hanser and Slamanig (JoC'19), which achieved constant-size credential presentation in a publicly verifiable setting using their proposed structure-preserving signatures on equivalence classes (SPS-EQ) and set commitment schemes, to the KVAC setting. We introduce structure-preserving message authentication codes on equivalence classes (SP-MAC-EQ) and designated-verifier set commitments (DVSC), resulting in a KVAC system with constant-size credentials (2 group elements) and presentations (5 group elements). To avoid the bilinear groups and pairing operations required by SP-MAC-EQ, our second construction uses a homomorphic MAC with a simplified DVSC. While this sacrifices constant-size credentials ($n+2$ group elements, where $n$ is the number of attributes), it retains constant-size presentations (2 group elements) in a pairingless setting. We formally prove the security of both constructions and provide open-source implementation results demonstrating their practicality. We extensively benchmarked our KVAC protocols and, additionally, bechmarked the efficiency of our SP-MAC-EQ scheme against the original SPS-EQ scheme, showcasing significant performance improvements.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2025-10-20: last updated
2025-01-10: published
Short URL
https://ia.cr/2025/041
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2025/041,
      author = {Omid Mirzamohammadi and Jan Bobolz and Mahdi Sedaghat and Emad Heydari Beni and Aysajan Abidin and Dave Singelee and Bart Preneel},
      title = {Keyed-Verification Anonymous Credentials with Highly Efficient Partial Disclosure},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/041},
      year = {2025},
      url = {https://eprint.iacr.org/2025/041}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.