Simple constructions from (almost) regular one-way functions

DOI10.1007/978-3-030-90453-1_16MaRDI QIDQ2697872zbMATH OpenOpenAlexFDO

Authors Noam Mazor, Jiapeng Zhang

Publication date 13 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90453-1_16

zbMATH Keywords

pseudorandom generatoruniversal one-way hash function

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• The randomized iterate, revisited -- almost linear seed length PRGs from a broader class of one-way functions
• (Almost) optimal constructions of UOWHFs from 1-to-1, regular one-way functions and beyond
• The generalized randomized iterate and its application to new efficient constructions of uowhfs from regular one-way functions

Cites work

• (Almost) optimal constructions of UOWHFs from 1-to-1, regular one-way functions and beyond
• A cookbook for black-box separations and a recipe for UOWHFs
• A Pseudorandom Generator from any One-way Function
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Inaccessible entropy
• On the Existence of Pseudorandom Generators
• On the Power of the Randomized Iterate
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• The generalized randomized iterate and its application to new efficient constructions of uowhfs from regular one-way functions
• The randomized iterate, revisited -- almost linear seed length PRGs from a broader class of one-way functions
• Theory of Cryptography
• Unifying computational entropies via Kullback-Leibler divergence
• Universal one-way hash functions via inaccessible entropy
• UOWHFs from OWFs: trading regularity for efficiency

Cited in

(12)

• On the complexity of constructing pseudorandom functions (especially when they don't exist)
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• (Almost) optimal constructions of UOWHFs from 1-to-1, regular one-way functions and beyond
• A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module
• The generalized randomized iterate and its application to new efficient constructions of uowhfs from regular one-way functions
• scientific article; zbMATH DE number 7310111 (Why is no real title available?)
• The randomized iterate, revisited -- almost linear seed length PRGs from a broader class of one-way functions
• 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
• Simple constructions from (almost) regular one-way functions
• Counting unpredictable bits: a simple PRG from one-way functions

This page was built for publication: Simple constructions from (almost) regular one-way functions

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