Recovering the tight security proof of SPHINCS\textsuperscript{+}

DOI10.1007/978-3-031-22972-5_1MaRDI QIDQ6133961zbMATH OpenOpenAlexFDO

Authors Andreas Hülsing, Mikhail Kudinov

Publication date 21 August 2023

Published in Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22972-5_1

zbMATH Keywords

hash functionspost-quantum cryptographyhash-based signaturesundetectabilityPRFSPHINCS\textsuperscript{+}W-OTSWOTS-TW

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the security of \textsf{TrCBC}
• On tight security proofs for Schnorr signatures
• On tight security proofs for Schnorr signatures
• scientific article; zbMATH DE number 1759276
• Towards provable security of Rijndael-like SPN ciphers against differential attacks
• Tighter proofs for the SIGMA and TLS 1.3 key exchange protocols
• Security analysis of \textit{SPAKE2+}
• Beyond \(2^{c/2}\) security in sponge-based authenticated encryption modes
• Reasoning about cryptographic protocols in the spi calculus
• SPVT: an efficient verification tool for security protocols

Cites work

• scientific article; zbMATH DE number 5076264 (Why is no real title available?)
• (Tightly) QCCA-secure key-encapsulation mechanism in the quantum random oracle model
• Cryptography and Coding
• Decisional second-preimage resistance: when does SPR imply PRE?
• Mitigating multi-target attacks in hash-based signatures
• Recovering the tight security proof of SPHINCS\textsuperscript{+}
• Secure identity-based encryption in the quantum random oracle model
• W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes

Cited in

(10)

• On the security of the WOTS-PRF signature scheme
• Tweakable $$\mathcal {S}_{\text{ leeve }}$$: A Novel $$\mathcal {S}_{\text{ leeve }}$$ Construction Based on Tweakable Hash Functions
• Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256
• On forging SPHINCS\textsuperscript{+}-Haraka signatures on a fault-tolerant quantum computer
• On the security of \textsf{TrCBC}
• Machine-checked security for XMSS as in RFC 8391 and SPHINCS\textsuperscript{+}
• Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS\textsuperscript{+} and XMSS
• Recovering the tight security proof of SPHINCS\textsuperscript{+}
• Quantum-access security of hash-based signature schemes
• Security analysis of \textit{SPAKE2+}

This page was built for publication: Recovering the tight security proof of SPHINCS\textsuperscript{+}

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