On subset-resilient hash function families
type: Item
instance of: scholarly article
title: On subset-resilient hash function families
zbMATH Open document ID: 1485.94152
author: Quan Yuan
author: Mehdi Tibouchi
author: Masayuki Abe
published in: Designs, Codes and Cryptography
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 81P94
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 7494011
zbMATH Keywords: subset resilience
zbMATH Keywords: hash functions
zbMATH Keywords: quantum attacks
zbMATH Keywords: distributional collision resistance
zbMATH Keywords: black-box separation
zbMATH Keywords: hash-based signature schemes
Wikidata QID: Q114849794
describes a project that uses: SPHINCS
MaRDI profile type: Publication
full work available at URL: s10623-022-01008-4
OpenAlex ID: W4210407100
cites work: Quantum lower bounds for the collision and the element distinctness problems
cites work: Quantum Walk Algorithm for Element Distinctness
cites work: Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
cites work: Improving stateless hash-based signatures
cites work: Multi-collision resistant hash functions and their applications
cites work: SPHINCS: Practical Stateless Hash-Based Signatures
cites work: Distributional collision resistance beyond one-way functions
cites work: Multi-collision resistance: a paradigm for keyless hash functions
cites work: Quantum cryptanalysis of hash and claw-free functions
cites work: XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
cites work: An efficient quantum collision search algorithm and implications on symmetric cryptography
cites work: Q3792624
cites work: On the randomness complexity of efficient sampling
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: Bounds on the Efficiency of Generic Cryptographic Constructions
cites work: Q4228473
cites work: Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
cites work: Short Signatures from Weaker Assumptions
cites work: Quantum multicollision-finding algorithm
cites work: Mitigating Multi-target Attacks in Hash-Based Signatures
cites work: Q5750403
cites work: On distributional collision resistant hashing
cites work: Collision resistant hashing for paranoids: dealing with multiple collisions
cites work: On finding quantum multi-collisions
cites work: Selected Areas in Cryptography
cites work: Q4412971
cites work: Q4249649
cites work: Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security
cites work: Short one-time signatures
DOI: 10.1007/S10623-022-01008-4
description: scientific article; zbMATH DE number 7494011