C. H. Bennett and G. Brassard, Quantum Cryptography, Scientific American, vol.267, issue.4, pp.175-179, 1984.
DOI : 10.1038/scientificamerican1092-50

A. K. Ekert, Quantum cryptography based on Bell???s theorem, Physical Review Letters, vol.67, issue.6, pp.661-663, 1991.
DOI : 10.1103/PhysRevLett.67.661

G. Brassard and L. Salvail, Secret-key reconciliation by public discussion, EURO- CRYPT '93, LNCS, vol.765, pp.410-423, 1994.
DOI : 10.1007/3-540-48285-7_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.9686

C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer, Generalized privacy amplification, IEEE Transactions on Information Theory, vol.41, issue.6, pp.1915-1923, 1995.
DOI : 10.1109/18.476316
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.649.8666

Y. Watanabe, Privacy amplification for quantum key distribution, Journal of Physics A: Mathematical and Theoretical, vol.40, issue.3, pp.99-104, 2007.
DOI : 10.1088/1751-8113/40/3/F03

R. Renner and R. König, Universally Composable Privacy Amplification Against Quantum Adversaries, Lecture Notes in Computer Science, vol.3378, pp.407-425, 2005.
DOI : 10.1007/978-3-540-30576-7_22
URL : http://arxiv.org/abs/quant-ph/0403133

D. Zou, B. Zhao, C. Wu, B. Liu, W. Yu et al., CLIP: A Distributed Emulation Platform for Research on Information Reconciliation, 2012 15th International Conference on Network-Based Information Systems, pp.721-726
DOI : 10.1109/NBiS.2012.56

N. Chandran, B. Kanukurthi, R. Ostrovsky, and L. Reyzin, Privacy amplification with asymptotically optimal entropy loss, Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, pp.785-794, 2010.
DOI : 10.1145/2630064
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.8873

Y. Dodis and D. Wichs, Non-malleable extractors and symmetric key cryptography from weak secrets, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, p.601610, 2009.
DOI : 10.1145/1536414.1536496
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.6994

T. Horvá-th, L. B. Kish, and J. Scheuer, Effective privacy amplification for secure classical communications, pp.28002-28007, 2011.

Y. Mansour, N. Nisan, and P. Tiwari, The computational complexity of universal hashing, Theoretical Computer Science, vol.107, issue.1, pp.121-133, 1993.
DOI : 10.1016/0304-3975(93)90257-T

H. Krawczyk, LFSR-based Hashing and Authentication, Lecture Notes in Computer Science, vol.839, pp.129-139, 1994.
DOI : 10.1007/3-540-48658-5_15

C. Fung, X. Ma, and H. F. Chau, Practical issues in quantum-key-distribution postprocessing, Physical Review A, vol.81, issue.1, p.12318, 2010.
DOI : 10.1103/PhysRevA.81.012318
URL : http://arxiv.org/abs/0910.0312