Asymptotically secure All-or-nothing Quantum Oblivious Transfer
This solves a foundational problem in quantum cryptography by providing the first unconditionally secure two-party protocol for all-or-nothing oblivious transfer, which is not incremental but addresses a core theoretical challenge.
The paper tackles the problem of achieving unconditionally secure all-or-nothing quantum oblivious transfer without relying on quantum bit commitment, instead using Hardy's argument for two-qubit systems. The result is a scheme proven unconditionally secure against any quantum strategy, answering a long-standing open problem about two-party quantum cryptographic protocols beyond quantum key distribution.
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.