Tiny families of functions with random properties: A quality-size trade-off for hashing

DOI<315::AID-RSA3>3.0.CO;2-1 10.1002/(SICI)1098-2418(199712)11:4<315::AID-RSA3>3.0.CO;2-1zbMath0891.60010OpenAlexW2136616826MaRDI QIDQ4372785

Oded Goldreich, Avi Wigderson

Publication date: 19 July 1998

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199712)11:4<315::aid-rsa3>3.0.co;2-1

zbMATH Keywords

mixing propertyexplicit constructions of hash functionsextraction property

Mathematics Subject Classification ID

Related Items (15)

Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Unnamed Item ⋮ Optimal heuristic algorithms for the image of an injective function ⋮ Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs ⋮ How to get more mileage from randomness extractors ⋮ Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs ⋮ Preserving Randomness for Adaptive Algorithms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extracting all the randomness and reducing the error in Trevisan's extractors ⋮ A Sample of Samplers: A Computational Perspective on Sampling ⋮ Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly ⋮ Better short-seed quantum-proof extractors

This page was built for publication: Tiny families of functions with random properties: A quality-size trade-off for hashing