Optimal tree-based one-time digital signature schemes

DOI10.1007/3-540-60922-9_30MaRDI QIDQ4593945zbMATH OpenOpenAlexFDO

Authors Daniel Bleichenbacher, Ueli M. Maurer

Publication date 16 November 2017

Published in STACS 96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60922-9_30

zbMATH Keywords

treescryptographypartially ordered setsdigital signature schemes

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Combinatorics of partially ordered sets (06A07) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1759322
• Publication:4940683
• Short Transitive Signatures for Directed Trees
• How to construct optimal one-time signatures.
• scientific article; zbMATH DE number 1153451

Cited in

(7)

• LMS vs XMSS: comparison of stateful hash-based signature schemes on ARM Cortex-M4
• Asymptotically Efficient Lattice-Based Digital Signatures
• A one-time signature using run-length encoding
• An efficient post-quantum one-time signature scheme
• Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS\textsuperscript{+} and XMSS
• XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
• How to sign digital streams

This page was built for publication: Optimal tree-based one-time digital signature schemes

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