Amplifying Privacy in Privacy Amplification

@inproceedings{Aggarwal2013AmplifyingPI,
  title={Amplifying Privacy in Privacy Amplification},
  author={Divesh Aggarwal and Yevgeniy Dodis and Zahra Jafargholi and Eric Miles and Leonid Reyzin},
  booktitle={IACR Cryptology ePrint Archive},
  year={2013}
}
We study the classical problem of privacy amplification, where two parties Alice and Bob share a weak secret X of min-entropy k, and wish to agree on secret key R of length m over a public communication channel completely controlled by a computationally unbounded attacker Eve. Despite being extensively studied in the literature, the problem of designing “optimal” efficient privacy amplification protocols is still open, because there are several optimization goals. The first of them is (1… CONTINUE READING