Shorter hash-based signatures using forced pruning
From MaRDI portal
Cites work
- Analysis of a proposed hash-based signature standard
- At the top of the hypercube -- better size-time tradeoffs for hash-based signatures
- Better than BiBa: Short one-time signatures with fast signing and verifying
- Cryptography and Coding
- scientific article; zbMATH DE number 3877077 (Why is no real title available?)
- scientific article; zbMATH DE number 4035726 (Why is no real title available?)
- Improving stateless hash-based signatures
- Multiple-time signature schemes against adaptive chosen message attacks
- On the security of the Winternitz one-time signature scheme
- Recovering the tight security proof of SPHINCS\textsuperscript{+}
- Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS\textsuperscript{+} and XMSS
- SPHINCS: practical stateless hash-based signatures
- W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
This page was built for publication: Shorter hash-based signatures using forced pruning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7447198)