Sampling of min-entropy relative to quantum knowledge

IEEE Transactions on Information Theory

Volumn 57, Issue 7, 2011, Pages 4760-4787

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

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

Bounded storage model; min entropy; privacy amplification; quantum cryptography; quantum extractors; randomness extraction; sampling

Indexed keywords

BOUNDED-STORAGE MODEL; MIN-ENTROPY; PRIVACY AMPLIFICATION; QUANTUM EXTRACTORS; RANDOMNESS EXTRACTION;

ENTROPY; QUANTUM ELECTRONICS; QUANTUM OPTICS; RANDOM PROCESSES; RANDOM VARIABLES;

QUANTUM CRYPTOGRAPHY;

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

References (37)

1. A. Ambainis, A. Nayak, A. Ta-Shma, and U.Vazirani, "Dense quantum coding and a lower bound for 1-way quantum automata," presented at the 31st ACM Symp. Theory of Computing, 1999, arXiv:quant-ph/ 9804043.
2. L. Babai and T. P. Hayes, "Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group," in Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms, SODA'05, Philadelphia, PA, 2005, pp. 1057-1066, Society for Industrial and Applied Mathematics. (Pubitemid 40851473)
3. A. Ben-Aroya, O. Regev, and R. de Wolf, "A hypercontractive inequality for matrix-valued functions with applications to quantum computing and ldcs," Found. Comput. Sci., pp. 477-486, Oct. 2008.
4. 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, Jun. 1995.
5. 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.
6. N. Datta, "Min- and max-relative entropies and a new entanglement monotone," IEEE Trans. Inf. Theory, vol. 55, no. 6, pp. 2816-2826, Jun. 2009.
7. A. De and T. Vidick, Near-Optimal Extractors Against Quantum Storage, 2009, arXiv:0911.4680.
8. B. de Finetti, "La prévision: ses lois logiques, ses sources subjectives," Ann. Inst. H. Poincaré, vol. 7, pp. 1-68, 1937.
9. P. Diaconis and D. Freedman, "Finite exchangeable sequences," Ann. Probab., vol. 8, no. 4, pp. 745-764, 1980.
10. Y. Z. Ding, D. Harnik, A. Rosen, and R. Shaltiel, "Constant-round oblivious transfer in the bounded storage mode l," in Proc. 2nd Theory of Cryptography Conf., TCC 2004, 2004, pp. 446-472.
11. S. Dziembowski and U. Maurer, "Tight security proofs for the bounded-storage model," in Proc. 34th Annu. ACM Symp. Theory of Computing, May 2002, pp. 341-350, ACM. (Pubitemid 35009394)
12. S. Dziembowski and U. Maurer, "Optimal randomizer efficiency in the bounded-storage model," J. Cryptol., vol. 17, no. 1, pp. 5-26, Jan. 2004, Conference version appeared in Proc. STOC'02.
13. S. Fehr and C. Schaffner, "Randomness extraction via delta-biased masking in the presence of a quantum attacker," in Theory of Cryptograph (TCC), Lecture Notes in Computer Science. Berlin/Heidelberg, Germany: Springer, 2008, vol. 4948, pp. 465-481.
14. D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. deWolf, Exponential Separations for One-Way Quantum Communication Complexity, With Applications to Cryptography. Philadelphia, PA: SIAM, Dec. 2008, vol. 38, pp. 1695-1708, arXiv:quant-ph/0611209.
15. O. Goldreich, A Sampler of Samplers: A Computational Perspective on Sampling, 1997 [Online]. Available: http://www.eccc.uni-trier.de/eccc/
16. A. S. Holevo, "Statistical problems in quantum physics," in Proc. 2nd Japan-USSR Symp. Probability Theory, 1973, pp. 104-119, Springer, Lecture Notes in Mathematics.
17. R. Impagliazzo, L. A. Levin, and M. Luby, "Pseudo-random generation from one-way functions," in Proc. 21st Annu. ACM Symp. Theory of Computing STOC'89, New York, 1989, pp. 12-24, ACM.
18. 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, arXiv:quant-ph/0305154. (Pubitemid 41136399)
19. R. König, C. Schaffner, and R. Renner, "The operational meaning of conditional min-entropy," IEEE Trans. Inf. Theory, vol. 55, no. 9, pp. 4337-4347, Sep. 2009.
20. R. König and B. M. 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. (Pubitemid 351314663)
21. R. König, S. Wehner, and J. Wullschleger, Unconditional Security From Noisy Quantum Storage, 2009, arXiv:0906.1030.
22. M. S. Leifer, "Conditional density operators and the subjectivity of quantum operations," in Proc. Foundations of Probability and Physics-4, AIP Conf., G. Adenier, C. A. Fuchs, and A. Yu. Khrennikov, Eds., 2007, vol. 889, pp. 172-186, arXiv:quant-ph/0611233.
23. A. Leverrier, E. Karpov, P. Grangier, and N. J. Cerf, Unconditional Security of Continuous-Variable Quantum Key Distribution, 2008, arXiv:0809.2252v2.
24. C. Lu, "Hyper-encryption against space-bounded adversaries from on-line strong extractors," in Proc. Advances in Cryptology-CRYPTO 2003, 2002, pp. 18-22, Springer, Lecture Notes in Computer Science.
25. U. Maurer, "Conditionally-perfect secrecy and a provably-secure randomized cipher," J. Cryptol., vol. 5, no. 1, pp. 53-66, 1992.
26. A. Nayak, "Optimal lower bounds for quantum automata and random access codes," in Proc. 40th IEEE FOCS, 1999, pp. 369-376, arXiv:quant-ph/9904093. (Pubitemid 129306190)
27. N. Nisan and D. Zuckerman, "Randomness is linear in space," J. Comput. Syst. Sci., vol. 52, pp. 43-52, 1996, A preliminary version appeared at STOC'93. (Pubitemid 126340848)
28. T. Ogawa and H. Nagaoka, New Proof of the Channel Coding Theorem via Hypothesis Testin g in Quantum Information Theory, 2002, arXiv:quant-ph/0208139.
29. R. Renner, "Security of QuantumKey Distribution," Ph.D. dissertation, ETH, Zurich, Switzerland, 2005, arXiv:quant-ph/0512258.
30. R. Renner, "Symmetry of large physical systems implies independence of subsystems," Nature Phys., vol. 3, pp. 645-649, 2007.
31. R. Renner and R. König, "Universally composable privacy amplification against quantum adversaries," in Proc. 2nd Theory of Cryptography Conf. TCC, 2005, pp. 407-425, Volume 3378 of Lecture Notes in Computer Science, Springer, arXiv:quant-ph/0403133. (Pubitemid 41231175)
32. R. Shaltiel, "Recent developments in explicit constructions of extractors," Bull. EATCS vol. 77, pp. 67-95, 2002 [Online]. Available: http://dblp.uni-trier.de
33. A. Ta-Shma, "Short seed extractors against quantum storage," in Proc. 41st Annu. ACM Symp. Theory of Computing (STOC), 2009, pp. 401-408.
34. S. Vadhan, "On constructing locally computable extractors and cryptosystems in the bounded storage model," in Proc. Advances in Cryptology- CRYPTO 2003, 2003, pp. 61-77. (Pubitemid 137636935)
35. S. Wehner, C. Schaffner, and B. M. Terhal, "Cryptography from noisy storage," Phys. Rev. Lett., vol. 100, no. 220502, 2008.
36. A. Winter, "Coding theorem and strong converse for quantum channels," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2481-2485, Nov. 1999. (Pubitemid 30514205)
37. J.Wullschleger, "Oblivious-transfer amplification," in Proc. LNCS, Advances in Cryptology-EUROCRYPT, 2007, vol. 4515, pp. 555-572.