Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement

• URL: http://arxiv.org/abs/2404.11306v1
• Date: Wed, 17 Apr 2024 12:16:41 GMT
• Title: Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement
• Authors: Soham Ghosh, Vladlen Galetsky, Pol Julià Farré, Christian Deppe, Roberto Ferrara, Holger Boche,
• Abstract summary: In quantum PUFs (QPUFs), the input-output pairs consist of quantum states instead of classical bitstrings. We prove that such a QPUF is existentially unforgeable. We introduce the first model in existing literature that depicts such a high level of provable security.
• Score: 45.386403865847235
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Physical Unclonable Functions (PUFs) are hardware devices with the assumption of possessing inherent non-clonable physical randomness which leads to unique pairs of inputs and outputs that provide a secure fingerprint for cryptographic protocols like authentication. In the case of quantum PUFs (QPUFs), the input-output pairs consist of quantum states instead of classical bitstrings, offering advantages over classical PUFs (CPUFs) such as challenge reusability via public channels and non-reliance over any trusted party due to the no-cloning theorem. In recent literature, a generalized mathematical framework for studying QPUFs was developed, which paved the way for having QPUF models with provable security. It was proved that \emph{existential unforgeability} against Quantum Polynomial Time (QPT) adversaries cannot be achieved by any random unitary QPUF. Since measurements are non-unitary quantum processes, we define a QPUF based on random von Neumann measurements. We prove that such a QPUF is existentially unforgeable. Thus, we introduce the first model in existing literature that depicts such a high level of provable security. We also prove that the Quantum Phase Estimation (QPE) protocol applied on a Haar random unitary serves as an approximate implementation for this kind of QPUF as it approximates a von Neumann measurement on the eigenbasis of the unitary.

Related papers

• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• A Study of Gate-Based and Boson Sampling Quantum Random Number Generation on IBM and Xanadu Quantum Devices [0.0]
  This paper explores the practicality of generating random numbers from two quantum platforms.<n>We implement simple post-processing methods, including the classic Von Neumann extractor.<n>Results show that, while unbiased bitstreams can be achieved on both platforms, throughput remains low and cost per random bit is high.
  arXiv  Detail & Related papers  (2025-07-04T22:01:55Z)
• Quantum Lifting for Invertible Permutations and Ideal Ciphers [47.33103206862089]
  We derive the first lifting theorems for establishing security in the quantum random permutation and ideal cipher models. These theorems relate the success probability of an arbitrary quantum adversary to that of a classical algorithm making only a small number of classical queries.
  arXiv  Detail & Related papers  (2025-04-25T09:07:55Z)
• Unconditionally Secure Commitments with Quantum Auxiliary Inputs [8.093227427119325]
  We show the following unconditional results on quantum commitments in two related yet different models. We revisit the notion of quantum auxiliary-input commitments introduced by Chailloux, Kerenidis, and Rosgen (Comput. Complex. 2016) We introduce a new model which we call the common reference quantum state (CRQS) model where both the committer and receiver take the same quantum state that is randomly sampled by an efficient setup algorithm.
  arXiv  Detail & Related papers  (2023-11-30T13:57:30Z)
• Quantum delegation with an off-the-shelf device [3.3766484312332303]
  We show how to delegate-time quantum computations in the OTS model. This provides the first relativistic (one-round), two-prover zero-knowledge proof system for QMA. As a proof approach, we provide a new self-test for n EPR pairs using only constant-sized Pauli measurements.
  arXiv  Detail & Related papers  (2023-04-07T02:43:06Z)
• 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)
• Learning Classical Readout Quantum PUFs based on single-qubit gates [9.669942356088377]
  We formalize the class of Classical Readout Quantum PUFs (CR-QPUFs) using the statistical query (SQ) model. We show insufficient security for CR-QPUFs based on singlebit rotation gates, when adversary has SQ access to the CR-QPUF. We demonstrate how a malicious party can learn CR-QPUF characteristics and forge the signature of a quantum device.
  arXiv  Detail & Related papers  (2021-12-13T13:29:22Z)
• On the Connection Between Quantum Pseudorandomness and Quantum Hardware Assumptions [1.4174475093445233]
  This paper addresses the questions related to the connections between the quantum pseudorandomness and quantum hardware assumptions. We show that the efficient pseudorandom quantum states (PRS) are sufficient to construct the challenge set for the universally unforgeable qPUF. As an application of our results, we show that the efficiency of an existing qPUF-based client-server identification protocol can be improved without losing the security requirements.
  arXiv  Detail & Related papers  (2021-10-22T11:55:06Z)
• 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)
• Quantum Random Number Generation using a Solid-State Single-Photon Source [89.24951036534168]
  Quantum random number generation (QRNG) harnesses the intrinsic randomness of quantum mechanical phenomena. We demonstrate QRNG with a quantum emitter in hexagonal boron nitride. Our results open a new avenue to the fabrication of on-chip deterministic random number generators.
  arXiv  Detail & Related papers  (2020-01-28T22:47:43Z)
• 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.