Optimal tree-based one-time digital signature schemes

DOI10.1007/3-540-60922-9_30zbMath1379.68252OpenAlexW1489927927MaRDI QIDQ4593945

Ueli M. Maurer, Daniel Bleichenbacher

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

cryptographytreesdigital signature schemespartially ordered sets

Mathematics Subject Classification ID

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

Related Items (7)

LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4 ⋮ Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS\textsuperscript{+} and XMSS ⋮ A one-time signature using run-length encoding ⋮ Asymptotically Efficient Lattice-Based Digital Signatures ⋮ An Efficient Post-Quantum One-Time Signature Scheme ⋮ 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