Composing Quantum Protocols in a Classical Environment

Abstract

We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple quantum- information-theoretic conditions which must be satisfied by the protocol to be secure. The conditions are uniquely determined by the ideal functionality $\mathcal{F}$ defining the cryptographic task to be implemented. We then show the following composition result. If quantum protocols π ₁,...,π _ℓ securely implement ideal functionalities $\mathcal{F}_1,\ldots,\mathcal{F}_\ell$ according to our security definition, then any purely classical two-party protocol, which makes sequential calls to $\mathcal{F}_1,\ldots,\mathcal{F}_\ell$, is equally secure as the protocol obtained by replacing the calls to $\mathcal{F}_1,\ldots,\mathcal{F}_\ell$ with the respective quantum protocols π ₁,...,π _ℓ. Hence, our approach yields the minimal security requirements which are strong enough for the typical use of quantum protocols as subroutines within larger classical schemes. Finally, we show that recently proposed quantum protocols for secure identification and oblivious transfer in the bounded-quantum-storage model satisfy our security definition, and thus compose in the above sense.

The original version of the book was revised: The copyright line was incorrect. The Erratum to the book is available at DOI: 10.1007/978-3-642-00457-5_36

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.