Universally composable privacy amplification against quantum adversaries

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 407-425

  Renner, Renato ^a   König, Robert ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

COMPOSABLE PRIVACY AMPLIFICATIONS; QUANTUM KEY DISTRIBUTIONS;

QUANTUM CRYPTOGRAPHY;

EID: 24144485355     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_22     Document Type: Conference Paper

References (31)

1. A. Ambainis, L. J. Schulman, A. Ta-Shma, U. Vazirani, and A. Wigderson. The quantum communication complexity of sampling. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 342-351, 1998.
2. M. Ben-Or. Security of BB84 QKD Protocol. Slides available at http:// www.msri.org/publications/ln/msri/2002/quantumintro/ben-or/2/, 2002.
3. M. Ben-Or, M. Horodecki, D. Leung, D. Mayers, and J. Oppenheim. Composability of QKD. Slides available at http://www.msri.org/ publications/ln/msri/2002/qip/mayers/1/ (Part II), 2002.
4. M. Ben-Or, M. Horodecki, D. Leung, D. Mayers, and J. Oppenheim. The universal composable security of quantum key distribution. In Proceedings of TCC 2005, 2005.
5. M. Ben-Or and D. Mayers. Quantum universal composability. Slides available at http://www.msri.org/publications/ln/msri/2002/quantumcrypto/mayers/ 1/banner/01.html, 2002.
6. M. Ben-Or and D. Mayers. General security definition and composability for quantum & classical protocols. Available at http://arxiv.org/abs/quant-ph/0409062, 2004.
7. C. H. Bennett. Quantum cryptography using any two nonorthogonal states. Physical Review Letters, 68(21):3121-3124, 1992.
8. C. H. Bennett and G. Brassard. Quantum cryptography: Public-key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, pages 175-179, 1984.
9. C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer. Generalized privacy amplification. IEEE Transaction on Information Theory, 41(6):1915-1923, 1995.
10. C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM Journal on Computing, 17(2):210-229, 1988.
11. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 136-145, 2001.
12. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143-154, 1979.
13. M. Christandl, R. Renner, and A. Ekert. A generic security proof for quantum key distribution. Available at http://arxiv.org/abs/quant-ph/0402131, February 2004.
14. I. Csiszár and J. Körner. Broadcast channels with confidential messages. IEEE Transactions on Information Theory, 24:339-348, 1978.
15. I. Devetak and A. Winter. Distillation of secret key and entanglement from quantum states. Available at http://arxiv.org/abs/quant-ph/0306078, June 2003.
16. D. DiVincenzo, M. Horodecki, D. Leung, J. Smolin, and B. Terhal. Locking classical correlation in quantum states. Physical Review Letters, 92, 067902, 2004.
17. S. Dziembowski and U. Maurer. Optimal randomizer efficiency in the bounded-storage model. Journal of Cryptology, 17(1):5-26, 2004. Conference version appeared in Proc. of STOC'02.
18. D. Gottesman and H.-K. Lo. Proof of security of quantum key distribution with two-way classical communications. IEEE Transactions on Information Theory, 49(2):457-475, 2003.
19. P. Hayden, D. Leung, P. W. Shor, and A. Winter. Randomizing quantum states: Constructions and applications Communications in Mathematical Physics, 250(2):371-391, 2004.
20. R. A. Horn and C. R. Johnson. Matrix analysis. Cambridge University Press, 1985.
21. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions (extended abstract). In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pages 12-24, 1989.
22. R. König, U. Maurer, and R. Renner. On the power of quantum memory. Available at http://arxiv.org/abs/quant-ph/0305154, May 2003.
23. B. Kraus, N. Gisin, and R. Renner. Lower and upper bounds on the secret key rate for QKD protocols using one-way classical communication. Available at http://arxiv.org/abs/quant-ph/0410215, 2004.
24. U. M. Maurer. Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory, 39(3):733-742, 1993.
25. M. A. Nielsen. Majorization and its applications to quantum information theory. Available at http://www.qinfo.org/talks/1999/06-maj/maj.pdf, June 1999.
26. M. A. Nielsen and I. L. Chuang. Quantum computation and quantum information. Cambridge University Press, 2000.
27. B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In 7th ACM Conference on Computer and Communications Security, pages 245-254. ACM Press, 2000.
28. R. Renner and S. Wolf. Smooth Rényi entropy and applications. In Proceedings of the 2004 IEEE International Symposium on Information Theory, page 233, 2004.
29. A. Rényi. On measures of entropy and information. In Proceedings of the 4th Berkeley Symp. on Math. Statistics and Prob., volume 1, pages 547-561. Univ. of Calif. Press, 1961.
30. D. Unruh. Simulatable security for quantum protocols. Available at http://arxiv.org/abs/quant-ph/0409125, 2004.
31. M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22:265-279, 1981.