With a Little Help from My Friends: Constructing Practical Anonymous Credentials
Lucjan Hanzlik, Daniel Slamanig
Abstract
Anonymous credentials (ACs) are a powerful cryptographic tool for the secure use of digital services, when simultaneously aiming for strong privacy guarantees of users combined with strong authentication guarantees for providers of services. They allow users to selectively prove possession of attributes encoded in a credential without revealing any other meaningful information about themselves. While there is a significant body of research on AC systems, modern use-cases of ACs such as mobile applications come with various requirements not sufficiently considered so far. These include preventing the sharing of credentials and coping with resource constraints of the platforms (e.g., smart cards such as SIM cards in smartphones). Such aspects are typically out of scope of AC constructions, and, thus AC systems that can be considered entirely practical have been elusive so far. In this paper we address this problem by introducing and formalizing the notion of core/helper anonymous credentials (CHAC). The model considers a constrained core device (e.g., a SIM card) and a powerful helper device (e.g., a smartphone). The key idea is that the core device performs operations that do not depend on the size of the credential or the number of attributes, but at the same time the helper device is unable to use the credential without its help. We present a provably secure generic construction of CHACs using a combination of signatures with flexible public keys (SFPK) and the novel notion of aggregatable attribute-based equivalence class signatures (AAEQ) along with a concrete instantiation. The key characteristics of our scheme are that the size of showing tokens is independent of the number of attributes in the credential(s) and that the core device only needs to compute a single elliptic curve scalar multiplication, regardless of the number of attributes. We confirm the practical efficiency of our CHACs with an implementation of our scheme on a Multos smart card as the core and an Android smartphone as the helper device. A credential showing requires less than 500 ms on the smart card and around 200 ms on the smartphone (even for a credential with 1000 attributes).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d17d7b6d-7bb8-4ced-b6b9-8aa3e7ce0c49Cited by top-tier papers5
- Aggregate Signatures with Versatile Randomization and Issuer-Hiding Multi-Authority Anonymous CredentialsOmid Mir, Balthazar Bauer, Scott Griffy, Anna Lysyanskaya et al.CCS 2023 · 29 citations
- Non-interactive Anonymous Tokens with Private Metadata BitFoteini Baldimtsi, Lucjan Hanzlik, Quan Nguyen, Aayush YadavCCS 2026 · 5 citations
- Differential Trust: Dynamic Multi-Authority Anonymous Credentials with Epoch-Weighted UpdatesChen Li, Jianting Ning, Xiulong Liu, Yulin LiuUSENIX Security 2026
- ANONYCALL: Enabling Native Private Calling in Mobile NetworksHexuan Yu, Chaoyu Zhang, Yang Xiao, Angelos D. Keromytis et al.NDSS 2026
- How to Bind Anonymous Credentials to HumansJulia Hesse, Nitin Singh, Alessandro SorniottiUSENIX Security 2023
Builds on8
- Coconut: Threshold Issuance Selective Disclosure Credentials with Applications to Distributed LedgersAlberto Sonnino, Mustafa Al-Bassam, Shehar Bano, Sarah Meiklejohn et al.NDSS 2019 · 218 citations
- fTPM: A Software-Only Implementation of a TPM ChipHimanshu Raj, Stefan Saroiu, Alec Wolman, Ronald Aigner et al.USENIX Security 2016 · 105 citations
- One TPM to Bind Them All: Fixing TPM 2.0 for Provably Secure Anonymous AttestationJan Camenisch, Liqun Chen, Manu Drijvers, Anja Lehmann et al.S&P 2017 · 58 citations
- Updatable Anonymous Credentials and Applications to Incentive SystemsJohannes Blömer, Jan Bobolz, Denis Diemert, Fabian EidensCCS 2019 · 52 citations
- Anonymous Tokens with Private Metadata BitBen Kreuter, Tancrède Lepoint, Michele Orrù, Mariana RaykovaCRYPTO 2020 · 35 citations
Related papers
- Doubly Aggregatable SignaturesGeorg Fuchsbauer, Pranav Garimidi, Joachim Neu, Guru-Vamsi Policharla et al.CCS 2026
- Server-Aided Anonymous CredentialsRutchathon Chairattana-Apirom, Franklin Harding, Anna Lysyanskaya, Stefano TessaroCRYPTO 2025 · 10 citations
- Device-Bound Anonymous Credentials With(out) Trusted HardwareKarla Friedrichs, Franklin Harding, Anja Lehmann, Anna LysyanskayaEUROCRYPT 2026 · 1 citation
- Practical UC-Secure Delegatable Credentials with Attributes and Their Application to BlockchainJan Camenisch, Manu Drijvers, Maria DubovitskayaCCS 2017 · 76 citations
- zk-creds: Flexible Anonymous Credentials from zkSNARKs and Existing Identity InfrastructureMichael Rosenberg, Jacob D. White, Christina Garman, Ian MiersS&P 2023
