Sparse pseudorandom distributions

DOI10.1002/RSA.3240030206MaRDI QIDQ3990219zbMATH OpenOpenAlexFDO

Authors Oded Goldreich, Hugo Krawczyk

Publication date 28 June 1992

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.1076

zbMATH Keywords

probabilistic polynomial-time algorithmssparse pseudorandom distributions

Mathematics Subject Classification ID

Distribution theory (60E99) Stochastic processes (60G99)

Recommendations

• scientific article; zbMATH DE number 4186980
• scientific article; zbMATH DE number 1670863
• A primer on pseudorandom generators
• Hardness vs randomness
• Some consequences of the existnce of pseudorandom generators

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• One way functions and pseudorandom generators
• Probability Inequalities for Sums of Bounded Random Variables

Cited in

(9)

• Computational indistinguishability: algorithms vs. circuits
• Non-interactive proofs of proximity
• On the universal steganography of optimal rate
• Composition of zero-knowledge proofs with efficient provers
• Pseudorandom generators and the frequency of simplicity
• Pseudodeterministic constructions in subexponential time
• scientific article; zbMATH DE number 4186980 (Why is no real title available?)
• Unconditionally secure quantum commitments with preprocessing
• Unconditionally secure commitments with quantum auxiliary inputs

This page was built for publication: Sparse pseudorandom distributions

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