Sciweavers

Share
FSTTCS
2009
Springer
10 years 6 months ago
Kolmogorov Complexity in Randomness Extraction
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandra...
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
10 years 6 months ago
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
Yvonne Cliff, Colin Boyd, Juan Manuel Gonzá...
FOCS
2009
IEEE
10 years 6 months ago
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction.
Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madh...
books