DeepAI AI Chat
Log In Sign Up

Asymptotically secure All-or-nothing Quantum Oblivious Transfer

by   Ramij Rahaman, et al.
Indian Statistical Instiute, Kolkata

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.


page 1

page 2

page 3

page 4


Secure Multi-Party Quantum Conference and Xor Computation

Quantum conference is a process of securely exchanging messages between ...

Supersingular Isogeny Oblivious Transfer

We present an oblivious transfer (OT) protocol that combines the OT sche...

Quantum Merkle Trees

Commitment scheme is a central task in cryptography, where a party (typi...

QKD in Isabelle -- Bayesian Calculation

In this paper, we present a first step towards a formalisation of the Qu...

Quantum Money Generated by Multiple Untrustworthy Banks

While classical money can be copied, it is impossible to copy quantum mo...

Efficient Multilinear Map from Graded Encoding Scheme

Though the multilinear maps have many cryptographic applications, secure...

a quantum secure multiparty computation protocol for least common multiple

In this paper, we present a secure multiparty computation (SMC) protocol...