Simple constructions from (almost) regular one-way functions
From MaRDI portal
Publication:2697872
DOI10.1007/978-3-030-90453-1_16OpenAlexW3201864024MaRDI QIDQ2697872
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90453-1_16
Related Items (3)
Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ Paradigms for Unconditional Pseudorandom Generators
Cites Work
- Unifying computational entropies via Kullback-Leibler divergence
- Pseudorandom generators from regular one-way functions: new constructions with improved parameters
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
- UOWHFs from OWFs: Trading Regularity for Efficiency
- 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
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
- A Pseudorandom Generator from any One-way Function
- On the Existence of Pseudorandom Generators
- 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
- The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Bounds on the Efficiency of Generic Cryptographic Constructions
- On the Power of the Randomized Iterate
- Theory of Cryptography
This page was built for publication: Simple constructions from (almost) regular one-way functions
