An Efficient Self-blindable Attribute-Based Credential Scheme

DOI10.1007/978-3-319-70972-7_1zbMath1457.94176OpenAlexW2776666643MaRDI QIDQ5854421

Jaap-Henk Hoepman, Sietse Ringers, Eric R. Verheul

Publication date: 17 March 2021

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-70972-7_1

zbMATH Keywords

elliptic curvesbilinear pairingsattribute-based credentialsself-blindableunlinkable

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Issuer-hiding attribute-based credentials ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system ⋮ Breaking and Fixing Anonymous Credentials for the Cloud

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairings for cryptographers
• Improved algebraic MACs and practical keyed-verification anonymous credentials
• Short signatures without random oracles and the SDH assumption in bilinear groups
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• On the Security of One-Witness Blind Signature Schemes
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Constant-Size Dynamic k-TAA
• Practical Short Signature Batch Verification
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Batch Verification of Short Signatures
• Selecting cryptographic key sizes

This page was built for publication: An Efficient Self-blindable Attribute-Based Credential Scheme