Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions

DOI10.1007/11787006_20MaRDI QIDQ3591440zbMATH OpenOpenAlexFDO

Authors Iftach Haitner, D. Harnik, Omer Reingold

Publication date 11 September 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11787006_20

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Theory of Cryptography
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• One way functions and pseudorandom generators
• The complexity of constructing pseudorandom generators from hard functions
• A Pseudorandom Generator from any One-way Function
• scientific article; zbMATH DE number 1689047

Cited in

(16)

• The hunting of the SNARK
• Pseudorandom generators from regular one-way functions: new constructions with improved parameters
• On the complexity of constructing pseudorandom functions (especially when they don't exist)
• Simple constructions from (almost) regular one-way functions
• scientific article; zbMATH DE number 1689047 (Why is no real title available?)
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• A new pseudorandom generator from collision-resistant hash functions
• On linear-size pseudorandom generators and hardcore functions
• scientific article; zbMATH DE number 7250163 (Why is no real title available?)
• Pseudorandom generators with long stretch and low locality from random local one-way functions
• Basing Weak Public-Key Cryptography on Strong One-Way Functions
• Theory of Cryptography
• Pseudo-random generators for all hardnesses
• Paradigms for Unconditional Pseudorandom Generators
• Simple constructions from (almost) regular one-way functions
• On linear-size pseudorandom generators and hardcore functions

This page was built for publication: Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions

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