Towards practical lattice-based one-time linkable ring signatures

DOI10.1007/978-3-030-01950-1_18zbMath1458.94293OpenAlexW2794581866MaRDI QIDQ2218958

Huang Lin, Carsten Baum, Sabine Oechsner

Publication date: 18 January 2021

Full work available at URL: https://eprint.iacr.org/2016/997

zbMATH Keywords

discrete logarithm problemcollision-resistant hash functionheavy zero-knowledge machinery

Mathematics Subject Classification ID

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

Related Items

Compact ring signatures from learning with errors ⋮ A sub-linear lattice-based submatrix commitment scheme ⋮ One-time traceable ring signatures ⋮ Efficient lattice-based traceable ring signature scheme with its application in blockchain ⋮ A note on the post-quantum security of (ring) signatures ⋮ Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Signatures from sequential-OR proofs ⋮ Revocable hierarchical attribute-based signatures from lattices