Server-aided anonymous credentials

DOI10.1007/978-3-032-01887-8_10MaRDI QIDQ6866573zbMATH OpenFDO

Authors Rutchathon Chairattana-Apirom, Franklin Harding, Anna Lysyanskaya, Stefano Tessaro

Publication date 28 January 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01887-8_10

zbMATH Keywords

keyed-verification anonymous credentials

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Constant-Size Dynamic k-TAA
• Formal treatment of privacy-enhancing credential systems
• scientific article; zbMATH DE number 1722673 (Why is no real title available?)
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 1952906 (Why is no real title available?)
• Improved algebraic MACs and practical keyed-verification anonymous credentials
• Improved straight-line extraction in the random oracle model with applications to signature aggregation
• Oblivious issuance of proofs
• On the (in)security of ROS
• On the impossibility of purely algebraic signatures
• Pairing-free blind signatures from CDH assumptions
• Revisiting BBS signatures
• Server-aided anonymous credentials
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Zero-knowledge proofs of knowledge for group homomorphisms

Cited in

(2)

• Server-aided anonymous credentials
• Device-bound anonymous credentials with(out) trusted hardware

This page was built for publication: Server-aided anonymous credentials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866573)