XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
From MaRDI portal
Publication:3102787
DOI10.1007/978-3-642-25405-5_8zbMath1298.94082OpenAlexW1882598960WikidataQ56700420 ScholiaQ56700420MaRDI QIDQ3102787
Andreas Hülsing, Erik Dahmen, Johannes A. Buchmann
Publication date: 25 November 2011
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25405-5_8
digital signatureprovable securityhash-based signaturesforward securitypracticalminimal security assumptions
Related Items (23)
Computational quantum key distribution (CQKD) on decentralized ledger and blockchain ⋮ An intermediate secret-guessing attack on hash-based signatures ⋮ A scalable post-quantum hash-based group signature ⋮ Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security ⋮ LMS vs XMSS: Comparison of Stateful Hash-Based Signature Schemes on ARM Cortex-M4 ⋮ Forward Secure Signatures on Smart Cards ⋮ Security analysis of DGM and GM group signature schemes instantiated with XMSS-T ⋮ WOTS-S: a quantum secure compact signature scheme for distributed ledger ⋮ WOTSwana: a generalized \(\mathcal{S}_{\mathrm{ leeve }}\) construction for multiple proofs of ownership ⋮ Tight adaptive reprogramming in the QROM ⋮ Hybrid scalar/vector implementations of Keccak and SPHINCS\textsuperscript{+} on AArch64 ⋮ Post-quantum verifiable random function from symmetric primitives in PoS blockchain ⋮ Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? ⋮ Post-quantum key exchange for the Internet and the open quantum safe project ⋮ Fast Falcon signature generation and verification using ARMv8 NEON instructions ⋮ On the security of the WOTS-PRF signature scheme ⋮ Differential Power Analysis of XMSS and SPHINCS ⋮ ``Oops, I did it again -- security of one-time signatures under two-message attacks ⋮ Post-Quantum Cryptography: State of the Art ⋮ An Efficient Post-Quantum One-Time Signature Scheme ⋮ Linicrypt: A Model for Practical Cryptography ⋮ Quantum partial search algorithm with smaller oracles for multiple target items ⋮ On subset-resilient hash function families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Security of the Winternitz One-Time Signature Scheme
- Keying Hash Functions for Message Authentication
- Merkle Tree Traversal Revisited
- Digital Signatures Out of Second-Preimage Resistant Hash Functions
- Merkle Signatures with Virtually Unlimited Signature Capacity
- Hash-based Digital Signature Schemes
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Pseudorandom Generator from any One-way Function
- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
- Optimal tree-based one-time digital signature schemes
- Advances in Cryptology - EUROCRYPT 2004
- CMSS – An Improved Merkle Signature Scheme
- Fast Software Encryption
- Cryptography and Coding
- Selecting cryptographic key sizes
This page was built for publication: XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions