Non-adaptive universal one-way hash functions from arbitrary one-way functions
From MaRDI portal
Publication:6061531
DOI10.1007/978-3-031-30634-1_17zbMath1528.94071MaRDI QIDQ6061531
Noam Mazor, Unnamed Author, Jiapeng Zhang
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Multi-collision resistant hash functions and their applications
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Unifying computational entropies via Kullback-Leibler divergence
- Locally computable UOWHF with linear shrinkage
- Simple constructions from (almost) regular one-way functions
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
- UOWHFs from OWFs: Trading Regularity for Efficiency
- Candidate One-Way Functions Based on Expander Graphs
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond
- Universal One-Way Hash Functions via Inaccessible Entropy
- A Pseudorandom Generator from any One-way Function
- A Cookbook for Black-Box Separations and a Recipe for UOWHFs
- The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions
- Inaccessible entropy
- Multi-collision resistance: a paradigm for keyless hash functions
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Bounds on the Efficiency of Generic Cryptographic Constructions
- On the Power of the Randomized Iterate
- Cryptography in $NC^0$
- Collision-resistance from multi-collision-resistance
This page was built for publication: Non-adaptive universal one-way hash functions from arbitrary one-way functions
