Optimal bounds for semi-honest quantum oblivious transfer

DOI10.4086/CJTCS.2016.013MaRDI QIDQ2825307zbMATH OpenOpenAlexFDO

Authors André Chailloux, Gus Gutoski, Jamie Sikora

Publication date 7 October 2016

Published in Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

optimal boundsquantum oblivious transfersemi-honest security

Mathematics Subject Classification ID

Cryptography (94A60) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)

Abstract: Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum oblivious transfer protocols under a natural and demanding definition of what it means for Alice to cheat. Our lower bound is a smooth tradeoff between the probability B with which Bob can guess Alice's bit choice and the probability A with which Alice can guess both of Bob's bits given that she learns one of the bits with certainty. We prove that 2B + A is greater than or equal to 2 in any quantum protocol for oblivious transfer, from which it follows that one of the two parties must be able to cheat with probability at least 2/3. We prove that this bound is optimal by exhibiting a family of protocols whose cheating probabilities can be made arbitrarily close to any point on the tradeoff curve.

Recommendations

• Lower bounds for quantum oblivious transfer
• Quantum oblivious transfer with relaxed constraints on the receiver
• Quantum Oblivious Transfer
• Bounds on oblivious multiparty quantum communication complexity
• Quantum \(m\)-out-of-\(n\) oblivious transfer
• Quantum oblivious transfer: a secure practical implementation
• Almost optimal oblivious transfer from QA-NIZK
• Optimality of private quantum channels
• On the existence of loss-tolerant quantum oblivious transfer protocols
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions

Cites work

• Cryptographic distinguishability measures for quantum-mechanical states

Cited in

(9)

• Secure quantum weak oblivious transfer against individual measurements
• Quantum oblivious transfer: a secure practical implementation
• Oblivious transfer is in MiniQCrypt
• A new framework for quantum oblivious transfer
• scientific article; zbMATH DE number 7651039 (Why is no real title available?)
• New approaches to honesty theory and applications in quantum dynamical semigroups
• Fidelity of quantum strategies with applications to cryptography
• Quantum coin hedging, and a counter measure
• Lower bounds for quantum oblivious transfer

This page was built for publication: Optimal bounds for semi-honest quantum oblivious transfer

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