153
click to vote
FSTTCS
2009
Springer
16 years 10 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...
173
click to vote
ACNS
2009
Springer
16 years 11 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...
122
click to vote
FOCS
2009
IEEE
16 years 15 days ago
2009
IEEE
We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction.