Unconditional security from noisy quantum storage

IEEE Transactions on Information Theory

Volumn 58, Issue 3, 2012, Pages 1962-1984

  König, Robert ^a   Wehner, Stephanie ^b   Wullschleger, Jürg ^c  

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

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Cryptography; quantum computing

Indexed keywords

BIT COMMITMENT; CRYPTOGRAPHIC PRIMITIVES; NOISE LEVELS; OBLIVIOUS TRANSFER; QUANTUM COMPUTING; QUANTUM KEY DISTRIBUTION; UNCONDITIONAL SECURITY;

QUANTUM CHEMISTRY; QUANTUM COMPUTERS;

CRYPTOGRAPHY;

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

References (66)

1. M. Ballester, S. Wehner, and A. Winter, "State discrimination with post-measurement information," IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 4183-4198, Sep. 2008.
2. D. Beaver, "Precomputing oblivious transfer," in Proc. Adv. Cryptol. (Lecture Notes Comput. Sci.), 1995, vol. 963, pp. 97-109.
3. M. Ben-Or, M. Horodecki, D. Leung, D. Mayers, and J. Oppenheim, "The universal composable security of quantum key distribution," in Proc. 2nd Theory Cryptography Conf. (Lecture Notes Comput. Sci.), 2005, vol. 3378, pp. 386-406.
4. C. H. Bennett and G. Brassard, "Quantum cryptography: Public key distribution and coin tossing," in Proc. IEEE Int. Conf. Comput., Syst. Signal Process., 1984, pp. 175-179.
5. C. H. Bennett, I. Devetak, A. Harrow, P. Show, and A.Winter, Quantum reverse Shannon theorem, 2009, arXiv:0912.5537.
6. A. Bocquet, "Workshop on cryptography from storage imperfections," presented at the presented at the Inst. Quantum Inf. Caltech, Pasadena, CA, Mar. 20-22, 2010.
7. C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer, "Generalized privacy amplification," IEEE Trans. Inf. Theory, vol. 41, no. 6, pp. 1915-1923, Nov. 1995.
8. C. H. Bennett, G. Brassard, C. Crépeau, and H. Skubiszewska, "Practical quantum oblivious transfer," in Proc. Adv. Cryptol. (Lecture Notes Comput. Sci.), 1992, vol. 576, pp. 351-366.
9. 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.
10. J. L. Carter and M. N. Wegman, "Universal classes of hash functions," in Proc. 9th Annu. ACM Symp. Theory Comput., New York, NY, 1977, pp. 106-112.
11. C. Crépeau, "Quantum oblivious transfer," J. Modern Opt., vol. 41, no. 12, pp. 2455-2466, 1994.
12. C. Crépeau, P. Dumais, D. Mayers, and L. Salvail, "Computational collapse of quantum state with application to oblivious.transfer," in Proc. Theory Cryptography Conf. (Lecture Notes Comput. Sci.), 2004, vol. 2951, pp. 374-393.
13. M. Curty, H. Lo, C. Schaffner, and S. Wehner, "Implementing twoparty protocols in the noisy-storage model," Phys. Rev. A, vol. 81, pp. 052336-1-052336-26, 2010.
14. I. Damgård, S. Fehr, C. Lunemann, L. Salvail, and C. Schaffner, "Improving the security of quantum protocols," in Proc. Adv. Cryptol. (Lecture Notes Comput. Sci.), 2009, vol. 5677, pp. 408-427.
15. I. B. Damgård, S. Fehr, R. Renner, L. Salvail, and C. Schaffner, "A tight high-order entropic quantum uncertainty relation with. Applications," in Proc. Adv. Cryptol. (Lecture Notes Comput. Sci.), 2007, vol. 4622, pp. 360-378.
16. I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner, "Cryptography in the bounded-quantum-storage model," in Proc. 46th Annu. IEEE Symp. Found. Comput. Sci., 2005, pp. 449-458.
17. I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner, "Secure identification and QKD in the bounded-quantum-storage model," in Proc. Adv. Cryptol. (Lecture Notes Comput. Sci.), 2007, vol. 4622, pp. 342-359.
18. Y. Z. Ding, "Oblivious transfer in the bounded storage model," in Proc. Adv. Cryptol. (Lecture Notes Comput. Sci.), 2001, vol. 2139, pp. 155-170.
19. Y. Z. Ding, D. Harnik, A. Rosen, and R. Shaltiel, "Constant-round oblivious transfer in the bounded storage model," in Proc. Theory Cryptography Conf. (Lecture Notes Comput. Sci.), 2004, vol. 2951, pp. 446-472.
20. C. Ervens, "Workshop on cryptography from storage imperfections," presented at the presented at the Inst. Quantum Inf. Caltech, Pasadena, CA, Mar. 20-22, 2010.
21. S. Fehr and C. Schaffner, Composing quantum protocols in a classical environment 2008, arXiv:0804.1059.
22. O. Goldreich, A sample of samplers: A computational perspective on sampling 1997 [Online]. Available: http://www.eccc.uni-trier.de/eccc, TR97-020
23. O. Goldreich and R. Vainish, "How to solve any protocol problem-an efficiency improvement," in Proc. Adv. Cryptol. (Lecture Notes Comput. Sci.), 1988, vol. 293, pp. 73-86.
24. M. Hayashi, Personal communication with Andreas Winter 2010.
25. D. Harnik, J. Kilian, M. Naor, O. Reingold, and A. Rosen, "On robust combiners for oblivious transfer and other primitives," in Proc. Adv. Cryptol. (Lecture Notes Comput. Sci.), 2005, vol. 3494, pp. 96-113.
26. A. Herzberg, "On tolerant cryptographic constructions," in Proc. CT-RSA (Lecture Notes Comput. Sci.), 2005, vol. 3376, pp. 172-190.
27. R. Impagliazzo, L. A. Levin, and M. Luby, "Pseudo-random generation from one-way functions," in Proc. 21st ACM Symp. Theory Comput., 1989, pp. 12-24.
28. A. Kalev and S. Wehner, Personal communication 2008.
29. J. Kilian, "Founding cryptography on oblivious transfer," in Proc. 20th ACM Symp. Theory Comput., 1988, pp. 20-31.
30. C. King, "Additivity for unital qubit channels," J. Math. Phys., vol. 43, pp. 4641-4653, 2002.
31. C. King, "The capacity of the quantum depolarizing channel," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 221-229, Jan. 2003.
32. R. König and R. Renner, "Sampling of min-entropy relative to quantum knowledge," IEEE Trans. Inf. Theory, vol. 57, no. 7, pp. 4760-4787, Jul. 2011.
33. R. König, R. Renner, A. Bariska, and U. Maurer, "Small accessible quantum information does not imply security," Phys. Rev. Lett., vol. 98, pp. 140502-1-140502-4, 2007.
34. R. König, R. Renner, and C. Schaffner, The operational meaning of min-and max-entropy 2008, arXiv:0807.1338.
35. R. König and B. Terhal, "The bounded-storage model in the presence of a quantum adversary," IEEE Trans. Inf. Theory, vol. 54, no. 2, pp. 749-762, Feb. 2008.
36. R. König and S.Wehner,Astrong converse for classical channel coding using entangled inputs. 2009, arXiv: 0903.2338.
37. H.-K. Lo, "Insecurity of quantum secure computations," Phys. Rev. A, vol. 56, pp. 1154-1162, 1997.
38. H.-K. Lo and H. F. Chau, "Is quantum bit commitment really possible?," Phys. Rev. Lett., vol. 78, pp. 3410-3413, 1997.
39. H.-K. Lo and H. F. Chau, "Why quantum bit commitment and ideal quantum coin tossing are impossible," Phys. D: Nonlinear Phenomena, vol. 120, pp. 177-187, 1998.
40. P. Mandayam and S. Wehner, Achieving the physical limits of the bounded-storage model. 2010, arXiv:1009.1596.
41. H. Maassen and J. Uffink, "Generalized entropic uncertainty relations," Phys. Rev. Lett., vol. 60, pp. 1103-1106, 1988.
42. U. Maurer, "A provably-secure strongly-randomized cipher," in Proc. Adv. Cryptol. (Lecture Notes Comput. Sci.), 1990, vol. 473, pp. 361-373.
43. U. Maurer, "Conditionally-perfect secrecy and a provably-secure randomized cipher," J. Cryptol., vol. 5, no. 1, pp. 53-66, 1992.
44. D. Mayers, The trouble with quantum bit commitment 1996, quant-ph/9603015.
45. D. Mayers, "Unconditionally secure quantum bit commitment is impossible," Phys. Rev. Lett., vol. 78, pp. 3414-3417, 1997.
46. R. Meier, B. Przydatek, and J. Wullschleger, "Robuster combiners for oblivious transfer," in Proc. 4th Theory Cryptography Conf., 2007, pp. 404-418.
47. R. Ostrovsky, R. Venkatesan, and M. Yung, "Fair games against an allpowerful adversary," in DIMACS: Series in Discrete Mathematics and Theoretical. Computer Science. Providence, RI: Amer. Math. Soc., pp. 155-169, 1991.
48. I. S. Reed and G. Solomon, "Polynomial codes over certain finite fields," J. Soc. Ind. Appl. Math., vol. 8, no. 2, pp. 300-304, 1960.
49. R. Renner, "Security of QuantumKey Distribution," Ph.D. dissertation, Dept. of Physics, ETH Zurich, Zurich, Switzerland, 2005.
50. R. Renner and R. König, "Universally composable privacy amplification against quantum adversaries," in Proc. Theory Cryptography Conf. (Lecture Notes Comput. Sci.), 2005, vol. 3378, pp. 407-425.
51. G. Savvides, "Interactive Hashing and Reductions Between Oblivious Transfer," Ph.D. dissertation, Dept. of Computer Science, McGill University, Montreal, QC, Canada, 2007.
52. C. Schaffner, "Cryptography in the Bounded-Quantum-Storage Model," Ph.D. dissertation, Dept. of Computer Science, University of Aarhus, Aarhus, Denmark, 2007.
53. C. Schaffner, Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model 2010, arXiv:1002.1495.
54. C. Schaffner, B. Terhal, and S. Wehner, "Robust cryptography in the noisy-quantum-storage model," Quantum Inf. Comput., vol. 9, pp. 0963-0996, 2009.
55. R. Shaltiel, "Recent developments in explicit constructions of extractors," Bull. EATCS, vol. 77, pp. 67-95, 2002.
56. A. Ta-Shma, Short seed extractors against quantum storage 2008, quant-ph/0808.1994.
57. W. Uhlmann, "Probability inequalities for sums of bounded random variables," J. Amer. Statist. Assoc., vol. 58, no. 301, pp. 13-30, Mar. 1963.
58. S. Vadhan, "On constructing locally computable extractors and cryptosystems in the bounded storage model," in Proc. Adv. Cryptol. (Lecture Notes Comput. Sci.), 2003, pp. 61-77.
59. S. Wehner, "Cryptography in a quantum world," Ph.D. dissertation, School of Sciences, University of Amsterdam, Amsterdam, The Netherlands, 2008, arXiv:0806.3483.
60. S.Wehner, C. Schaffner, and B. Terhal, Cryptography from noisy photonic storage 2007, arxiv:0711.2895.
61. S. Wehner, C. Schaffner, and B. M. Terhal, "Cryptography from noisy storage," Phys. Rev. Lett., vol. 100, no. 22, pp. 220502-1-220502-4, 2008.
62. S. Wehner and A. Winter, "Higher entropic uncertainty relations for anti-commuting observables," J. Math. Phys., vol. 49, pp. 062105-1-062105-11, 2008.
63. S.Wehner and J. Wullschleger, "Composable security in the boundedquantum-storage model," in Proc. Int. Collaq. Automata Languages Programming, 2008, pp. 604-615.
64. S.Wiesner, "Conjugate coding," Sigact News, vol. 15, no. 1, pp. 78-88, 1983.
65. J.Wullschleger, Bitwise quantum min-entropy sampling and newlower bounds for random access codes 2010, arXiv:1012.2291.
66. A. C.-C. Yao, "Security of quantum protocols against coherent measurements," in Proc. 20th ACM Symp. Theory Comput., 1995, pp. 67-75.