Advanced Attacks On Qubit-Ensemble Based Quantum Coins

• URL: http://arxiv.org/abs/2412.20243v1
• Date: Sat, 28 Dec 2024 19:10:01 GMT
• Title: Advanced Attacks On Qubit-Ensemble Based Quantum Coins
• Authors: Bernd Bauerhenne, Lucas Tsunaki, Jan Thieme, Boris Naydenov, Kilian Singer,
• Abstract summary: ensemble based quantum token protocol allows for implementing non-clonable tokens containing an ensemble of identically prepared qubits. Advanced attacks on the protocol can assume that measurements on sub-ensembles can be carried through and that even individual qubits can be measured. We have used realistic parameters for the IBM Quantum Platform for advanced attacks using brute force optimization.
• Score: 0.0
• License:
• Abstract: The ensemble based quantum token protocol allows for implementing non-clonable tokens containing an ensemble of identically prepared qubits. A quantum coin that is issued by a bank can be designed with desired security by adding multiple tokens with ensembles of different orientations. Advanced attacks on the protocol can assume that measurements on sub-ensembles can be carried through and that even individual qubits can be measured. Even though such an attack might be perceived as technically unfeasible we proof the security of the ensemble based protocol under these advanced attacks and provide detailed expression on how the quantum coin must be designed to fulfill desired security requirements. We have used realistic parameters for the IBM Quantum Platform for advanced attacks using brute force optimization. Full MPI parallelized source code is provided to allow for adjusting to other hardware platforms. Interestingly, our results deviate from predictions provided by quantum state tomography due to the fact that an attacker's goal is not to get an optimal estimate of an unknown quantum state, but to fool the bank into accepting the counterfeit quantum coin.

Related papers

• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol. We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation. We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• Ensemble-Based Quantum-Token Protocol Benchmarked on IBM Quantum Processors [0.0]
  Quantum tokens envision to store unclonable authentication keys in quantum states that are issued by a bank for example. We propose an ensemble-based quantum-token protocol, making these applications technologically less-demanding. We provide an open source tool with graphical user interface to benchmark the protocol with custom ensemble based qubits.
  arXiv  Detail & Related papers  (2024-12-11T16:39:39Z)
• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• 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)
• 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 Secure Protocols for Multiparty Computations [2.9561405287476177]
  We present secure multiparty computation (MPC) protocols that can withstand quantum attacks. We first present the design and analysis of an information-theoretic secure oblivious linear evaluation (OLE), namely $sf qOLE$ in the quantum domain. We further utilize $sf qOLE$ as a building block to construct a quantum-safe multiparty private set intersection (MPSI) protocol.
  arXiv  Detail & Related papers  (2023-12-26T19:53:29Z)
• 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)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• 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)
• Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds [0.0]
  Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks. We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
  arXiv  Detail & Related papers  (2021-02-25T15:58:09Z)
• Anti-Forging Quantum Data: Cryptographic Verification of Quantum Computational Power [1.9737117321211988]
  Quantum cloud computing is emerging as a popular model for users to experience the power of quantum computing through the internet. How can users be sure that the output strings sent by the server are really from a quantum hardware?
  arXiv  Detail & Related papers  (2020-05-04T14:28: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.