Continuous-variable Quantum Position Verification secure against entangled attackers

• URL: http://arxiv.org/abs/2404.14261v1
• Date: Mon, 22 Apr 2024 15:09:36 GMT
• Title: Continuous-variable Quantum Position Verification secure against entangled attackers
• Authors: Rene Allerstorfer, Llorenç Escolà-Farràs, Arpan Akash Ray, Boris Skoric, Florian Speelman,
• Abstract summary: We show that a quantum position verification protocol using coherent states could be securely implemented if and only if attackers do not pre-share any entanglement. We show that the protocol remains secure for certain attenuation and excess noise.
• Score: 0.6011824091708076
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Motivated by the fact that coherent states may offer practical advantages it was recently shown that a continuous-variable (CV) quantum position verification (QPV) protocol using coherent states could be securely implemented if and only if attackers do not pre-share any entanglement. In the discrete-variable (DV) analogue of that protocol it was shown that modifying how the classical input information is sent from the verifiers to the prover leads to a favourable scaling in the resource requirements for a quantum attack. In this work, we show that similar conclusions can be drawn for CV-QPV. By adding extra classical information of size $n$ to a CV-QPV protocol, we show that the protocol, which uses a coherent state and classical information, remains secure, even if the quantum information travels arbitrarily slow, against attackers who pre-share CV (entangled) states with a linear (in $n$) cutoff at the photon number. We show that the protocol remains secure for certain attenuation and excess noise.

Related papers

• Dimensional advantage in secure information trading via the noisy dense coding protocol [0.0]
  We present the DC-based QKD protocol for higher dimensional systems. We report the lower bounds on secret key rate, when the shared state is a two-qudit maximally entangled state. We prove that the set of useless states in the DC-based QKD protocol is convex and compact.
  arXiv  Detail & Related papers  (2023-10-31T17:50:48Z)
• Security of a Continuous-Variable based Quantum Position Verification Protocol [0.0]
  We present and analyze a protocol that utilizes coherent states and its properties. We prove security of the protocol against any unentangled attackers via entropic uncertainty relations. We show that attackers who pre-share one continuous-variable EPR pair can break the protocol.
  arXiv  Detail & Related papers  (2023-08-08T09:56:38Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• 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)
• 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)
• How to Verify Identity in the Continuous Variable Quantum System? [14.871034136378366]
  We propose a continuous variable quantum identification (CV-QI) protocol based on the correlation of two-mode squeezed vacuum state and the continuous variable teleportation. The bidirectional identity verification between two participants of the communication can be achieved by the proposed CV-QI protocol.
  arXiv  Detail & Related papers  (2022-02-22T12:24:41Z)
• Performance analysis of continuous-variable quantum key distribution using non-Gaussian states [0.0]
  In this study, we analyze the efficiency of a protocol with discrete modulation of continuous variable non-Gaussian states. We calculate the secure key generation rate against collective attacks using the fact that Eve's information can be bounded based on the protocol.
  arXiv  Detail & Related papers  (2021-12-19T11:55:17Z)
• Discrete-variable quantum key distribution with homodyne detection [14.121646217925441]
  We propose a protocol that combines the simplicity of quantum state preparation in DV-QKD together with the cost-effective and high-bandwidth of homodyne detectors used in CV-QKD. Our simulation suggests that the protocol is suitable for secure and high-speed practical key distribution over distances.
  arXiv  Detail & Related papers  (2021-09-01T17:12:28Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• 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)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15: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.