Abstract
A natural measure for the amount of quantum information that a physical system E holds about another system A = A1,...,A n is given by the min-entropy H min (A|E). Specifically, the min-entropy measures the amount of entanglement between E and A, and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behaviour of the min-entropy after some process M is applied to the system A. Here we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest, including sampling of subsystems and measuring in a randomly chosen basis. The results on random measurements yield new high-order entropic uncertainty relations with which we prove the optimality of cryptographic schemes in the bounded quantum storage model. This is an abridged version of the paper; the full version containing all proofs and further applications can be found in [13].
Chapter PDF
References
Bandyopadhyay, S., Boykin, P., Roychowdhury, V., Vatan, F.: A new proof for the existence of mutually unbiased bases. Algorithmica 34(4), 512–528 (2002) arXiv:quant-ph/0103162
Barnum, H., Knill, E.: Reversing quantum dynamics with near-optimal quantum and classical fidelity. J. Math. Phys. 43, 2097 (2002)
Barnum, H., Knill, E., Nielsen, M.A.: On quantum fidelities and channel capacities. IEEE Trans. Inform. Theory 46, 1317–1329 (2000) arXiv:quant-ph/9809010
Ben-Aroya, A., Regev, O., de Wolf, R.: A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs. In: Proc. IEEE FOCS (2008) arXiv:0705.3806
Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Proc. International Conference on Computers, Systems and Signal Processing (1984)
Berta, M., Brandao, F., Christandl, M., Wehner, S.: Entanglement cost of quantum channels (2011) arXiv:1108.5357
Berta, M., Fawzi, O., Wehner, S.: Quantum to classical randomness extractors. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 776–793. Springer, Heidelberg (2012)
Bouman, N.J., Fehr, S., González-Guillén, C., Schaffner, C.: An all-but-one entropic uncertainty relation, and application to password-based identification. In: Iwama, K., Kawano, Y., Murao, M. (eds.) TQC 2012. LNCS, vol. 7582, pp. 29–44. Springer, Heidelberg (2012)
Cachin, C., Maurer, U.M.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292–306. Springer, Heidelberg (1997)
Damgård, I., Fehr, S., Renner, R., Salvail, L., Schaffner, C.: A tight high-order entropic quantum uncertainty relation with applications. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 360–378. Springer, Heidelberg (2007)
Damgård, I., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the bounded quantum-storage model. In: Proc. IEEE FOCS, pp. 449–458 (2005) arXiv:quant-ph/0508222
Damgård, I.B., Fehr, S., Salvail, L., Schaffner, C.: Secure identification and QKD in the bounded-quantum-storage model. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 342–359. Springer, Heidelberg (2007)
Dupuis, F., Fawzi, O., Wehner, S.: Entanglement sampling and applications (2013) arXiv:1305.1316
Dziembowski, S., Maurer, U.: On generating the initial key in the bounded-storage model. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 126–137. Springer, Heidelberg (2004)
Impagliazzo, R., Levin, L., Luby, M.: Pseudo-random generation from one-way functions. In: Proc. ACM STOC, pp. 12–24. ACM (1989)
König, R., Renner, R., Schaffner, C.: The operational meaning of min- and max-entropy. IEEE Trans. Inform. Theory 55, 4674–4681 (2009) arXiv:0807.1338
König, R., Wehner, S., Wullschleger, J.: Unconditional security from noisy quantum storage. IEEE Trans. Inform. Theory 58(3), 1962–1984 (2012) arXiv:0906.1030
König, R., Renner, R.: Sampling of min-entropy relative to quantum knowledge. IEEE Trans. Inform. Theory 57(7), 4760–4787 (2011) arXiv:0712.4291
Lo, H.-K., Chau, H.F.: Is quantum bit commitment really possible? Phys. Rev. Lett. 78, 3410 (1997)
Mandayam, P., Wehner, S.: Achieving the physical limits of the bounded-storage model. Phys. Rev. A. 83, 022329 (2011) arXiv:1009.1596
Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptol. 5, 53–66 (1992)
Mayers, D.: Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Lett. 78, 3414–3417 (1997)
Ng, N., Joshi, S., Chia, C., Kurtsiefer, C., Wehner, S.: Experimental implementation of bit commitment in the noisy-storage model. Nat. Comm. 3, 1326 (2012)
Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43–52 (1996)
Renner, R.: Security of quantum key distribution. Int. J. Quantum Inf. 6, 1 (2008) arXiv:quant-ph/0512258
Schaffner, C., Terhal, B., Wehner, S.: Robust cryptography in the noisy-quantum-storage model. Quantum Inf. Comput. 9, 11 (2008) arXiv:0807.1333
Tomamichel, M.: A Framework for Non-Asymptotic Quantum Information Theory. PhD thesis, ETH Zürich (2012) arXiv:1203
Tomamichel, M., Colbeck, R., Renner, R.: A fully quantum asymptotic equipartition property. IEEE Trans. Inform. Theory 55, 5840–5847 (2009) arXiv:0811.1221
Tomamichel, M., Lim, C.C.W., Gisin, N., Renner, R.: Tight finite-key analysis for quantum cryptography. Nat. Comm. 3, 634 (2012)
Vadhan, S.: Pseudorandomness
Vadhan, S.: Constructing locally computable extractors and cryptosystems in the bounded-storage model. J. Cryptol. 17, 43–77 (2004)
Wehner, S., Schaffner, C., Terhal, B.: Cryptography from noisy storage. Phys. Rev. Lett 100, 220502 (2008) arXiv:0711.2895
Wehner, S., Winter, A.: Entropic uncertainty relations—a survey. New J. Phys. 12, 025009 (2010) arXiv:0907.3704
Wullschleger, J.: Bitwise quantum min-entropy sampling and new lower bounds for random access codes (2010) arXiv:1012.2291
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 International Association for Cryptologic Research
About this paper
Cite this paper
Dupuis, F., Fawzi, O., Wehner, S. (2013). Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling. In: Canetti, R., Garay, J.A. (eds) Advances in Cryptology – CRYPTO 2013. CRYPTO 2013. Lecture Notes in Computer Science, vol 8043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40084-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-40084-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40083-4
Online ISBN: 978-3-642-40084-1
eBook Packages: Computer ScienceComputer Science (R0)