English
Related papers

Related papers: A simple practical quantum bit commitment protocol

200 papers

We consider the problem of hiding sender and receiver of classical and quantum bits (qubits), even if all physical transmissions can be monitored. We present a quantum protocol for sending and receiving classical bits anonymously, which is…

Quantum Physics · Physics 2007-05-23 Matthias Christandl , Stephanie Wehner

In the medium term, quantum computing must tackle two key challenges: fault tolerance and security. Fault tolerance will be solved with sufficiently high quality experiments on large numbers of qubits, but the scale and complexity of these…

Quantum Physics · Physics 2024-04-11 Ethan Davies , Alastair Kay

In a world where elections touch every aspect of society, the need for secure voting is paramount. Traditional safeguards, based on classical cryptography, rely on complex math problems like factoring large numbers. However, quantum…

Quantum Physics · Physics 2024-07-01 Saiyam Sakhuja , S. Balakrishnan

We establish quantum uncloneable encryption with unconditional security, preventing two non-communicating adversaries from simultaneously decrypting a single ciphertext $-$ even when both are given the key. Our construction achieves…

Quantum Physics · Physics 2026-03-11 Archishna Bhattacharyya , Anne Broadbent , Eric Culf

In coin tossing two remote participants want to share a uniformly distributed random bit. At the least in the quantum version, each participant test whether or not the other has attempted to create a bias on this bit. It is requested that,…

Quantum Physics · Physics 2018-02-28 Dominic Mayers , Louis Salvail , Yoshie Chiba-Kohno

Oblivious transfer protocols (R-OT and OT$_{1}^{2}$) are presented based on non-orthogonal states transmission, and the bit commitment protocols on the top of OT$_{1}^{2}$ are constructed. Although these OT protocols are all unconditional…

Quantum Physics · Physics 2017-03-21 Li Yang

Quantum communication holds the promise of creating disruptive technologies that will play an essential role in future communication networks. For example, the study of quantum communication complexity has shown that quantum communication…

Quantum processes, such as quantum circuits, quantum memories, and quantum channels, are essential ingredients in almost all quantum information processing tasks. However, the characterization of these processes remains a daunting task due…

Quantum Physics · Physics 2020-04-16 Ye-Chao Liu , Jiangwei Shang , Xiao-Dong Yu , Xiangdong Zhang

A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and new sequences are ``refuelled'' from a shared provably…

Quantum Physics · Physics 2009-10-31 Miloslav Dusek , Ondrej Haderka , Martin Hendrych , Robert Myska

Quantum metrology and quantum communications are typically considered as distinct applications in the broader portfolio of quantum technologies. However, there are cases where we might want to combine the two and recent proposals have shown…

Quantum Physics · Physics 2023-02-08 Sean William Moore , Jacob Andrew Dunningham

While quantum computers promise significant advantages, the complexity of quantum algorithms remains a major technological obstacle. We have developed and demonstrated an architecture-independent technique that simplifies adding control…

The aim of this thesis project is to investigate the bit commitment protocol in the framework of operational probabilistic theories. In particular a careful study is carried on the feasibility of bit commitment in the non-local boxes…

Quantum Physics · Physics 2021-01-25 Lorenzo Giannelli

What does it mean to commit to a quantum state? In this work, we propose a simple answer: a commitment to quantum messages is binding if, after the commit phase, the committed state is hidden from the sender's view. We accompany this new…

Quantum Physics · Physics 2022-11-08 Sam Gunn , Nathan Ju , Fermi Ma , Mark Zhandry

In the literature, strong coin tossing protocols based on bit commitment have been proposed. Here we examine a protocol that instead tries to achieve the task by sharing entanglement securely. The protocol uses only qubits, and has bias…

Quantum Physics · Physics 2007-05-23 Roger Colbeck

We characterize the complete set of protocols that may be used to securely encrypt n quantum bits using secret and random classical bits. In addition to the application of such quantum encryption protocols to quantum data security, our…

Quantum Physics · Physics 2007-05-23 P. Oscar Boykin , Vwani Roychowdhury

This thesis initiates the study of cryptographic protocols in the bounded-quantum-storage model. On the practical side, simple protocols for Rabin Oblivious Transfer, 1-2 Oblivious Transfer and Bit Commitment are presented. No quantum…

Quantum Physics · Physics 2007-09-04 Christian Schaffner

This paper considers the use an entanglement breaking channel in the construction of a secure bit-commitment protocol. It is shown that this can be done via a depolarizing quantum channel.

Quantum Physics · Physics 2012-02-02 S. Arash Sheikholeslam , T. Aaron Gulliver

Relativistic cryptography exploits the fact that no information can travel faster than the speed of light in order to obtain security guarantees that cannot be achieved from the laws of quantum mechanics alone. Recently, Lunghi et al [Phys.…

Quantum Physics · Physics 2016-12-16 Kaushik Chakraborty , André Chailloux , Anthony Leverrier

We propose a new cryptographic protocol. It is suggested to encode information in ordinary binary form into many-qubit entangled states with the help of a quantum computer. A state of qubits (realized, e.g., with photons) is transmitted…

Quantum Physics · Physics 2016-09-08 K. V. Bayandin , G. B. Lesovik

A new interactive quantum zero-knowledge protocol for identity authentication implementable in currently available quantum cryptographic devices is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a…