Spacetime-constrained oblivious transfer

Abstract

In 1-out-of-2 oblivious transfer (OT), Alice inputs numbers x_0, x_1, Bob inputs a bit b and outputs x_b. Secure OT requires that Alice and Bob learn nothing about b and x_{\bar{b}}, respectively. We define spacetime-constrained oblivious transfer (SCOT) as OT in Minkowski spacetime in which Bob must output x_b within R_b, where R_0 and R_1 are fixed spacelike separated spacetime regions. We show that unconditionally secure SCOT is impossible with classical protocols in Minkowski (or Galilean) spacetime, or with quantum protocols in Galilean spacetime. We describe a quantum SCOT protocol in Minkowski spacetime, and we show it unconditionally secure.

arXiv commentImproved theorem on the impossibility of classical SCOT to allow for small errors. Figure added and discussion extended in response to referee comments. Protocol and security proof unaltered. Final version

References in corpus (30)

• Unconditionally secure quantum bit commitment is impossible
• Is Quantum Bit Commitment Really Possible?
• Quantum cloning
• Insecurity of Quantum Secure Computations
• Unconditionally Secure Bit Commitment
• Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
• Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
• A Monogamy-of-Entanglement Game With Applications to Device-Independent Quantum Cryptography
• Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints
• Experimental bit commitment based on quantum communication and special relativity
• Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
• Unconditionally Secure Bit Commitment with Flying Qudits
• Position-Based Quantum Cryptography: Impossibility and Constructions
• The Impossibility Of Secure Two-Party Classical Computation
• Location-Dependent Communications using Quantum Entanglement
• Experimental unconditionally secure bit commitment
• Quantum Tasks in Minkowski Space
• Coin Tossing is Strictly Weaker Than Bit Commitment
• Practical relativistic bit commitment
• Secure bit commitment from relativistic constraints
• Quantum Tagging for Tags Containing Secret Classical Data
• Device-Independent Relativistic Quantum Bit Commitment
• Location-Oblivious Data Transfer with Flying Entangled Qudits
• A Quantum Paradox of Choice: More Freedom Makes Summoning a Quantum State Harder
• Variable Bias Coin Tossing
• Security Details for Bit Commitment by Transmitting Measurement Outcomes
• A No-summoning theorem in Relativistic Quantum Theory
• Arbitrarily long relativistic bit commitment
• Deterministic Relativistic Quantum Bit Commitment
• Secure and Robust Transmission and Verification of Unknown Quantum States in Minkowski Space

Cited by in corpus (17)

• Quantum cryptography: key distribution and beyond
• Imperfect 1-out-of-2 quantum oblivious transfer: bounds, a protocol, and its experimental implementation
• Practical and unconditionally secure spacetime-constrained oblivious transfer
• Provably-secure symmetric private information retrieval with quantum cryptography
• Multiphoton and side-channel attacks in mistrustful quantum cryptography
• One-out-of-$m$ spacetime-constrained oblivious transfer
• Quantum cryptography beyond key distribution: theory and experiment
• Non-interactive XOR quantum oblivious transfer: optimal protocols and their experimental implementations
• Unconditionally secure relativistic multi-party biased coin flipping and die rolling
• Localizing and excluding quantum information; or, how to share a quantum secret in spacetime
• Quantum Rabin oblivious transfer using two pure states
• Performance of Practical Quantum Oblivious Key Distribution
• Distributing bipartite quantum systems under timing constraints
• Quantum oblivious transfer: a short review
• Cryptanalysis and improvement of Wu-Cai-Wu-Zhang's quantum private comparison protocol
• Incomplete quantum oblivious transfer with perfect one-sided security
• Asymptotically secure All-or-nothing Quantum Oblivious Transfer