Simple constructions from (almost) regular one-way functions

DOI10.1007/S00145-024-09507-4zbMATH Open1543.94749MaRDI QIDQ6570527

Jiapeng Zhang, Noam Mazor

Publication date: 10 July 2024

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

pseudorandom generatorone-way functionnon-adaptiveuniversal one-way hash functionunknown-regular function

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

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

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