Doubly Aggregatable Signatures
Georg Fuchsbauer, Pranav Garimidi, Joachim Neu, Guru-Vamsi Policharla, Max Resnick, Ertem Nusret Tas
Abstract
Attribute-based anonymous credentials offer users fine-grained access control in a privacy-preserving manner. However, in such schemes obtaining a user's credentials requires knowledge of the issuer's public key, which obviously reveals the issuer's identity that must be hidden from users in certain scenarios. Moreover, verifying a user's credentials also requires the knowledge of issuer's public key, which may infer the user's private information from their choice of issuer. In this article, we introduce the notion of double issuer-hiding attribute-based credentials (<inline-formula><tex-math notation="LaTeX"></tex-math><alternatives>mml:math<mml:mi mathvariant="sans-serif">DIHAC</mml:mi></mml:math><inline-graphic xlink:href="yang-ieq1-3314019.gif"/></alternatives></inline-formula>) to tackle these two problems. In our model, a central authority can issue public-key credentials for a group of issuers, and users can obtain attribute-based credentials from one of the issuers without knowing which one it is. Then, a user can prove that their credential was issued by one of the authenticated issuers without revealing which one to a verifier. We provide a generic construction, as well as a concrete instantiation for <inline-formula><tex-math notation="LaTeX"></tex-math><alternatives>mml:math<mml:mi mathvariant="sans-serif">DIHAC</mml:mi></mml:math><inline-graphic xlink:href="yang-ieq2-3314019.gif"/></alternatives></inline-formula> based on structure-preserving signatures on equivalence classes (JOC's 19) and a novel primitive which we call <inline-formula><tex-math notation="LaTeX"></tex-math><alternatives>mml:mathmml:mrowmml:mit</mml:mi>mml:mia</mml:mi>mml:mig</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="yang-ieq3-3314019.gif"/></alternatives></inline-formula>-<inline-formula><tex-math notation="LaTeX"></tex-math><alternatives>mml:mathmml:mrowmml:mib</mml:mi>mml:mia</mml:mi>mml:mis</mml:mi>mml:mie</mml:mi>mml:mid</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="yang-ieq4-3314019.gif"/></alternatives></inline-formula> <inline-formula><tex-math notation="LaTeX"></tex-math><alternatives>mml:mathmml:mrowmml:mia</mml:mi>mml:mig</mml:mi>mml:mig</mml:mi>mml:mir</mml:mi>mml:mie</mml:mi>mml:mig</mml:mi>mml:mia</mml:mi>mml:mit</mml:mi>mml:mia</mml:mi>mml:mib</mml:mi>mml:mil</mml:mi>mml:mie</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="yang-ieq5-3314019.gif"/></alternatives></inline-formula> <inline-formula><tex-math notation="LaTeX"></tex-math><alternatives>mml:mathmml:mrowmml:mim</mml:mi>mml:mie</mml:mi>mml:mir</mml:mi>mml:mic</mml:mi>mml:miu</mml:mi>mml:mir</mml:mi>mml:mii</mml:mi>mml:mia</mml:mi>mml:mil</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="yang-ieq6-3314019.gif"/></alternatives></inline-formula> <inline-formula><tex-math notation="LaTeX"></tex-math><alternatives>mml:mathmml:mrowmml:mis</mml:mi>mml:mii</mml:mi>mml:mig</mml:mi>mml:min</mml:mi>mml:mia</mml:mi>mml:mit</mml:mi>mml:miu</mml:mi>mml:mir</mml:mi>mml:mie</mml:mi>mml:mis</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="yang-ieq7-3314019.gif"/></alternatives></inline-formula>. Our construction is efficient without relying on zero-knowledge proofs. We provide rigorous evaluations on personal laptop and smartphone platforms, respectively, to demonstrate its practicability.
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 85ca15dc-d7f1-4a99-9a32-5c3f46817855Builds on9
- Fractal: Post-quantum and Transparent Recursive Proofs from HolographyAlessandro Chiesa, Dev Ojha, Nicholas SpoonerEUROCRYPT 2020 · 162 citations
- MuSig2: Simple Two-Round Schnorr Multi-signaturesJonas Nick, Tim Ruffing, Yannick SeurinCRYPTO 2021 · 147 citations
- Halo Infinite: Proof-Carrying Data from Additive Polynomial CommitmentsDan Boneh, Justin Drake, Ben Fisch, Ariel GabizonCRYPTO 2021 · 62 citations
- Threshold and Multi-signature Schemes from Linear Hash FunctionsStefano Tessaro, Chenzhi ZhuEUROCRYPT 2023 · 48 citations
- hinTS: Threshold Signatures with Silent SetupSanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha et al.S&P 2024 · 48 citations
Related papers
- 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
- With a Little Help from My Friends: Constructing Practical Anonymous CredentialsLucjan Hanzlik, Daniel SlamanigCCS 2021 · 52 citations
- Practical UC-Secure Delegatable Credentials with Attributes and Their Application to BlockchainJan Camenisch, Manu Drijvers, Maria DubovitskayaCCS 2017 · 76 citations
- Ring Referral: Efficient Publicly Verifiable Ad hoc Credential Scheme with Issuer and Strong User Anonymity for Decentralized Identity and MoreThe-Anh Ta, Xiangyu Hui, Sid Chi-Kin ChauS&P 2025
- zk-creds: Flexible Anonymous Credentials from zkSNARKs and Existing Identity InfrastructureMichael Rosenberg, Jacob D. White, Christina Garman, Ian MiersS&P 2023
