Composable and finite computational security of quantum message transmission

DOI10.1007/978-3-030-36030-6_12MaRDI QIDQ2175915zbMATH OpenOpenAlexFDO

Authors Fabio Banfi, Christopher Portmann, Ueli M. Maurer, Jiamin Zhu

Publication date 30 April 2020

Full work available at URL https://arxiv.org/abs/1908.03436

zbMATH Keywords

quantum cryptographysecure quantum message transmission

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Communication theory (94A05) Cryptography (94A60)

Abstract: Recent research in quantum cryptography has led to the development of schemes that encrypt and authenticate quantum messages with computational security. The security definitions used so far in the literature are asymptotic, game-based, and not known to be composable. We show how to define finite, composable, computational security for secure quantum message transmission. The new definitions do not involve any games or oracles, they are directly operational: a scheme is secure if it transforms an insecure channel and a shared key into an ideal secure channel from Alice to Bob, i.e., one which only allows Eve to block messages and learn their size, but not change them or read them. By modifying the ideal channel to provide Eve with more or less capabilities, one gets an array of different security notions. By design these transformations are composable, resulting in composable security. Crucially, the new definitions are finite. Security does not rely on the asymptotic hardness of a computational problem. Instead, one proves a finite reduction: if an adversary can distinguish the constructed (real) channel from the ideal one (for some fixed security parameters), then she can solve a finite instance of some computational problem. Such a finite statement is needed to make security claims about concrete implementations. We then prove that (slightly modified versions of) protocols proposed in the literature satisfy these composable definitions. And finally, we study the relations between some game-based definitions and our composable ones. In particular, we look at notions of quantum authenticated encryption and QCCA2, and show that they suffer from the same issues as their classical counterparts: they exclude certain protocols which are arguably secure.

Recommendations

• Computational Security of Quantum Encryption
• Composing Quantum Protocols in a Classical Environment
• Unforgeable quantum encryption
• On the computational security of quantum algorithms for transformation of information
• Entropic security in quantum cryptography

Cites work

• Advances in Cryptology - CRYPTO 2003
• Characterization of security notions for probabilistic private-key encryption
• Composable security of delegated quantum computation
• Computational Security of Quantum Encryption
• Confidentiality and integrity: a constructive perspective
• Constructing confidential channels from authenticated channels-public-key encryption revisited
• Constructive cryptography -- a new paradigm for security definitions and proofs
• From Indifferentiability to Constructive Cryptography (and Back)
• scientific article; zbMATH DE number 1583804 (Why is no real title available?)
• scientific article; zbMATH DE number 1302836 (Why is no real title available?)
• scientific article; zbMATH DE number 2086702 (Why is no real title available?)
• scientific article; zbMATH DE number 1842499 (Why is no real title available?)
• scientific article; zbMATH DE number 6765508 (Why is no real title available?)
• Indistinguishability Amplification
• On a measure of distance for quantum strategies
• Quantum authentication with key recycling
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• SECURITY OF QUANTUM KEY DISTRIBUTION
• The operator tensor formulation of quantum theory
• The reactive simulatability (RSIM) framework for asynchronous systems
• Theoretical framework for quantum networks
• Theory of Cryptography
• Theory of Cryptography
• Towards a general theory of quantum games
• Unforgeable quantum encryption
• Universally composable quantum multi-party computation
• Universally Composable Security with Global Setup

Cited in

(2)

• Composable security of unidimensional continuous-variable quantum key distribution
• An efficient combination of quantum error correction and authentication

This page was built for publication: Composable and finite computational security of quantum message transmission

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175915)