Two-Party Quantum Protocols Do Not Compose Securely Against Honest-But-Curious Adversaries
arXiv:0906.1671
Abstract
In this paper, we build upon the model of two-party quantum computation introduced by Salvail et al. [SSS09] and show that in this model, only trivial correct two-party quantum protocols are weakly self-composable. We do so by defining a protocol Π, calling any non-trivial sub-protocol πN times and showing that there is a quantum honest-but-curious strategy that cannot be modeled by acting locally in every single copy of π. In order to achieve this, we assign a real value called "payoff" to any strategy for Πand show that that there is a gap between the highest payoff achievable by coherent and local strategies.
20 pages
References in corpus (7)
- Quantum Nonlocality without Entanglement
- Unconditionally secure quantum bit commitment is impossible
- Non-local correlations as an information theoretic resource
- Insecurity of Quantum Secure Computations
- Quantum State Separation, Unambiguous Discrimination and Exact Cloning
- Simulatable security for quantum protocols
- On the generalization of quantum state comparison