On the power of quantum memory

IEEE Transactions on Information Theory

Volumn 51, Issue 7, 2005, Pages 2391-2401

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

^a ETH ZURICH   (Switzerland)

Author keywords

Cryptography; Privacy amplification; Quantum information theory; Quantum key distribution; Quantum memory; Security proofs; Universal hashing

Indexed keywords

CRYPTOGRAPHY; INFORMATION THEORY; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; QUANTUM THEORY; SECURITY OF DATA; THEOREM PROVING;

PRIVACY AMPLIFICATION; QUANTUM INFORMATION THEORY; QUANTUM KEY DISTRIBUTION; QUANTUM MEMORY; SECURITY PROOFS; UNIVERSAL HASHING;

DATA STORAGE EQUIPMENT;

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

References (25)

1. A. S. Holevo, "Statistical problems in quantum physics," in Proc. 2nd Japan-USSR Symp. Probability Theory (Lecture Notes in Mathematics). Berlin, Germany: Springer-Verlag, 1973, vol. 330, pp. 104-119.
2. S. Dziembowski and U. Maurer, "Optimal randomizer efficiency in the bounded-storage model," J. Cryptol., vol. 17, no. 1, pp. 5-26, 2004.
3. S. Vadhan, "On constructing locally computable extractors and cryptosystems in the bounded storage model," in Advances in Cryptology - CRYPTO 2003, 2003, pp. 61-77.
4. 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, pp. 376-383.
5. A. Nayak, "Optimal lower bounds for quantum automata and random access codes," in Proc. 40th Annu. Symp. Foundations of Computer Science, New York, Oct. 1999, quant-ph/9904093, pp. 369-377.
6. R. Jain, J. Radhakrishnan, and P. Sen, "Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states," in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science (FOCS '02), Vancouver, BC, Canada, Nov. 2002, pp. 429-438.
7. 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.
8. 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, Dec. 1995.
9. N. Nisan and D. Zuckerman, "Randomness is linear in space," J. Comp. Syst. Sci., vol. 52, pp. 43-52, 1996.
10. M. Christandl, R. Renner, and A. Ekert. (2004) A Generic Security Proof for Quantum Key Distribution. Online. Available: http://arxiv.org/abs/ quant-ph/0402131
11. C. H. Bennett and G. Brassard, "Quantum cryptography: Public-key distribution and coin tossing," in Proc. IEEE Int. Conf. Computers, Systems and Signal Processing, Bangalore, India, Dec. 1984, pp. 175-179.
12. D. Mayers, "Unconditional security in quantum cryptography," J. Assoc. Comput. Mach., vol. 48, no. 3, pp. 351-406, 2001.
13. M. Ben-Or. (2002) Security of BB84 QKD Protocol. Online. Available: http://www.msri.org/publications/ln/msri/2002/quantumintro/ben-or/2/
14. A. Ambainis, L. J. Schulman, A. Ta-Shma, U. Vazirani, and A. Wigderson, "The quantum communication complexity of sampling," in Proc. 39th Annu. Symp. Foundations of Computer Science, Palo Alto, CA, Nov. 1998, pp. 342-351.
15. J. L. Carter and M. N. Wegman, "Universal classes of hash functions," J. Comp. Sys. Sci., vol. 18, pp. 143-154, 1979.
16. M. N. Wegman and J. L. Carter, "New hash functions and their use in authentication and set equality," J. Comp. Syst. Sci., vol. 22, pp. 265-279, 1981.
17. C. W. Helstrom, Quantum Detection and Estimation Theory. New York: Academic, 1976.
18. C. A. Fuchs, "Distinguishability and accessible information in quantum theory," Ph.D. dissertation, Univ. New Mexico, Albuquerque, 1995.
19. O. Goldreich, "Three XOR-Lemmas - An Exposition," Electronic Colloquium on Computational Complexity, Tech. Rep. TR95-056, 1995. Available: Online at at http://eccc.uni-trier.de/eccc/.
20. A. Elbaz, "Improved Constructions for Extracting Quasi-Random Bits from Sources of Weak Randomness," Master's thesis, Weizmann Inst. Sci., 2003. Available: Online at http://wwwl.cs.columbia.edu/~arielbaz/.
21. I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339-348, May 1978.
22. U. M. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
23. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
24. D. Zeilberger, "A fast algorithm for proving terminating hypergeometric series identities," Discr. Math., vol. 80, pp. 207-211, 1990.
25. W. Feller, An Introduction to Probability Theory and its Applications, 3rd ed. New York: Wiley, 1968, vol. 1, Wiley Series in Probability and Mathematical Statistics.