On subset-resilient hash function families

DOI10.1007/s10623-022-01008-4zbMath1485.94152OpenAlexW4210407100WikidataQ114849794 ScholiaQ114849794MaRDI QIDQ2115743

Mehdi Tibouchi, Quan Yuan, Masayuki Abe

Publication date: 21 March 2022

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

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

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

Uses Software

• SPHINCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short one-time signatures
• Families of finite sets in which no set is covered by the union of \(r\) others
• Multi-collision resistant hash functions and their applications
• Collision resistant hashing for paranoids: dealing with multiple collisions
• Quantum multicollision-finding algorithm
• An efficient quantum collision search algorithm and implications on symmetric cryptography
• On distributional collision resistant hashing
• Improving stateless hash-based signatures
• On finding quantum multi-collisions
• Distributional collision resistance beyond one-way functions
• Mitigating Multi-target Attacks in Hash-Based Signatures
• On the randomness complexity of efficient sampling
• SPHINCS: Practical Stateless Hash-Based Signatures
• Short Signatures from Weaker Assumptions
• XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
• Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
• Quantum lower bounds for the collision and the element distinctness problems
• Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security
• Multi-collision resistance: a paradigm for keyless hash functions
• Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
• Quantum Walk Algorithm for Element Distinctness
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Selected Areas in Cryptography
• Quantum cryptanalysis of hash and claw-free functions

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