Privacy Amplification Secure Against an Adversary with Selectable Knowledge
Robert Koenig and Ueli Maurer and Renato Renner
We introduce the concept of selectable knowledge, which models the information stored in an arbitrary (e.g., quantum mechanical) device. We then analyze a situation where an entity holds selectable knowledge about some random variable X and quantify the information she has about the output H(X) of a randomly chosen function H applied to X. This generalizes the setting of privacy amplification by universal hashing. In particular, our result can be used to prove that privacy amplification remains secure even if the enemy possesses quantum instead of classical information.