Concerning Quantum Identification Without Entanglement

• URL: http://arxiv.org/abs/2003.12095v2
• Date: Mon, 30 Mar 2020 14:29:45 GMT
• Title: Concerning Quantum Identification Without Entanglement
• Authors: Carlos E. Gonz\'alez-Guill\'en, Mar\'ia Isabel Gonz\'alez Vasco, Floyd Johnson, \'Angel L. P\'erez del Pozo
• Abstract summary: We comment on a recent proposal for quantum identity authentication from Zawadzki. We show that using a simple strategyan adversary may indeed obtain non-negligible information on the shared identification secret.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Identification schemes are interactive protocols typically involving two parties, a prover, who wants to provide evidence of his or her identity and a verifier, who checks the provided evidence and decide whether it comes or not from the intended prover. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki, and give a concrete attack upholding theoretical impossibility results from Lo and Buhrman et al. More precisely, we show that using a simple strategyan adversary may indeed obtain non-negligible information on the shared identification secret. While the security of a quantum identity authentication scheme is not formally defined in [1], it is clear that such a definition should somehow imply that an external entity may gain no information on the shared identification scheme (even if he actively participates injecting messages in a protocol execution, which is not assumed in our attack strategy).

Related papers

• A classical proof of quantum knowledge for multi-prover interactive proof systems [1.5749416770494706]
  In a proof of knowledge (PoK) a verifier becomes convinced that a prover possesses privileged information. We extend the concept of a PoK in the setting of a single classical verifier and two quantum provers, and exhibit the PoK property for a non-local game for the local Hamiltonian problem. Our result can be seen as a new form of self-testing, where, in addition to certifying a pre-shared entangled state and the prover's strategy, the verifier also certifies a local quantum state.
  arXiv  Detail & Related papers  (2025-03-17T20:16:22Z)
• Secure quantum bit commitment from separable operations [0.0]
  We show that imposing a restriction on the committing party to perform only separable operations enables secure quantum bit commitment schemes. Specifically, we prove that in any perfectly hiding bit commitment protocol, an honestly-committing party limited to separable operations will be detected with high probability if they attempt to alter their commitment.
  arXiv  Detail & Related papers  (2025-01-13T14:15:11Z)
• 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. We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Simultaneous quantum identity authentication scheme utilizing entanglement swapping with secret key preservation [0.0]
  We introduce a new protocol for quantum identity authentication (QIA) Our proposed scheme facilitates simultaneous authentication between two users, Alice and Bob, leveraging Bell states with the assistance of a third party, Charlie. We demonstrate that the proposed protocol withstands various known attacks, including impersonation, intercept and resend and impersonated fraudulent attacks.
  arXiv  Detail & Related papers  (2024-05-23T18:40:15Z)
• Probabilistic versions of Quantum Private Queries [0.7252027234425332]
  We define two non-deterministic versions of Quantum Private Queries, a protocol addressing the Symmetric-Private Information Retrieval problem. We show that the strongest variant of such scheme is formally equivalent to Quantum Bit Commitment, Quantum Oblivious Transfer and One-Sided Two Party Computation protocols.
  arXiv  Detail & Related papers  (2024-01-11T09:04:13Z)
• 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)
• A short review on quantum identity authentication protocols: How would Bob know that he is talking with Alice? [0.0]
  Successful implementation of a scheme of quantum key distribution (QKD) requires identity authentication as a prerequisite. Several schemes for identity authentication, using quantum resources have been proposed. The security of such protocols is also critically analyzed.
  arXiv  Detail & Related papers  (2021-12-08T11:22:29Z)
• 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)
• Experimental relativistic zero-knowledge proofs [4.334542470441071]
  We develop a zero-knowledge protocol involving two separated verifier-prover pairs. Security is enforced via the physical principle of special relativity. This demonstrates the practical potential of multi-prover zero-knowledge protocols.
  arXiv  Detail & Related papers  (2020-12-18T19:00:01Z)
• 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)
• Taking Modality-free Human Identification as Zero-shot Learning [46.51413603352702]
  We develop a novel Modality-Free Human Identification (named MFHI) task as a generic zero-shot learning model in a scalable way. It is capable of bridging the visual and semantic modalities by learning a discriminative prototype of each identity. In addition, the semantics-guided spatial attention is enforced on visual modality to obtain representations with both high global category-level and local attribute-level discrimination.
  arXiv  Detail & Related papers  (2020-10-02T13:08:27Z)
• Quantum-secure message authentication via blind-unforgeability [74.7729810207187]
  We propose a natural definition of unforgeability against quantum adversaries called blind unforgeability. This notion defines a function to be predictable if there exists an adversary who can use "partially blinded" access to predict values. We show the suitability of blind unforgeability for supporting canonical constructions and reductions.
  arXiv  Detail & Related papers  (2018-03-10T05:31:38Z)

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.