Concurrent Security of Anonymous Credentials Light, Revisited
Open Access
- 15 November 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 45-59
Abstract
We revisit the concurrent security guarantees of the well-known Anonymous Credentials Light (ACL) scheme (Baldimtsi and Lysyanskaya, CCS'13). This scheme was originally proven secure when executed sequentially, and its concurrent security was left as an open problem. A later work of Benhamouda et al. (EUROCRYPT'21) gave an efficient attack on ACL when executed concurrently, seemingly resolving this question once and for all. In this work, we point out a subtle flaw in the attack of Benhamouda et al. on ACL and show, in spite of popular opinion, that it can be proven concurrently secure. Our modular proof in the algebraic group model uses an ID scheme as an intermediate step and leads to a major simplification of the complex security argument for Abe's Blind Signature scheme by Kastner et al. (PKC'22).Keywords
This publication has 48 references indexed in Scilit:
- On the Security of One-Witness Blind Signature Schemes2013
- Randomizable Proofs and Delegatable Anonymous Credentials2009
- Signature Schemes and Anonymous Credentials from Bilinear Maps2004
- Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks2004
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme2002
- A Generalized Birthday Problem2002
- GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks2002
- Lower Bounds for Discrete Logarithms and Related Problems1997
- Security of blind digital signatures1997
- Zero-knowledge proofs of identityJournal of Cryptology, 1988