Efficient redactable signature and application to anonymous credentials

DOI10.1007/978-3-030-45388-6_22zbMath1481.94147OpenAlexW3023180901MaRDI QIDQ2055711

Olivier Sanders

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-45388-6_22

zbMATH Keywords

anonymous credentials systemconstant-size redactable signature scheme

Mathematics Subject Classification ID

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

Related Items (11)

Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Ring Trapdoor Redactable Signatures from Lattice ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Traceable constant-size multi-authority credentials ⋮ Traceable constant-size multi-authority credentials ⋮ Pointcheval-Sanders signature-based synchronized aggregate signature ⋮ Attribute-based anonymous credential: optimization for single-use and multi-use ⋮ Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs ⋮ Efficient redactable signature and application to anonymous credentials ⋮ Improving revocation for group signature with redactable signature ⋮ Updatable signatures and message authentication codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairings for cryptographers
• Efficient redactable signature and application to anonymous credentials
• On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
• Short Randomizable Signatures
• A Storage Efficient Redactable Signature in the Standard Model
• Practical Round-Optimal Blind Signatures in the Standard Model
• Constant-Size Dynamic k-TAA
• Redactable Signatures for Tree-Structured Data: Definitions and Constructions
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Advances in Cryptology – CRYPTO 2004
• Pairing-Friendly Elliptic Curves of Prime Order
• Topics in Cryptology – CT-RSA 2005

This page was built for publication: Efficient redactable signature and application to anonymous credentials