Mitigating Multi-target Attacks in Hash-Based Signatures

DOI10.1007/978-3-662-49384-7_15zbMath1388.94092OpenAlexW2294833833MaRDI QIDQ2798784

Andreas Hülsing, Fang Song, Joost Rijneveld

Publication date: 13 April 2016

Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/155749

zbMATH Keywords

quantum query complexitypost-quantum cryptographyhash-based signaturesmulti-target attackshash function security

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (26)

On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ A Note on the Instantiability of the Quantum Random Oracle ⋮ Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ An intermediate secret-guessing attack on hash-based signatures ⋮ Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security ⋮ Classical proofs for the quantum collapsing property of classical hash functions ⋮ \textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme ⋮ Security analysis of DGM and GM group signature schemes instantiated with XMSS-T ⋮ Security analysis of the W-OTS$^+$ signature scheme: Updating security bounds ⋮ Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ Group action key encapsulation and non-interactive key exchange in the QROM ⋮ Recovering the tight security proof of SPHINCS\textsuperscript{+} ⋮ Tight adaptive reprogramming in the QROM ⋮ Machine-checked security for XMSS as in RFC 8391 and SPHINCS\textsuperscript{+} ⋮ On the security of the WOTS-PRF signature scheme ⋮ Public key compression for constrained linear signature schemes ⋮ Leighton-Micali hash-based signatures in the quantum random-oracle model ⋮ ``Oops, I did it again -- security of one-time signatures under two-message attacks ⋮ Low-communication parallel quantum multi-target preimage search ⋮ Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 ⋮ Generic authenticated key exchange in the quantum random oracle model ⋮ QCCA-secure generic key encapsulation mechanism with tighter security in the quantum random oracle model ⋮ On subset-resilient hash function families ⋮ W-OTS\textsuperscript{+} up my sleeve! A hidden secure fallback for cryptocurrency wallets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rigorous development of component-based systems using component metadata and patterns
• Understanding concurrent systems
• Tighter reachability criteria for deadlock-freedom analysis
• A higher-order characterization of probabilistic polynomial time
• Analyzing Component-Based Systems on the Basis of Architectural Constraints
• Probabilistic operational semantics for the lambda calculus
• On Equivalences, Metrics, and Polynomial Time
• A Short Introduction to Implicit Computational Complexity
• The Automatic Detection of Token Structures and Invariants Using SAT Checking
• A Proof System for Communicating Sequential Processes
• Proving the Correctness of Multiprocess Programs
• Lazy Reachability Analysis in Distributed Systems
• Linear Dependent Types and Relative Completeness
• FDR3 — A Modern Refinement Checker for CSP
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Mitigating Multi-target Attacks in Hash-Based Signatures