Simple and tight bounds for information reconciliation and privacy amplification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3788 LNCS, Issue , 2005, Pages 199-216

  Renner, Renato ^a   Wolf, Stefan ^b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Data compression; Entropy measures; Information reconciliation; Information theoretic cryptography; Privacy amplification; Quantum key agreement; Randomness extraction

Indexed keywords

BOUNDARY CONDITIONS; DATA COMPRESSION; DATA PRIVACY; ENTROPY; RANDOM PROCESSES;

ENTROPY MEASURES; INFORMATION RECONCILIATION; INFORMATION-THEORETIC CRYPTOGRAPHY; PRIVACY AMPLIFICATION; QUANTUM KEY AGREEMENT; RANDOMNESS EXTRACTION;

INFORMATION ANALYSIS;

EID: 33646767482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593447_11     Document Type: Conference Paper

References (23)

1. C. H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, pp. 175-179. IEEE, 1984.
2. C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer, Generalized privacy amplification, IEEE Transactions on Information Theory, Vol. 41, No. 6, 1915-1923, 1995.
3. C. H. Bennett, G. Brassard, and J. M. Robert, Privacy amplification by public discussion. SIAM Journal on Computing, Vol. 17, pp. 210-229, 1988.
4. G. Brassard and L. Salvail, Secret-key reconciliation by public discussion, EUROCRYPT '93, LNCS, Vol. 765, pp. 410-423. Springer-Verlag, 1994.
5. C. Cachin, Smooth entropy and Rényi entropy, EUROCRYPT '97, LNCS, Vol. 1233, pp. 193-208. Springer-Verlag, 1997.
6. C. Cachin, Entropy Measures and Unconditional Security in Cryptography, Ph. D. Thesis, ETH Zürich, Hartung-Gorre Verlag, Konstanz, 1997.
7. C. Cachin and U. Maurer, Smoothing probability distributions and smooth entropy, Proceedings of International Symposium on Information Theory (ISIT) '97. IEEE, 1997.
8. T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley, 1991.
9. I. Csiszár and J. Körner, Broadcast channels with confidential messages, IEEE Transactions on Information Theory, Vol. 24, pp. 339-348, 1978.
10. Y. Dodis, L. Reyzin, and A. Smith, Fuzzy extractors: How to generate strong keys from biometrics and other noisy data, EUROCRYPT 2004, LNCS, Vol. 3027, pp. 523-540. Springer-Verlag, 2004.
11. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, A pseudorandom generator from any one-way function, SIAM Journal on Computing, Vol. 28, No. 4, pp. 1364-1396, 1999.
12. T. Holenstein and R. Renner, On the smooth Rényi entropy of independently repeated random experiments. manuscript, 2005.
13. R. Impagliazzo, L. A. Levin, and M. Luby, Pseudo-random generation from one-way functions (extended abstract), Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (STOC '89), pp. 12-24, 1989.
14. M. Luby and A. Wigderson, Pairwise independence and derandomization, Technical Report CSD-95-880, Computer Science Institute, Berkeley, CA, 1995. http://citeseer.ist.psu.edu/luby95pairwise.html.
15. U. M. Maurer, Secret key agreement by public discussion from common information, IEEE Transactions on Information Theory, Vol. 39, No. 3, pp. 733-742, 1993.
16. N. Nisan and D. Zuckerman, Randomness is linear in space, Journal of Computer and System Sciences, Vol. 52, pp. 43-52, 1996.
17. R. Renner, N. Gisin, and B. Kraus, Information-theoretic security proof for quantum-key-distribution protocols, Physical Review A, Vol. 72, 012332, 2005.
18. R. Renner and R. König, Universally composable privacy amplification against quantum adversaries, Proc. of TCC 2005, LNCS, Vol. 3378, pp. 407-425. Springer-Verlag, 2005.
19. R. Renner and S. Wolf, Smooth Rényi entropy and its properties, Proceedings of International Symposium on Information Theory (ISIT) 2004, p. 233. IEEE, 2004.
20. A. Rényi, On measures of entropy and information, Proceedings of the 4th Berkeley Symp. on Math. Stat. and Prob., Vol. 1, pp. 547-561. Univ. of Calif. Press, 1961.
21. R. Shaltiel, Recent developments in explicit constructions of extractors, Current trends in theoretical computer science. The Challenge of the New Century., Vol. 1, Algorithms and Complexity, 2002.
22. S. Wiesner, Conjugate coding, SIGACT News, Vol. 15, pp. 78-88, 1983.
23. A. D. Wyner, The wire-tap channel, Bell System Technical Journal, Vol. 54, No. 8, pp. 1355-1387, 1975.