# Secure quantum weak oblivious transfer against individual measurements

Secure quantum weak oblivious transfer against individual measurements In quantum weak oblivious transfer, Alice sends Bob two bits and Bob can learn one of the bits at his choice. It was found that the security of such a protocol is bounded by $$2P_{\mathrm{Alice}}^{*}+P_{\mathrm{Bob}}^{*}\ge 2$$ 2 P Alice ∗ + P Bob ∗ ≥ 2 , where $$P_{\mathrm{Alice}}^{*}$$ P Alice ∗ is the probability with which Alice can guess Bob’s choice, and $$P_{\mathrm{Bob}}^{*}$$ P Bob ∗ is the probability with which Bob can guess both of Alice’s bits given that he learns one of the bits with certainty. Here we propose a protocol and show that as long as Alice is restricted to individual measurements, then both $$P_{\mathrm{Alice}}^{*}$$ P Alice ∗ and $$P_{\mathrm{Bob}}^{*}$$ P Bob ∗ can be made arbitrarily close to $$1/2$$ 1 / 2 , so that maximal violation of the security bound can be reached. Even with some limited collective attacks, the security bound can still be violated. Therefore, although our protocol still cannot break the bound in principle when Alice has unlimited cheating power, it is sufficient for achieving secure quantum weak oblivious transfer in practice. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

# Secure quantum weak oblivious transfer against individual measurements

, Volume 14 (6) – Mar 14, 2015
18 pages

/lp/springer_journal/secure-quantum-weak-oblivious-transfer-against-individual-measurements-UWsDsCfqw2
Publisher
Springer Journals
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-015-0970-8
Publisher site
See Article on Publisher Site

### Abstract

In quantum weak oblivious transfer, Alice sends Bob two bits and Bob can learn one of the bits at his choice. It was found that the security of such a protocol is bounded by $$2P_{\mathrm{Alice}}^{*}+P_{\mathrm{Bob}}^{*}\ge 2$$ 2 P Alice ∗ + P Bob ∗ ≥ 2 , where $$P_{\mathrm{Alice}}^{*}$$ P Alice ∗ is the probability with which Alice can guess Bob’s choice, and $$P_{\mathrm{Bob}}^{*}$$ P Bob ∗ is the probability with which Bob can guess both of Alice’s bits given that he learns one of the bits with certainty. Here we propose a protocol and show that as long as Alice is restricted to individual measurements, then both $$P_{\mathrm{Alice}}^{*}$$ P Alice ∗ and $$P_{\mathrm{Bob}}^{*}$$ P Bob ∗ can be made arbitrarily close to $$1/2$$ 1 / 2 , so that maximal violation of the security bound can be reached. Even with some limited collective attacks, the security bound can still be violated. Therefore, although our protocol still cannot break the bound in principle when Alice has unlimited cheating power, it is sufficient for achieving secure quantum weak oblivious transfer in practice.

### Journal

Quantum Information ProcessingSpringer Journals

Published: Mar 14, 2015

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations