The bounded-storage model in the presence of a quantum adversary

IEEE Transactions on Information Theory

Volumn 54, Issue 2, 2008, Pages 749-762

  Konig, Robert T ^a   Terhal, Barbara ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Bounded storage model; Cryptography; Extractors; Locking; Privacy amplification; Quantum information theory; Quantum key distribution; Quantum memory; Security proofs; Universal composability

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; INFORMATION THEORY;

BOUNDED-STORAGE MODEL; PRIVACY AMPLIFICATION; QUANTUM INFORMATION THEORY; QUANTUM KEY DISTRIBUTION; QUANTUM MEMORY; SECURITY PROOFS; UNIVERSAL COMPOSABILITY;

QUANTUM THEORY;

EID: 39849104298     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.913245     Document Type: Article

References (37)

1. N. Nisan and D. Zuckerman, "Randomness is linear in space," J. Comp. Syst. Sci., vol. 52, pp. 43-52, 1996, a preliminary version was presented at STOC'93.
2. R. Shaltiel, "Recent developments in explicit constructions of extractors," Bull. EATCS vol. 77, pp. 67-95, 2002 [Online]. Available" http://dblp.uni-trier.de
3. G. S. Vernam, "Cipher printing telegraph systems for secret wire and radio telegraphic communications," J. Amer. Inst. Elec. Eng., vol. 55, pp. 109-115, 1926.
4. B. Pfitzmann and M. Waidner, "Composition and integrity preservation of secure reactive systems," in Proc. 7th ACM Conf. Computer and Communications Security, 2000, pp. 245-254.
5. R. Canetti, "Security and composition of multi-party cryptographic protocols," J. Cryptol., vol. 13, no. 1, pp. 143-202, 2000.
6. C. H. Bennett, G. Brassard, and J.-M. Robert, "Privacy amplification by public discussion," SIAM J. Comput., vol. 17, no. 2, pp. 210-229, 1988.
7. C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer, "Generalized privacy amplification," IEEE Trans. Inf. Theory, vol. 41, no. 6, pt. 2, pp. 1915-1923, Nov. 1995.
8. U. Maurer, "Conditionally-perfect secrecy and a provably-secure randomized cipher," J. Cryptol., vol. 5, no. 1, pp. 53-66, 1992.
9. Y. Aumann, Y. Z. Ding, and M. O. Rabin, "Everlasting security in the bounded storage model," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1668-1680, Jun. 2002.
10. S. Dziembowski and U. Maurer, "Tight security proofs for the bounded-storage model," in Proc. 34th Annu. ACM Symp. Theory of Computing, 2002, pp. 341-350, ser. Lecture Notes in Computer Science.
11. C. Lu, "Hyper-encryption against space-bounded adversaries from on-line strong extractors," in Advances in Cryptology - CRYPTO 2003, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-verlag, 2002, pp. 18-22.
12. S. P. Vadhan, "On constructing locally computable extractors and cryptosystems in the bounded-storage model," J. Cryptology, vol. 17, no. 1, pp. 43-77, 2004.
13. M. Ben-Or, "Security of BB84 QKD Protocol," 2002 [Online]. Available: http://www.msri.org/publications/in/msri/2002/quantumintro, (slides) Part II.
14. R. König, U. Maurer, and R. Renner, "On the power of quantum memory," IEEE Trans. Inf. Theory vol. 51, no. 7, pp. 2391-2401, Jul. 2005 [Online]. Available: http://arxiv.org/abs/quant-ph/0305154
15. R. Renner and R. König, "Universally composable privacy amplification against quantum adversaries," in Proc. Second Theory of Cryptography Conf. TCC, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2005, vol. 3378, pp. 407-425 [Online]. Available: http://arxiv.org/abs/quant-ph/0403133
16. R. Renner, "Security of quantum key distribution" Ph.D. dissertation, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, 2005 [Online]. Available: http://arxiv.org/abs/ quant-ph/0512258
17. M. Christandl, R. Renner, and A. Ekert, A Generic Security Proof for Quantum Key Distribution Feb. 2004 [Online]. Available: http://arxiv.org/ abs/quant-ph/0402131
18. I. Damgård, S. Fehr, L. Salvail, and C. Schaffner, "Cryptography in the bounded quantum-storage model," in Proc. 46th Annu. IEEE Symp. Foundations of Computer Science (FOCS , Pittsburgh, PA, Oct. 2005, pp. 449-458.
19. H. Buhrman, M. Christandl, P. Hayden, H. W. Lo, and S. Weliner, "On the (Im)Possibility of Quantum String Commitment," 2005 [Online]. Available: http://arxiv.org/abs/quant-ph/0504078
20. D. Gavinsky, J. Kempe, and R. de Wolf, "Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function," 2006 [Online]. Available: http://arxiv.org/abs/quant-ph/ 0607174
21. S. Wolf, "Information-Theoretically and Computationally Secure Key Agreement in Cryptography" Ph.D. dissertation, Swiss Federal Institute of Technology (ETH Zurich), Zurich, Switzerland, 1999, ETH dissertation No. 13138.
22. D. DiVincenzo, M. Horodecki, D. Leung, J. Smolin, and B. Terhal, "Locking classical correlations in quantum states," Phys. Rev. Lett., vol. 92, p. 067902, 2004.
23. R. König, R. Renner, A. Bariska, and U. Maurer, "Small accessible quantum information does not imply security," Phys. Rev. Lett. vol. 98, no. 14, p. 140502, 2007 [Online]. Available: http://link.aps.org/abstract/PRL/v98/e140502
24. D. Unruh, "Formal Security in Quantum Cryptology" Master's thesis, Karlsruhe, Germany, Dec. 2002 [Online]. Available: http://www.unrhu.de/DniQ/Publications
25. D. Unruh, Simulatable Security for Quantum Protocols Sept. 2004 [Online]. Available: http://arxiv.org/abs/quant-ph/0409125
26. M. Ben-Or and D. Mayers, General Security Definition and Composability for Quantum and Classical Protocols Sep. 2004 [Online]. Available: http://arxiv.org/abs/quant-ph/0409062
27. M. Ben-Or, M. Horodecki, D. W. Leung, D. Mayers, and J. Oppenheim, "The universal composable security of quantum key distribution," in Proc. Second Theory of Cryptography Conf. TCC, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2005, vol. 3378, pp. 386-406 [Online]. Available: http://arxiv.org/abs/quant-ph/0409078
28. H. Barnum and E. Knill, "Reversing quantum dynamics with near-optimal quantum and classical fidelity," J. Math. Phys., vol. 43, no. 5, pp. 2097-2106, 2002.
29. P. Hausladen and W. Wootters, "A 'pretty good' measurement for distinguishing quantum states," J. Mod. Opt., vol. 41, no. 12, pp. 2385-2390, 1994.
30. C. W. Helstrom, Quantum Detection and Estimation Theory. New York: Academic, 1976.
31. A. Srinivasan and D. Zuckerman, "Computing with very weak random sources," in Proc. IEEE Symp. Foundations of Computer Science, Santa Fe, NM, Nov. 1994, pp. 264-275 [Online]. Available: citeseer.ist.psu. edu/447609.html
32. O. Reingold, R. Shaltiel, and A. Wigderson, "Extracting randomness via repeated condensing," in Proc. IEEE Symp Foundations of Computer Science, Redondo Beach, CA, Nov. 2000, pp. 22-31 [Online]. Available: citeseer.ist.psu.edu/reingoldOOextracting.html
33. A. Nayak, "Optimal lower bounds for quantum automata and random access codes," in Proc. 40th Annu. Symp. Foundations of Computer Science New York City, Oct. 1999, pp. 369-377, quant-ph/9904093.
34. A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani, "Dense quantum coding and a lower bound for 1-way quantum automata," in Proc. 31th ACM Symp. Theory of Computing, Atlanta, GA, May 1999, quant-ph/ 9804043.
35. R. König and R. Renner, "A de Finetti representation for finite symmetric quantum states," J. Math. Phys., vol. 46, p. 122108, 2005.
36. P. Sen and A. Nayak, 2007, personal communication.
37. A. Ambainis and J. Emerson, Quantum t-Designs: T-Wise Independence in the Quantum World 2007 [Online]. Available: http://arxiv.org/abs/ quant-ph/0701126