Eavesdropping a Quantum Key Distribution network using sequential quantum unsharp measurement attacks

• URL: http://arxiv.org/abs/2108.10369v1
• Date: Mon, 23 Aug 2021 19:10:33 GMT
• Title: Eavesdropping a Quantum Key Distribution network using sequential quantum unsharp measurement attacks
• Authors: Yash Wath, Hariprasad M, Freya Shah and Shashank Gupta
• Abstract summary: We consider a pure two-qubit state shared between two parties Alice and Bob, sharing quantum steerable correlations. One qubit of the shared state is with Alice and the other one while going to the Bob's place is intercepted by multiple sequential eavesdroppers.
• Score: 0.8010615606748019
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the possibility of eavesdropping on a quantum key distribution network by local sequential quantum unsharp measurement attacks by the eavesdropper. In particular, we consider a pure two-qubit state shared between two parties Alice and Bob, sharing quantum steerable correlations that form the one-sided device-independent quantum key distribution network. One qubit of the shared state is with Alice and the other one while going to the Bob's place is intercepted by multiple sequential eavesdroppers who perform quantum unsharp measurement attacks thus gaining some positive key rate while preserving the quantum steerable correlations for the Bob. In this way, Bob will also have a positive secret key rate although reduced. However, this reduction is not that sharp and can be perceived due to decoherence and imperfection of the measurement devices. At the end, we show that an unbounded number of eavesdroppers can also get secret information in some specific scenario.

Related papers

• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Secured Quantum Identity Authentication Protocol for Quantum Networks [2.3317857568404032]
  This paper proposes a quantum identity authentication protocol that protects quantum networks from malicious entanglements. Unlike the existing protocols, the proposed quantum authentication protocol does not require periodic refreshments of the shared secret keys.
  arXiv  Detail & Related papers  (2023-12-10T05:36:49Z)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Network quantum steering enables randomness certification without seed randomness [0.0]
  Quantum networks with multiple sources allow the observation of quantum nonlocality without inputs. We show that even two parties with two sources that might be classically correlated can witness a form of quantum nonlocality.
  arXiv  Detail & Related papers  (2023-07-17T19:32:17Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Fault tolerant channel-encrypting quantum dialogue against collective noise [0.0]
  Two fault tolerant channel-encrypting quantum dialogue protocols against collective noise are presented. One is against collective-dephasing noise, while the other is against collective-rotation noise. Einstein-Podolsky-Rosen pairs, which play the role of private quantum key, are securely shared between two participants.
  arXiv  Detail & Related papers  (2022-05-05T02:56:29Z)
• Self-protected adiabatic quantum computation [0.6445605125467573]
  We study the possibility of quantum computation in decoherence free subspace. This passive protection protocol can be especially advantageous for continuous quantum computation.
  arXiv  Detail & Related papers  (2022-03-18T01:52:48Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Secure distribution of a certified random quantum key using an entangled memory qubit [0.0]
  We produce a certified random secret key on both endpoints of the quantum communication channel. We certify the randomness of the key using the min-entropy of the atom-photon state.
  arXiv  Detail & Related papers  (2021-11-29T13:31:30Z)
• 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)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.