Advanced Attacks On Qubit-Ensemble Based Quantum Coins

• URL: http://arxiv.org/abs/2412.20243v2
• Date: Tue, 25 Feb 2025 18:05:00 GMT
• Title: Advanced Attacks On Qubit-Ensemble Based Quantum Coins
• Authors: Bernd Bauerhenne, Lucas Tsunaki, Jan Thieme, Boris Naydenov, Kilian Singer,
• Abstract summary: Multiple differently tokens with ensembles are realizing a quantum coin that can be issued by a bank.<n>A sophisticated attempt to copy the token can assume that measurements on sub-ensembles can be carried through.<n>We prove that an arbitrary level of security can be obtained by adding an increasing amount of quantum tokens into a quantum coin.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present and characterize an ensemble based quantum token protocol that allows for implementing non-clonable tokens containing ensembles of identically prepared qubits. Multiple differently initialized tokens with ensembles are realizing a quantum coin that can be issued by a bank. A sophisticated attempt to copy the token can assume that measurements on sub-ensembles can be carried through and that even individual qubits can be measured. Even though such an advanced attack might be perceived as technically unfeasible, we proof the security of the ensemble based protocol under these conditions and provide detailed expressions on how the quantum coin must be designed to fulfill desired security requirements. We have used realistic parameters of the IBM Quantum Platforms and verified our numerical simulations with experimental data for advanced attacks using brute force optimization, direct inversion tomography, maximum likelihood and Bayesian method. Full message passing interface parallelized source code is provided to allow for adjusting to other hardware platforms. Interestingly, our results deviate from predictions provided by quantum state tomography. This can be attributed to the fact that an attacker's goal is not to get an optimal estimate of an unknown quantum state, but to mislead the bank into accepting the counterfeit quantum coin. Finnally, we prove that an arbitrary level of security can be obtained by adding an increasing amount of quantum tokens into a quantum coin.

Related papers

• Pseudorandom quantum authentication [0.8204952610951527]
  We introduce the pseudorandom quantum authentication scheme (PQAS) It is an efficient method for quantum states that relies solely on the existence of pseudorandom unitaries (PRUs)
  arXiv  Detail & Related papers  (2025-01-01T20:46:37Z)
• 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.<n>We propose an ensemble-based quantum-token protocol, making these applications technologically less-demanding.<n>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)
• A Quantum-Resistant Photonic Hash Function [0.0]
  We propose a quantum hash function based on Gaussian boson sampling on a photonic quantum computer. Our work lays the foundation for a new paradigm of quantum-resistant hashing with applications in emerging quantum-era information systems.
  arXiv  Detail & Related papers  (2024-09-30T04:19:26Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• 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)
• Demonstration of quantum-digital payments [36.136619420474766]
  We show how quantum light can secure daily digital payments by generating inherently unforgeable quantum cryptograms. Unlike previously proposed protocols, our solution does not depend on long-term quantum storage or trusted agents and authenticated channels. It is practical with near-term technology and may herald an era of quantum-enabled security.
  arXiv  Detail & Related papers  (2023-05-23T20:20:14Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• 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)
• 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)
• Practical quantum tokens without quantum memories and experimental tests [0.15749416770494706]
  'S-money' tokens do not require quantum memories or long distance quantum communication. We describe implementations of S-money schemes with off-the-shelf quantum key distribution technology. We show that, given standard assumptions in mistrustful quantum cryptographic implementations, unforgeability and user privacy could be guaranteed.
  arXiv  Detail & Related papers  (2021-04-23T17:03:33Z)
• 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)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• 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)
• 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)
• 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.