Security proof for qudit-system-based quantum cryptography against
entanglement-measurement attack
- URL: http://arxiv.org/abs/2012.14275v2
- Date: Tue, 9 Mar 2021 12:43:31 GMT
- Title: Security proof for qudit-system-based quantum cryptography against
entanglement-measurement attack
- Authors: Zhaoxu Ji, Peiru Fan, Huanguo Zhang
- Abstract summary: Entanglement-measurement attack is a well-known attack in quantum cryptography.
In quantum cryptography protocols, eavesdropping checking can resist this attack.
We prove the security against entanglement-measurement attack for the qudit-system-based quantum cryptography protocols.
- Score: 0.294656234307089
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Entanglement-measurement attack is a well-known attack in quantum
cryptography. In quantum cryptography protocols, eavesdropping checking can
resist this attack. There are two known eavesdropping checking methods. One is
to use decoy photon technology for eavesdropping checking. The other is to use
the entanglement correlation of two groups of non-orthogonal entangled states
for eavesdropping checking. In this paper, we prove the security against
entanglement-measurement attack for the qudit-system-based quantum cryptography
protocols which use the two methods for eavesdropping checking. Our security
proof is useful to improve the eavesdropping checking method used in quantum
cryptography protocols.
Related papers
- Post Quantum Cryptography & its Comparison with Classical Cryptography [0.0]
Quantum cryptography operates on the principles of quantum mechanics, offering a new frontier in secure communication.
By contrasting quantum cryptography with its classical counterpart, it becomes evident how quantum mechanics revolutionizes the landscape of secure communication.
arXiv Detail & Related papers (2024-03-28T10:38:13Z) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography.
In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
arXiv Detail & Related papers (2022-05-07T03:15:15Z) - Secure quantum dialogue via cavity QED [0.0]
A secure quantum dialogue protocol via cavity QED is suggested by using the evolution law of atom in cavity QED.
The present protocol avoids the information leakage problem by using the entanglement swapping between any two Bell states via cavity QED.
arXiv Detail & Related papers (2022-05-05T03:10:22Z) - Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
We construct the first fully homomorphic encryption scheme with certified deletion.
Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
arXiv Detail & Related papers (2022-03-03T10:07:32Z) - A practical quantum encryption protocol with varying encryption
configurations [0.0]
We propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks oftext ciphers based on quantum states.
The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks.
arXiv Detail & Related papers (2021-01-22T20:09:03Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z) - Detector blinding attacks on counterfactual quantum key distribution [0.0]
Counterfactual quantum key distribution protocols allow two sides to establish a common secret key.
Part of the quantum state used to establish each bit never leaves the transmitting side, which hinders some attacks.
We present two attacks that use this ability to compromise the security of counterfactual quantum key distribution.
arXiv Detail & Related papers (2020-11-05T07:41:39Z) - Single-Shot Secure Quantum Network Coding for General Multiple Unicast
Network with Free One-Way Public Communication [56.678354403278206]
We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network.
Our code correctly transmits quantum states when there is no attack.
It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
arXiv Detail & Related papers (2020-03-30T09:25:13Z) - Backflash Light as a Security Vulnerability in Quantum Key Distribution
Systems [77.34726150561087]
We review the security vulnerabilities of quantum key distribution (QKD) systems.
We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
arXiv Detail & Related papers (2020-03-23T18:23:12Z) - Asymptotic security analysis of teleportation based quantum cryptography [0.0]
We prove that the teleportation based quantum cryptography protocol presented in [Opt. Commun 283, 184] is secure against all types of individual and collective attacks.
We then investigate modifications to that protocol leading to greater secret-key rates and to security against coherent attacks.
arXiv Detail & Related papers (2020-02-10T17:54:15Z)
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.