Asymptotic security analysis of teleportation based quantum cryptography

• URL: http://arxiv.org/abs/2002.03984v2
• Date: Mon, 8 Jun 2020 15:23:45 GMT
• Title: Asymptotic security analysis of teleportation based quantum cryptography
• Authors: Diogo Lima and Gustavo Rigolin
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We prove that the teleportation based quantum cryptography protocol presented in [Opt. Commun. 283, 184 (2010)], which is built using only orthogonal states encoding the classical bits that are teleported from Alice to Bob, is asymptotically 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. In other words, we show an unconditional secure quantum key distribution protocol that does not need non-orthogonal quantum states to encode the bits of the secret key sent from Alice to Bob. We also revisit the security proof of the BB84 protocol by exploring the non-uniqueness of the Schmidt decomposition of its entanglement-based representation. This allows us to arrive at a secure transmission of the key for a slightly greater quantum bit error rate (quantum communication channel's noise) when compared to its standard security analysis.

Related papers

• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs. This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Decoherence-assisted quantum key distribution [37.69303106863453]
  We show that our method reduces the amount of information that an eavesdropper can obtain in the BB84 protocol under the entangling probe attack. We demonstrate experimentally that Alice and Bob can agree on a scheme to that gives low values of the quantum bit error rate.
  arXiv  Detail & Related papers  (2024-05-30T15:28:07Z)
• The Quantum Cryptography Approach: Unleashing the Potential of Quantum Key Reconciliation Protocol for Secure Communication [7.318072482453136]
  Quantum Key Distribution (QKD) has been recognized as the most important breakthrough in quantum cryptography. This paper proposes a novel method that allows users to communicate while generating the secure keys and securing the transmission without any leakage of the data.
  arXiv  Detail & Related papers  (2024-01-17T05:41:17Z)
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet [49.8449750761258]
  Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing. We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
  arXiv  Detail & Related papers  (2023-11-23T12:40:47Z)
• An Efficient and Secure Arbitrary N-Party Quantum Key Agreement Protocol Using Bell States [16.277401577186605]
  Two quantum key agreement protocols using Bell states and Bell measurement were recently proposed by Shukla et al. Zhu et al. pointed out that there are some security flaws and proposed an improved version. This study shows the present protocol can guarantee the correctness, security, privacy and fairness of quantum key agreement.
  arXiv  Detail & Related papers  (2023-09-22T09:02:18Z)
• Secure Key from Quantum Discord [22.97866257572447]
  We show how to make use of discord to analyze security in a specific quantum cryptography protocol. Our method is robust against imperfections in qubit sources and qubit measurements as well as basis misalignment due to quantum channels.
  arXiv  Detail & Related papers  (2023-04-12T14:21:49Z)
• Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions [12.45203887838637]
  We construct quantum public-key encryption from one-way functions. In our construction, public keys are quantum, but ciphertexts are classical.
  arXiv  Detail & Related papers  (2023-04-04T13:57:17Z)
• 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)
• Secure communication over generalised quantum multiple access channels [1.251280464827565]
  We provide the formula for the achievable rate region of secure communication in the scenario of two senders and a single receiver. We explicitly specify a protocol for secure communication in this scenario, which employs superdense coding. We prove the security of the protocol against general quantum attacks, analyze different strategies of the eavesdropper and compute the key rate for a range of noisy quantum channels.
  arXiv  Detail & Related papers  (2021-06-24T20:40:12Z)
• Post-Quantum Multi-Party Computation [32.75732860329838]
  We study multi-party computation for classical functionalities (in the plain model) with security against malicious-time quantum adversaries. We assume superpolynomial quantum hardness of learning with errors (LWE), and quantum hardness of an LWE-based circular security assumption. Along the way, we develop cryptographic primitives that may be of independent interest.
  arXiv  Detail & Related papers  (2020-05-23T00:42:52Z)
• 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)

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.