Related papers: Unconditionally secure bit commitment by causally …

In usual security proofs of quantum protocols the adversary (Eve) is expected to have full control over any quantum communication between any communicating parties (Alice and Bob). Eve is also expected to have full access to an…

We spell out details of a simple argument for a security bound for the secure relativistic quantum bit commitment protocol of Ref. [1].

We give a simple proof that it is impossible to guarantee the classicality of inputs into any mistrustful quantum cryptographic protocol. The argument illuminates the impossibility of unconditionally secure quantum implementations of…

We define cheat sensitive cryptographic protocols between mistrustful parties as protocols which guarantee that, if either cheats, the other has some nonzero probability of detecting the cheating. We give an example of an unconditionally…

Quantum mechanics allows operations to be in indefinite causal order. Recently there have been active discussions on enhanced communication strategies through exotic causal structures. In light of this, through the process matrix formalism,…

It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of…

We investigate the existence of secure bit commitment protocols in the convex framework for probabilistic theories. The framework makes only minimal assumptions, and can be used to formalize quantum theory, classical probability theory, and…

Bit commitment protocols whose security is based on the laws of quantum mechanics alone are generally held to be impossible. In this paper we give a strengthened and explicit proof of this result. We extend its scope to a much larger…

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…

The `no communication' theorem prohibits superluminal communication by showing that any measurement by Alice on an entangled system cannot change the reduced density matrix of Bob's state, and hence the expectation value of any measurement…

Using unstable particles which decay by emitting neutrinos, we propose a quantum bit commitment protocol that is humanly impossible to break. Neutrinos carry away quantum information, but their interaction with matter is so weak that it…

The commitment of bits between two mutually distrustful parties is a powerful cryptographic primitive with which many cryptographic objectives can be achieved. It is widely believed that unconditionally secure quantum bit commitment is…

A crucial task for secure communication networks is to determine the minimum of physical requirements to certify a cryptographic protocol. A widely accepted candidate for certification is the principle of relativistic causality which is…

A theoretical scheme for controlled and secure direct communication is proposed. The communication is based on GHZ state and controlled quantum teleportation. After insuring the security of the quantum channel (a set of qubits in the GHZ…

Oblivious transfer (OT) is an important tool in cryptography. It serves as a subroutine to other complex procedures of both theoretical and practical significance. Common attribute of OT protocols is that one party (Alice) has to send a…

Quantum cryptography shows that one can guarantee the secrecy of correlation on the sole basis of the laws of physics, that is without limiting the computational power of the eavesdropper. The usual security proofs suppose that the…

Quantum bit commitment has long been known to be impossible. Nevertheless, just as in the classical case, imposing certain constraints on the power of the parties may enable the construction of asymptotically secure protocols. Here, we…

We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for…

The position of a device or agent is an important security credential in today's society, both online and in the real world. Unless in direct proximity, however, the secure verification of a position is impossible without further…

Spacetime-constrained oblivious transfer (SCOT) extends the fundamental primitive of oblivious transfer to Minkowski space. SCOT and location oblivious data transfer (LODT) are the only known cryptographic tasks with classical inputs and…