Robust cryptography in the noisy-quantum-storage model

Quantum Information and Computation

Volumn 9, Issue 11-12, 2009, Pages 0963-0996

  Schaffner, Christian ^a   Terhal, Barbara ^b   Wehner, Stephanie ^c  

^a CWI   (Netherlands)

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

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Noisy storage model; Quantum cryptography

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; QUANTUM COMPUTERS;

CRYPTOGRAPHIC PRIMITIVES; OBLIVIOUS TRANSFER; QUANTUM BITS; QUANTUM PROTOCOLS; STORAGE MODEL; TRADE OFF;

QUANTUM CRYPTOGRAPHY;

EID: 71549160846     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (45)

1. G. Alexei, N. Langford, and M. Nielsen. Distance measures to compare real and ideal quantum processes. Physical Review A, 71(6):062310, 2005.
2. N. Alon and J. Spencer. The Probabilistic Method. Series in Discrete Mathematics and Optimization. Wiley-Interscience, 2nd edition, 2000.
3. C. H. Bennett, G. Brassard, C. Crépeau, and M.-H. Skubiszewska. Practical quantum oblivious transfer. In CRYPTO '91: Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, pages 351-366. Springer-Verlag, 1992.
4. A. D. Boozer, A. Boca, R. Miller, T. E. Northup, and H. J. Kimble. Reversible state transfer between light and a single trapped atom, 2007. quant-ph/0702248.
5. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
6. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143-154, 1979.
7. T. Chanelière, D.N. Matsukevich, S.D. Jenkins, S.-Y. Lan, T.A.B. Kennedy, and A. Kuzmich. Storage and retrieval of single photons between remote quantum memories. Nature, 438:pp. 833-836, 2005.
8. C. Crépeau. Efficient cryptographic protocols based on noisy channels. In Advances in Cryptology - Proceedings of EUROCRYPT '97, 1997.
9. C. Crépeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In Proceedings of 29th IEEE FOCS, pages 42-52, 1988.
10. C. Crépeau, K. Morozov, and S. Wolf. Efficient unconditional oblivious transfer from almost any noisy channel. In International Conference on Security in Communication Networks (SCN), volume 4 of Lecture Notes in Computer Science, pages 47-59, 2004.
11. I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner. Cryptography in the Bounded-QuantumStorage Model. In Proceedings of 46th IEEE FOCS, pages 449-458, 2005.
12. I. B. Damgård, S. Fehr, R. Renner, L. Salvail, and C. Schaffner. A tight high-order entropie quantum uncertainty relation with applications. In Advances in Cryptology-CRYPTO '07, volume 4622 of Lecture Notes in Computer Science, pages 360-378. Springer-Verlag, 2007.
13. I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner. Secure identification and QKD in the boundedquantum-storage model. In Advances in Cryptology-CRYPTO '07, volume 4622 of Lecture Notes in Computer Science, pages 342-359. Springer-Verlag, 2007.
14. I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner. Cryptography in the bounded-quantumstorage model. SIAM Journal on Computing, 37(6):1865-1890, 2008. \
15. M.D. Eisaman, A. André, F. Massou, M. Fleischauer, A.S. Zibrov, and M. D. Lukin. Electromagnetically induced transparency with tunable single-photon pulses. Nature, 438:pp. 837-841, 2005.
16. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
17. S. Fehr and C. Schaffner. Composing quantum protocols in a classical environment. In Theory of Cryptography-TCC '09, volume 5444 of Lecture Notes in Computer Science, pages 350-367. Springer, 2009.
18. N. Gisin, G. Ribordy, W. Tittel, and H. Zbinden. Quantum cryptography. Reviews of Modern Physics, 74:145-195, 2002.
19. O. Goldreich and R. Vainish. How to solve any protocol problem - an efficiency improvement. In Advances in Cryptology -CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pages 73-86. Springer, 1988.
20. D. Gottesman, H.-K. Lo, N. Lutkenhaus, and J. Preskill. Security of quantum key distribution with imperfect devices. Quant. Inf. Comp, 5:325-360, 2004. quant-ph/0212066. (Pubitemid 39427587)
21. M. Hayashi. Quantum Information - An introduction. Springer, 2006.
22. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1985.
23. B. Julsgaard, J. Sherson, J. I. Cirac, J. Fiurasek, and E. S. Polzik. Experimental demonstration of quantum memory for light. Nature, 432:pp. 482-485, 2004.
24. J. Kilian. Founding cryptography on oblivious transfer. In Proceedings of 20th ACM STOC, pages 20-31, 1988.
25. E. Knill, R. Laflamme, and G. Milburn. A scheme for efficient quantum computation with linear optics. Nature, 409:46-52, 2001. (Pubitemid 32098618)
26. R. König, R. Renner, and C. Schaffner. The operational meaning of min- and max-entropy. IEEE Transactions on Information Theory, 2009. arxiv:0807.1338
27. H-K. Lo. Insecurity of quantum secure computations. Physical Review A, 56:1154, 1997.
28. H-K. Lo and H. F. Chau. Is quantum bit commitment really possible? Physical Review Letters, 78:3410, 1997.
29. H-K. Lo and H.F. Chau. Why quantum bit commitment and ideal quantum coin tossing are impossible. In Proceedings of PhysComp96, 1996. quant-ph/9605026.
30. D. Mayers. The trouble with quantum bit commitment, quant-ph/9603015, 1996.
31. D. Mayers. Unconditionally secure quantum bit commitment is impossible. Physical Review Letters, 78:3414-3417, 1997.
32. R. Motwani and R. Prabhakar. Randomized Algorithms. Cambridge University Press, 1995.
33. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
34. T. B. Pittman and J. D. Franson. Cyclical quantum memory for photonic qubits. Phys. Rev. A, 66(6):062302, Dec 2002.
35. M. Rabin. How to exchange secrets by oblivious transfer. Technical report, Aiken Computer Laboratory, Harvard University, 1981. Technical Report TR-81.
36. R. Renner. Security of Quantum Key Distribution. PhD thesis, ETH Zurich, 2005. quantph/0512258.
37. W. Rosenfeld, S. Berner, J. Volz, M. Weber, and H. Weinfurter. Remote preparation of an atomic quantum memory. Physical Review Letters, 98:0505004, 2007.
38. L. Salvail. Quantum bit commitment from a physical assumption. In Proceedings of CRYPTO'98, volume 1462 of Lecture Notes in Computer Science, pages 338-353, 1998.
39. C. Schaffner. Cryptography in the Bounded-Quantum-Storage Model. PhD thesis, University of Aarhus, 2007. arxiv:0709.0289.
40. M. Tomamichel, R. Colbeck, and R. Renner. A fully quantum asymptotic equipartition property. arxiv:0811.1221, 2008.
41. S. Wehner, C. Schaffner, and B. Terhal. Cryptography from noisy photonic storage. arxiv:0711.2895, 2007.
42. S. Wehner, C. Schaffner, and B. M. Terhal. Cryptography from noisy storage. Physical Review Letters, 100(22):220502, 2008.
43. S. Wehner and J. Wullschleger. Security in the bounded-quantum-storage model. In ICALP 2008, 2008.
44. S. Wiesner. Conjugate coding. Sigact News, 15(1), 1983.
45. J. Wullschleger. Oblivious-transfer amplification. In Advances in Cryptology -EUROCRYPT '07, Lecture Notes in Computer Science. Springer-Verlag, 2007.