FSTTCS
2009
Springer
15 years 21 days ago
2009
Springer
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...
ACNS
2009
Springer
15 years 23 days ago
2009
Springer
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...
FOCS
2009
IEEE
15 years 27 days ago
2009
IEEE
We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction.