Home > Resources > papers > BBDT16-KVAC
Improved Algebraic MACs and Practical Keyed-Verification Anonymous Credentials (Barki, Brunet, Desmoulins, Traoré 2016)¶
Last modified: 2026-10-27
Summary¶
Presents a new algebraic MAC derived from BBS+ and builds keyed-verification anonymous credentials (where issuer and verifier share a key) with presentation proofs that are cheaper than prior KVAC schemes and need no pairings (SAC 2016). Also proves the security of a more efficient BBS+ variant, which is why it is cited by the IRTF BBS draft. The same Orange group later designed BBS#.
Related resources¶
- Algebraic MACs and Keyed-Verification Anonymous Credentials (Chase, Meiklejohn, Zaverucha 2014) (paper, 2014)
- Anonymous Attestation Using the Strong Diffie Hellman Assumption Revisited (Camenisch, Drijvers, Lehmann 2016) (paper, 2016)
- Revisiting BBS Signatures (Tessaro, Zhu 2023) (paper, 2023)
- Revisiting Keyed-Verification Anonymous Credentials (Orrù 2025) (paper, 2025)
- Server-Aided Anonymous Credentials (Chairattana-Apirom, Harding, Lysyanskaya, Tessaro 2025) (paper, 2025)
- Short Group Signatures (Boneh, Boyen, Shacham 2004) (paper, 2004)
- The BBS# protocol: Technical details (Orange 2024) (paper, 2024)