相关论文: Insecurity of Quantum Bit Commitment with Secret P…

Oblivious transfer (OT) is an important cryptographic primitive. Any multi-party computation can be realised with OT as building block. XOR oblivious transfer (XOT) is a variant where the sender Alice has two bits, and a receiver Bob…

Using a neutron double-slit setup, we construct a quantum bit commitment scheme in which time development of quantum states plays an essential role. Our scheme evades the widely accepted no-go theorem by the fact that it is neither possible…

Quantum gambling --- a secure remote two-party protocol which has no classical counterpart --- is demonstrated through optical approach. A photon is prepared by Alice in a superposition state of two potential paths. Then one path leads to…

A simple un-entanglement based quantum bit commitment scheme is presented. Although commitment is unconditionally secure but concealment is not.

We propose an efficient quantum protocol performing quantum bit commitment, which is a simple cryptographic primitive involved with two parties, called a committer and a verifier. Our protocol is non-interactive, uses no supplemental shared…

Einstein-Podolsky-Rosen- (EPR) and the more powerful Mayers-Lo-Chau attack impose a serious constraint on quantum bit commitment (QBC). As a way to circumvent them, it is proposed that the quantum system encoding the commitment chosen by…

In the task cryptographers call bit commitment, one party encrypts a prediction in a way that cannot be decrypted until they supply a key, but has only one valid key. Bit commitment has many applications, and has been much studied, but…

Bit commitment is a fundamental cryptographic primitive with numerous applications. Quantum information allows for bit commitment schemes in the information theoretic setting where no dishonest party can perfectly cheat. The previously…

In this Paper, we investigate the security of Zhang, Li and Guo quantum key distribution via quantum encryption protocol [$\text{Phys. Rev. A} \textbf{64}, 24302 (2001)$] and show that it is not secure against some of Eve's attacks and with…

Oblivious transfer has been the interest of study as it can be used as a building block for multiparty computation. There are many forms of oblivious transfer; we explore a variant known as Rabin oblivious transfer. Here the sender Alice…

The cryptographic protocol of coin tossing consists of two parties, Alice and Bob, that do not trust each other, but want to generate a random bit. If the parties use a classical communication channel and have unlimited computational…

It has been conjectured that counterfactual communication is impossible, even for post-selected quantum particles. We strongly challenge this by proposing precisely such a counterfactual scheme where -- unambiguously -- none of Alice's…

Unconditionally secure quantum bit commitment (QBC) was considered impossible. But the no-go proofs are based on the Hughston-Jozsa-Wootters (HJW) theorem (a.k.a. the Uhlmann theorem). Recently it was found that in high-dimensional systems,…

Due to the commonly known impossibility results, unconditional security for oblivious transfer is seen as impossible even in the quantum world. In this paper, we try to overcome these impossibility results by proposing a protocol which is…

We present a quantum digital signature scheme whose security is based on fundamental principles of quantum physics. It allows a sender (Alice) to sign a message in such a way that the signature can be validated by a number of different…

This paper devises a simple quantum bit commitment protocol that is just as easy to implement as any existing practical quantum bit commitment protocols but will be more secure. It will be infinitely close to being unconditionally fully…

We describe new unconditionally secure bit commitment schemes whose security is based on Minkowski causality and the monogamy of quantum entanglement. We first describe an ideal scheme that is purely deterministic, in the sense that neither…

Quantum secure direct communication is one of the important mode of quantum communication, which sends secret information through a quantum channel directly without setting up a prior key. Over the past decade, numerous protocols have been…

We consider a setup in which the channel from Alice to Bob is less noisy than the channel from Eve to Bob. We show that there exist encoding and decoding which accomplish error correction and authentication simultaneously; that is, Bob is…

Employing the fundamental laws of quantum physics, Quantum Key Distribution (QKD) promises the unconditionally secure distribution of cryptographic keys. However, in practical realisations, a QKD protocol is only secure, when the quantum…