A simple practical quantum bit commitment protocol
- URL: http://arxiv.org/abs/2009.13263v3
- Date: Sun, 11 May 2025 19:17:59 GMT
- Title: A simple practical quantum bit commitment protocol
- Authors: Muqian Wen,
- Abstract summary: 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.<n>It will be infinitely close to being unconditionally fully secure although neither perfectly binding nor perfectly concealing.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: 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 secure although neither perfectly binding nor perfectly concealing.
Related papers
- Sequential Entanglement-Swapping assisted by Quantum Protocol over Ethernet Networks [33.41459442049189]
We show the potential of combining classical and quantum technologies for efficient, scalable quantum networking.
Some novel protocols enable reliable end-to-end quantum entanglement over Ethernet.
arXiv Detail & Related papers (2025-02-26T10:01:28Z) - Secure quantum bit commitment from separable operations [0.0]
We show that imposing a restriction on the committing party to perform only separable operations enables secure quantum bit commitment schemes.
Specifically, we prove that in any perfectly hiding bit commitment protocol, an honestly-committing party limited to separable operations will be detected with high probability if they attempt to alter their commitment.
arXiv Detail & Related papers (2025-01-13T14:15:11Z) - Towards efficient and secure quantum-classical communication networks [47.27205216718476]
There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC)
We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution.
We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
arXiv Detail & Related papers (2024-11-01T23:36:19Z) - Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
arXiv Detail & Related papers (2024-10-17T09:49:29Z) - Orthogonal-state-based Measurement Device Independent Quantum Communication [32.244698777387995]
We propose a new protocol of measurement-device-independent quantum secure direct communication and quantum dialogue employing single basis, i.e., Bell basis as decoy qubits for eavesdropping detection.
Our protocols leverage fundamentally distinct resources to close the security loopholes linked to measurement devices, while also effectively doubling the distance for secure direct message transmission.
arXiv Detail & Related papers (2024-09-30T15:57:17Z) - Improving entanglement purification through coherent superposition of roles [44.99833362998488]
Entanglement purification and distillation protocols are essential for harnessing the full potential of quantum communication technologies.
We introduce a superposed entanglement purification design strategy, leveraging coherent superpositions of the roles of entangled states to enhance purification efficiency.
arXiv Detail & Related papers (2024-08-01T18:00:52Z) - Protocols for Quantum Weak Coin Flipping [0.1499944454332829]
Weak coin flipping is an important cryptographic primitive.
We give exact constructions of related unitary operators.
We illustrate the construction of explicit weak coin flipping protocols.
arXiv Detail & Related papers (2024-02-24T16:52:54Z) - Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement [33.2699333323263]
We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs.
The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol.
We present the results of implementing the protocol in a computer simulation based on the NetSquid framework.
arXiv Detail & Related papers (2023-09-06T08:48:07Z) - Collective attack free controlled quantum key agreement without quantum
memory [0.0]
We present a new protocol for controlled quantum key agreement and another protocol for key agreement with a specific focus on the security analysis.
Specifically, detailed security proof is provided against impersonated fraudulent attack and collective attacks.
arXiv Detail & Related papers (2023-08-10T09:51:23Z) - Robust and efficient verification of graph states in blind
measurement-based quantum computation [52.70359447203418]
Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients.
It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario.
Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
arXiv Detail & Related papers (2023-05-18T06:24:45Z) - One-Time Universal Hashing Quantum Digital Signatures without Perfect
Keys [24.240914319917053]
We show that imperfect quantum keys with limited information leakage can be used for digital signatures and authentication without compromising security.
This study significantly reduces the delay for data postprocessing and is compatible with any quantum key generation protocols.
arXiv Detail & Related papers (2023-01-03T14:54:27Z) - Single-photon-memory measurement-device-independent quantum secure
direct communication [63.75763893884079]
Quantum secure direct communication (QSDC) uses the quantum channel to transmit information reliably and securely.
In order to eliminate the security loopholes resulting from practical detectors, the measurement-device-independent (MDI) QSDC protocol has been proposed.
We propose a single-photon-memory MDI QSDC protocol (SPMQC) for dispensing with high-performance quantum memory.
arXiv Detail & Related papers (2022-12-12T02:23:57Z) - Conference key agreement in a quantum network [67.410870290301]
Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state.
In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
arXiv Detail & Related papers (2022-07-04T18:00:07Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Anonymous multi-party quantum computation with a third party [0.8356765961526955]
We show that the protocol is an anonymous multi-party quantum addition protocol rather than a secure multi-party quantum addition protocol.
We propose a new anonymous multiparty quantum protocol based on our original protocol.
arXiv Detail & Related papers (2021-10-23T14:27:12Z) - Unbalanced-basis-misalignment tolerant measurement-device-independent
quantum key distribution [22.419105320267523]
Measurement-device-independent quantum key distribution (MDIQKD) is a revolutionary protocol since it is physically immune to all attacks on the detection side.
Some protocols release part of the assumptions in the encoding system to keep the practical security, but the performance would be dramatically reduced.
We present a MDIQKD protocol that requires less knowledge of encoding system to combat the troublesome modulation errors and fluctuations.
arXiv Detail & Related papers (2021-08-27T02:16:20Z) - Remote quantum-safe authentication of entities with physical unclonable
functions [0.0]
We discuss the requirements that an entity authentication protocol has to offer in order to be useful for remote entity authentication in practice.
We propose a protocol, which can operate over large distances, and offers security against both classical and quantum adversaries.
arXiv Detail & Related papers (2021-08-01T15:03:23Z) - Quantum Secure Direct Communication with Mutual Authentication using a
Single Basis [2.9542356825059715]
We propose a new theoretical scheme for quantum secure direct communication (QSDC) with user authentication.
The present protocol uses only one orthogonal basis of single-qubit states to encode the secret message.
We discuss the security of the proposed protocol against some common attacks and show that no eaves-dropper can get any information from the quantum and classical channels.
arXiv Detail & Related papers (2021-01-10T16:32:42Z) - Representation matching for delegated quantum computing [64.67104066707309]
representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network.
We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
arXiv Detail & Related papers (2020-09-14T18:07:43Z) - Lightweight Quantum Security Protocols [0.0]
This paper defines the lightweight quantum security protocols, in which lightweight participants can only operate two out of four very lightweight quantum operations.
It proposes a Lightweight Mediated Quantum Key Distribution (LMQKD) protocol as an example to disclose the feasibility and advantage of the lightweight quantum protocol.
arXiv Detail & Related papers (2020-07-11T16:11:56Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.