[en] Can quantum entanglement increase the capacity of (classical) covert channels? To one familiar with Holevo's Theorem it is tempting to think that the answer is obviously no. However, in this work we show: quantum entanglement can in fact increase the capacity of a classical covert channel, in the presence of an active adversary; on the other hand, a zero-capacity channel is not improved by entanglement, so entanglement cannot create `purely quantum' covert channels; the problem of determining the capacity of a given channel in the presence of entanglement is undecidable; but there is an algorithm to bound the entangled capacity of a channel from above, adapted from the semi-definite hierarchy from the theory of non-local games, whose close connection to channel capacity is at the core of all of our results.
Centre de recherche :
Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Applied Security and Information Assurance Group (APSIA)
Disciplines :
Sciences informatiques
Auteur, co-auteur :
MESTEL, David ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > APSIA
Co-auteurs externes :
no
Langue du document :
Anglais
Titre :
Beware of Greeks bearing entanglement? Quantum covert channels, information flow and non-local games
Date de publication/diffusion :
2022
Nom de la manifestation :
IEEE CSF 2022
Date de la manifestation :
from 07-08-2022 to 10-08-2022
Titre de l'ouvrage principal :
35th IEEE Computer Security Foundations Symposium
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
Projet FnR :
FNR11106658 - Secure Voting Technologies, 2015 (01/10/2016-30/09/2021) - Peter Y. A. Ryan
A. S. Holevo, "Some estimates for the amount of information transmittable by a quantum communications channel, " Problemy Peredaci Informacii, vol. 9, no. 3, pp. 3-11, 1973.
J. A. Goguen and J. Meseguer, "Security policies and security models, " in 1982 IEEE Symposium on Security and Privacy. IEEE, 1982, pp. 11-20.
J. W. Gray, III, "Toward a mathematical foundation for information flow security, " J. Comput. Secur., vol. 1, no. 3-4, pp. 255-294, May 1992. [Online]. Available: http://dl. acm. org/citation. cfm?id=2699806. 2699811
G. Smith, "On the foundations of quantitative information flow, " in Proc. 12th Int. Conf. on Foundations of Software Science and Computational Structures (FOSSACS '09), 2009, pp. 288-302.
M. Alvim, K. Chatzikokolakis, A. McIver, C. Morgan, C. Palamidessi, and G. Smith, The Science of Quantitative Information Flow, ser. Information Security and Cryptography. United States: Springer, Springer Nature, 2020.
Z. Ji, A. Natarajan, T. Vidick, J. Wright, and H. Yuen, "MIP=RE, " 2020. [Online]. Available: https://arxiv. org/abs/2001. 04383
M. Navascués, S. Pironio, and A. Acín, "A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations, " New Journal of Physics, vol. 10, no. 7, p. 073013, 2008.
A. Américo and P. Malacaria, "QQIF: Quantum quantitative information flow, " in 2020 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW). IEEE, 2020, pp. 261-270.
M. M. Wilde, Quantum information theory. Cambridge University Press, 2013.
L. Gyongyosi, S. Imre, and H. V. Nguyen, "A survey on quantum channel capacities, " IEEE Communications Surveys & Tutorials, vol. 20, no. 2, pp. 1149-1205, 2018.
D. Mestel, "Quantifying information flow in interactive systems, " in 2019 IEEE 32nd Computer Security Foundations Symposium (CSF). IEEE, 2019, pp. 414-427.
M. S. Alvim, K. Chatzikokolakis, Y. Kawamoto, and C. Palamidessi, "Information leakage games, " in International Conference on Decision and Game Theory for Security. Springer, 2017, pp. 437-457.
M. S. Alvim, K. Chatzikokolakis, A. McIver, C. Morgan, C. Palamidessi, and G. Smith, "Axioms for information leakage, " in 2016 IEEE 29th Computer Security Foundations Symposium (CSF). IEEE, 2016, pp. 77-92.
M. S. Alvim, K. Chatzikokolakis, C. Palamidessi, and G. Smith, "Measuring information leakage using generalized gain functions, " in Proc. 25th IEEE Computer Security Foundations Symposium (CSF '12), June 2012, pp. 265-279.
T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. John Wiley & Sons, Inc., 2005.
B. Espinoza and G. Smith, "Min-entropy as a resource, " Information and Computation, vol. 226, pp. 57-75, 2013.
M. Nielsen and I. Chuang, "Quantum computation and quantum information, " 2000.
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, "Proposed experiment to test local hidden variable theories. " Physical Review Letters, vol. 23, pp. 880-884, 1969.
M. Junge, M. Navascues, C. Palazuelos, D. Perez-Garcia, V. B. Scholz, and R. F. Werner, "Connes' embedding problem and tsirelson's problem, " Journal of Mathematical Physics, vol. 52, no. 1, p. 012102, 2011.
A. Connes, "Classification of injective factors cases II1, II, III=1, " Annals of Mathematics, pp. 73-115, 1976.
H. Wolkowicz, R. Saigal, and L. Vandenberghe, Handbook of semidefinite programming: Theory, algorithms, and applications. Springer Science & Business Media, 2012, vol. 27.
C. Braun, K. Chatzikokolakis, and C. Palamidessi, "Quantitative notions of leakage for one-try attacks, " Electronic Notes in Theoretical Computer Science, vol. 249, pp. 75-91, 2009, proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009). [Online]. Available: http://www. sciencedirect. com/science/article/pii/S1571066109003077
