Secure quantum weak oblivious transfer against individual measurements

DOI10.1007/S11128-015-0970-8MaRDI QIDQ2355619zbMATH OpenOpenAlexFDO

Authors Guang Ping He

Publication date 24 July 2015

Published in Quantum Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

communication securityquantum communicationquantum cryptographyquantum oblivious transfer

Mathematics Subject Classification ID

Quantum measurement theory, state operations, state preparations (81P15) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

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_{Alice}^{ast}+P_{Bob}^{ast}geq2$, where $P_{Alice}^{ast}$ is the probability with which Alice can guess Bob's choice, and $P_{Bob}^{ast}$ 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_{Alice}^{ast}$ and $P_{Bob}^{ast}$ can be made arbitrarily close to 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.

Recommendations

• Optimal bounds for semi-honest quantum oblivious transfer
• Lower bounds for quantum oblivious transfer
• Quantum oblivious transfer: a secure practical implementation
• Coherent attack on oblivious transfer based on single-qubit rotations
• Comment on ``Quantum oblivious transfer: a secure practical implementation

Cites work

• scientific article; zbMATH DE number 3856987 (Why is no real title available?)
• Lower bounds for quantum oblivious transfer
• On the power of two-party quantum cryptography
• Optimal bounds for semi-honest quantum oblivious transfer
• Quantum key distribution based on orthogonal states allows secure quantum bit commitment

Cited in

(6)

• Flexible quantum oblivious transfer
• Comment on ``Quantum oblivious transfer: a secure practical implementation
• Lower bounds for quantum oblivious transfer
• Randomized quantum oblivious transfer with application in hacker-resistant computation
• Coherent attack on oblivious transfer based on single-qubit rotations
• Quantum oblivious transfer with relaxed constraints on the receiver

This page was built for publication: Secure quantum weak oblivious transfer against individual measurements

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