Hashing a Source With an Unknown


R enyi entropy of order 2 characterizes how many almost uniform random bits can be extracted from a distribution by universal hashing by a technique known as \privacy ampliication" in cryptography. We generalize this result and show that if P S is the assumed distribution of a random variable with true distribution P X , then the amount of extractable… (More)


Cite this paper

@inproceedings{Cachin1998HashingAS, title={Hashing a Source With an Unknown}, author={Christian Cachin}, year={1998} }