The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes

DOI10.1007/3-540-36178-2_24zbMath1065.94563OpenAlexW1917159157MaRDI QIDQ4412810

Daniele Micciancio, Alejandro Hevia

Publication date: 16 July 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36178-2_24

zbMATH Keywords

algebraic signature schemesgraph based signatures

Mathematics Subject Classification ID

Applications of graph theory (05C90) Authentication, digital signatures and secret sharing (94A62)

Related Items (10)

A new definition of homomorphic signature for identity management in mobile cloud computing ⋮ Asymptotically efficient lattice-based digital signatures ⋮ Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS\textsuperscript{+} and XMSS ⋮ A simple transitive signature scheme for directed trees ⋮ On the Security of the Winternitz One-Time Signature Scheme ⋮ Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures ⋮ Asymptotically Efficient Lattice-Based Digital Signatures ⋮ XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions ⋮ The Symbiosis between Collision and Preimage Resistance ⋮ Computing on authenticated data

This page was built for publication: The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes