Revisiting linkable ring signatures with logarithmic verification complexity

DOI10.1007/978-3-032-26737-5_17MaRDI QIDQ7390895zbMATH OpenFDO

Authors Danai Balla, Pyrros Chaidos

Publication date 2026

Full work available at URL https://doi.org/10.1007/978-3-032-26737-5_17

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Advances in Cryptology – CRYPTO 2004
• Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
• Designated-verifier linkable ring signatures with unconditional anonymity
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• DualDory: logarithmic-verifier linkable ring signatures through preprocessing
• DualRing: generic construction of ring signatures with efficient instantiations
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 2081086 (Why is no real title available?)
• Information Security and Privacy
• Information Security Practice and Experience
• One-out-of-many proofs: or how to leak a secret and spend a coin
• Ring signatures: logarithmic-size, no setup -- from standard assumptions
• RingCT 3.0 for blockchain confidential transaction: shorter size and stronger security
• Structure-preserving signatures and commitments to group elements

This page was built for publication: Revisiting linkable ring signatures with logarithmic verification complexity

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