On the Power of the Randomized Iterate

DOI10.1007/11818175_2MaRDI QIDQ5756642zbMATH OpenOpenAlexFDO

Authors Iftach Haitner, D. Harnik, Omer Reingold

Publication date 4 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11818175_2

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the Power of the Randomized Iterate
• The randomized iterate, revisited -- almost linear seed length PRGs from a broader class of one-way functions
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• Theory of Cryptography
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters

Cited in

(19)

• Input locality and hardness amplification
• On the power of random greedy algorithms
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• Simple constructions from (almost) regular one-way functions
• A new pseudorandom generator from collision-resistant hash functions
• Towards non-black-box separations of public key encryption and one way function
• On the Power of the Randomized Iterate
• A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
• (Almost) optimal constructions of UOWHFs from 1-to-1, regular one-way functions and beyond
• scientific article; zbMATH DE number 2081080 (Why is no real title available?)
• 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
• Saving Private Randomness in One-Way Functions and Pseudorandom Generators
• Non-adaptive universal one-way hash functions from arbitrary one-way functions
• Simple constructions from (almost) regular one-way functions
• Counting unpredictable bits: a simple PRG from one-way functions
• A direct PRF construction from Kolmogorov complexity
• On linear-size pseudorandom generators and hardcore functions
• On the complexity of iterated shuffle

This page was built for publication: On the Power of the Randomized Iterate

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