Asymptotically secure All-or-nothing Quantum Oblivious Transfer

Abstract

We present a device independently secure quantum scheme for p-threshold all-or-nothing oblivious transfer. Novelty of the scheme is that, its security does not depend -- unlike the usual case -- on any quantum bit commitment protocol, rather it depends on Hardy's argument for two-qubit system. This scheme is shown to be unconditionally secure against any strategy allowed by quantum mechanics. By providing a secure scheme for all-or-nothing quantum oblivious transfer, we have answered a long standing open problem, other than the quantum key distribution, whether there is any two-party quantum cryptographic protocol, which is unconditionally secure.

arXiv comment8 pages, 1 figure

References in corpus (15)

• Unconditionally secure quantum bit commitment is impossible
• Is Quantum Bit Commitment Really Possible?
• Fully device independent quantum key distribution
• Insecurity of Quantum Secure Computations
• Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
• Device-independent bounds for Hardy's experiment
• Oblivious transfer using quantum entanglement
• Spacetime-constrained oblivious transfer
• Impossibility of Growing Quantum Bit Commitments
• Practical and unconditionally secure spacetime-constrained oblivious transfer
• A device-independent protocol for XOR oblivious transfer
• Quantum Byzantine Agreement via Hardy correlations and entanglement swapping
• The relationship between two flavors of oblivious transfer at the quantum level
• One-out-of-$m$ spacetime-constrained oblivious transfer
• Oblivious transfer based on quantum state computational distinguishability