On subset-resilient hash function families

DOI10.1007/S10623-022-01008-4MaRDI QIDQ2115743zbMATH OpenOpenAlexWikidataFDO

Authors Quan Yuan, Mehdi Tibouchi, Masayuki Abe

Publication date 21 March 2022

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10623-022-01008-4

zbMATH Keywords

hash functionsblack-box separationquantum attackshash-based signature schemesdistributional collision resistancesubset resilience

Mathematics Subject Classification ID

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

Recommendations

• Public Key Cryptography - PKC 2006
• Cryptanalysis of a hash function, and the modular subset sum problem
• On quantum \((\delta,\varepsilon)\)-resistant hashing
• On distributional collision resistant hashing
• Post-quantum security of the sponge construction

Cites work

• scientific article; zbMATH DE number 4057439 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• scientific article; zbMATH DE number 1950338 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• An efficient quantum collision search algorithm and implications on symmetric cryptography
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Collision resistant hashing for paranoids: dealing with multiple collisions
• Distributional collision resistance beyond one-way functions
• Families of finite sets in which no set is covered by the union of \(r\) others
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Hash-based signatures revisited: a dynamic FORS with adaptive chosen message security
• Improving stateless hash-based signatures
• Limits on the power of indistinguishability obfuscation and functional encryption
• Mitigating multi-target attacks in hash-based signatures
• Multi-collision resistance: a paradigm for keyless hash functions
• Multi-collision resistant hash functions and their applications
• On distributional collision resistant hashing
• On finding quantum multi-collisions
• On the randomness complexity of efficient sampling
• Quantum Walk Algorithm for Element Distinctness
• Quantum cryptanalysis of hash and claw-free functions
• Quantum lower bounds for the collision and the element distinctness problems
• Quantum multicollision-finding algorithm
• SPHINCS: practical stateless hash-based signatures
• Selected Areas in Cryptography
• Short one-time signatures
• Short signatures from weaker assumptions
• XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions

Cited in

(2)

• d-k-min-wise independent family of hash functions
• Quantum-access security of hash-based signature schemes

Describes a project that uses

Uses Software

• SPHINCS

This page was built for publication: On subset-resilient hash function families

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