On the Power of the Randomized Iterate

DOI10.1007/11818175_2zbMath1161.94402OpenAlexW1482558212MaRDI QIDQ5756642

Omer Reingold, Danny Harnik, Iftach Haitner

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)

Related Items (9)

A New Pseudorandom Generator from Collision-Resistant Hash Functions ⋮ (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond ⋮ Towards Non-Black-Box Separations of Public Key Encryption and One Way Function ⋮ Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ Input locality and hardness amplification ⋮ Simple constructions from (almost) regular one-way functions ⋮ Pseudorandom generators from regular one-way functions: new constructions with improved parameters ⋮ On linear-size pseudorandom generators and hardcore functions ⋮ A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch

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