Sparse pseudorandom distributions

DOI10.1002/rsa.3240030206zbMath0742.60020OpenAlexW2130993035MaRDI QIDQ3990219

Hugo Krawczyk, Oded Goldreich

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

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

Related Items (4)

Computational indistinguishability: algorithms vs. circuits ⋮ On the universal steganography of optimal rate ⋮ Non-interactive proofs of proximity ⋮ Composition of Zero-Knowledge Proofs with Efficient Provers

Cites Work

• Unnamed Item
• One way functions and pseudorandom generators
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Sparse pseudorandom distributions