Two-Party Quantum Protocols Do Not Compose Securely Against Honest-But-Curious Adversaries

Details Two-Party Quantum Protocols Do Not Compose Securely Against Honest-But-Curious Adversaries Two-Party Quantum Protocols Do Not Compose Securely Against Honest-But-Curious Adversaries

2009-06-09

arxiv.org/abs/0906.1671v2

Physics

Quantum Physics

20 pages

Scientific paper

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 \Pi, calling any non-trivial sub-protocol \pi 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 \pi. In order to achieve this, we assign a real value called "payoff" to any strategy for \Pi and show that that there is a gap between the highest payoff achievable by coherent and local strategies.

Affiliated with

Also associated with

No associations

Rating

Two-Party Quantum Protocols Do Not Compose Securely Against Honest-But-Curious Adversaries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two-Party Quantum Protocols Do Not Compose Securely Against Honest-But-Curious Adversaries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-Party Quantum Protocols Do Not Compose Securely Against Honest-But-Curious Adversaries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-64770