Experimental Implementation of A Quantum Zero-Knowledge Proof for User Authentication

• URL: http://arxiv.org/abs/2401.09521v1
• Date: Wed, 17 Jan 2024 19:00:00 GMT
• Title: Experimental Implementation of A Quantum Zero-Knowledge Proof for User Authentication
• Authors: Marta I. Garcia-Cid, Dileepsai Bodanapu, Alberto Gatto, Paolo Martelli, Vicente Martin and Laura Ortiz
• Abstract summary: A new interactive quantum zero-knowledge protocol for identity authentication is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a pre-shared secret, and the acceptance or rejection of the proof is determined by the quantum bit error rate.
• Score: 0.39845810840390733
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A new interactive quantum zero-knowledge protocol for identity authentication implementable in currently available quantum cryptographic devices is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a pre-shared secret, and the acceptance or rejection of the proof is determined by the quantum bit error rate. It has been implemented in modified Quantum Key Distribution devices executing two fundamental cases. In the first case, all players are honest, while in the second case, one of the users is a malicious player. We demonstrate an increase of the quantum bit error rate around 25% in the latter case compared to the case of honesty. The protocol has also been validated for distances from a back-to-back setup to more than 60 km between verifier and prover. The security and robustness of the protocol has been analysed, demonstrating its completeness, soundness and zero-knowledge properties.

Related papers

• Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
  We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
  arXiv  Detail & Related papers  (2025-12-05T04:40:34Z)
• Plugging Leaks in Fault-Tolerant Quantum Computation and Verification [0.03499870393443268]
  We present the first fault-tolerant blind verification scheme for universal quantum computations able to handle secret-dependent noise on the verifier's quantum device.<n>Our main tools are two novel distillation protocols that turn secret-dependent noise into secret-independent noise.<n>We use these protocols to prepare states in the X-Y-plane whose noise is overwhelmingly secret-independent, which then allows us to verify with exponential confidence arbitrary fault-tolerant BQP computations.
  arXiv  Detail & Related papers  (2025-10-03T17:57:59Z)
• Hybrid Authentication Protocols for Advanced Quantum Networks [0.6827423171182154]
  We introduce a new authentication approach that combines hardware assumptions, particularly Physical Unclonable Functions (PUFs), along with quantum properties of non-local states, such as local indistinguishability, to achieve provable security in entanglement-based protocols. These protocols are suitable for implementation across various platforms, particularly photonics-based ones, and offer a practical and flexible solution to the long-standing challenge of authentication in quantum communication networks.
  arXiv  Detail & Related papers  (2025-04-15T18:51:22Z)
• Sound certification of memory-bounded quantum computers [0.1874930567916036]
  We introduce an approach, which we call quantum system quizzing, for the certification of quantum gates in a practical server-user scenario.<n> Importantly, this approach does not require trusted state preparation and measurement and is thus inherently free from the associated systematic errors.<n>A major technical challenge that we are first to resolve in the memory-bounded single-device setup is recovering the tensor product structure of a multi-qubit system.
  arXiv  Detail & Related papers  (2024-11-06T19:23:45Z)
• On-Chip Verified Quantum Computation with an Ion-Trap Quantum Processing Unit [0.5497663232622965]
  We present and experimentally demonstrate a novel approach to verification and benchmarking of quantum computing. Unlike previous information-theoretically secure verification protocols, our approach is implemented entirely on-chip. Our results pave the way for more accessible and efficient verification and benchmarking strategies in near-term quantum devices.
  arXiv  Detail & Related papers  (2024-10-31T16:54:41Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• 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)
• 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)
• Classical verification of quantum depth [1.8613536568358358]
  We present two protocols for classical verification of quantum depth. Our first protocol certifies the depth of the target machine with information theoretic security and nearly optimal separation. Our second protocol certifies the quantum depth of a single device based on quantum hardness of learning with errors.
  arXiv  Detail & Related papers  (2022-05-10T03:55:24Z)
• 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)
• 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)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Benchmarking of Quantum Protocols [0.9176056742068812]
  We consider several quantum protocols that enable promising functionalities and services in near-future quantum networks. We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols.
  arXiv  Detail & Related papers  (2021-11-03T21:17:04Z)
• Experimental quantum key distribution certified by Bell's theorem [0.0]
  cryptographic key exchange protocols traditionally rely on computational conjectures to provide security against eavesdropping attacks. quantum key distribution protocols provide information-theoretic security against such attacks. However, quantum protocols are subject to a new class of attacks exploiting implementation defects in the physical devices involved. We present here the experimental realisation of a complete quantum key distribution protocol immune to these vulnerabilities.
  arXiv  Detail & Related papers  (2021-09-29T17:52:48Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Sample-efficient device-independent quantum state verification and certification [68.8204255655161]
  Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing. We develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime. We show that device-independent verification can be performed with optimal sample efficiency.
  arXiv  Detail & Related papers  (2021-05-12T17:48:04Z)

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.