On the Role of Quantum Communication and Loss in Attacks on Quantum Position Verification

• URL: http://arxiv.org/abs/2208.04341v1
• Date: Mon, 8 Aug 2022 18:01:22 GMT
• Title: On the Role of Quantum Communication and Loss in Attacks on Quantum Position Verification
• Authors: Rene Allerstorfer, Harry Buhrman, Florian Speelman, Philip Verduyn Lunel
• Abstract summary: We show that any protocol secure against classical communication can be transformed into a protocol secure against quantum communication. We observe that any multi-round QPV protocol can be attacked with a linear amount of entanglement if the loss is high enough.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the role of quantum communication in attacks on quantum position verification. In this work, we construct the first known example of a QPV protocol that is provably secure against unentangled attackers restricted to classical communication, but can be perfectly attacked by local operations and a single round of simultaneous quantum communication indicating that allowing for quantum communication may break security. We also show that any protocol secure against classical communication can be transformed into a protocol secure against quantum communication. We further show, using arguments based on the monogamy of entanglement, that the task of Bell state discrimination cannot be done locally with a single round of quantum communication, not even probabilistically (when we allow attackers to say loss sometimes), making this the first fully loss-tolerant QPV task secure against quantum communication attacks. Finally, we observe that any multi-round QPV protocol can be attacked with a linear amount of entanglement if the loss is high enough.

Related papers

• Simultaneous Classical and Quantum Communications: Recent Progress and Three Challenges [52.931372025288844]
  We explore novel protocols that enable simultaneous classical and quantum communications.<n>We extend quantum communication capabilities beyond traditional optical bands into the terahertz.<n>We identify open problems that must be addressed to facilitate practical implementation.
  arXiv  Detail & Related papers  (2025-12-11T00:27:08Z)
• Quantum Internet in a Nutshell -- Advancing Quantum Communication with Ion Traps [25.519081784735068]
  We study the incorporation of small quantum error correction codes into quantum communication protocols.<n>We find that these codes can help to suppress the noise level and to monitor the noise profile of the channel.
  arXiv  Detail & Related papers  (2025-07-18T22:07:54Z)
• Security Enhancement of Quantum Communication in Space-Air-Ground Integrated Networks [7.404591865944407]
  Quantum teleportation achieves the transmission of quantum states through quantum channels. We propose a practical solution that ensures secure information transmission even in the presence of errors in both classical and quantum channels.
  arXiv  Detail & Related papers  (2024-10-22T14:27:21Z)
• 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)
• Quantum Communication Countermeasures [0.0]
  Investigation of possible denial-of-service attacks from a strategic perspective is performed. Analysis of various scenarios, numerical modelling, risk estimation and attack classification. Out-of-FOV attack emerges as a particularly severe threat across nearly all scenarios.
  arXiv  Detail & Related papers  (2023-10-12T21:31:29Z)
• 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)
• Semiquantum private comparison based on Bell states without quantum measurements from the classical user [4.4053348026380235]
  We propose a novel semiquantum private comparison protocol based on Bell states. TP is assumed to be semi-honest in the sense that she may take all possible attacks to steal users' private inputs except conspiring with anyone. Our protocol can take advantage over previous SQPC protocols based on Bell states in qubit efficiency.
  arXiv  Detail & Related papers  (2022-05-10T14:32:53Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• A single-qubit position verification protocol that is secure against multi-qubit attacks [2.3857747529378917]
  We show that minimal quantum resources, in the form of a single qubit, combined with classical communication are sufficient to thwart quantum adversaries. More precisely, we show that the adversaries using an increasing amount of entanglement can be combatted solely by increasing the number of classical bits used in the protocol.
  arXiv  Detail & Related papers  (2021-04-13T15:48:11Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum direct communication protocols using discrete-time quantum walk [1.9551668880584971]
  We propose two quan-tum direct communication protocols, a Quantum Secure Direct Communication (QSDC) protocoland a Controlled Quantum Dialogue (CQD) protocol using discrete-time quantum walk on a cycle. The proposed protocols are unconditionally secure against various attacks such as the intercept-resend attack, the denial of service attack, and the man-in-the-middle attack.
  arXiv  Detail & Related papers  (2020-04-07T11:16:09Z)
• 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.