Tamper Detection against Unitary Operators

• URL: http://arxiv.org/abs/2105.04487v4
• Date: Mon, 6 Nov 2023 13:04:10 GMT
• Title: Tamper Detection against Unitary Operators
• Authors: Naresh Goud Boddu and Upendra S. Kapshikar
• Abstract summary: We extend the scope of the theory of tamper detection codes against an adversary with quantum capabilities. A quantum codeword $vert psi_m rangle$ can be adversarially tampered via a unitary $U$ from some known tampering unitary family. We show that quantum tamper detection codes exist for any family of unitary operators.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Security of a storage device against a tampering adversary has been a well-studied topic in classical cryptography. Such models give black-box access to an adversary, and the aim is to protect the stored message or abort the protocol if there is any tampering. In this work, we extend the scope of the theory of tamper detection codes against an adversary with quantum capabilities. We consider encoding and decoding schemes that are used to encode a $k$-qubit quantum message $\vert m\rangle$ to obtain an $n$-qubit quantum codeword $\vert {\psi_m} \rangle$. A quantum codeword $\vert {\psi_m} \rangle$ can be adversarially tampered via a unitary $U$ from some known tampering unitary family $\mathcal{U}_{\mathsf{Adv}}$ (acting on $\mathbb{C}^{2^n}$). Firstly, we initiate the general study of \emph{quantum tamper detection codes}, which detect if there is any tampering caused by the action of a unitary operator. In case there was no tampering, we would like to output the original message. We show that quantum tamper detection codes exist for any family of unitary operators $\mathcal{U}_{\mathsf{Adv}}$, such that $\vert\mathcal{U}_{\mathsf{Adv}} \vert < 2^{2^{\alpha n}}$ for some constant $\alpha \in (0,1/6)$; provided that unitary operators are not too close to the identity operator. Quantum tamper detection codes that we construct can be considered to be quantum variants of \emph{classical tamper detection codes} studied by Jafargholi and Wichs~['15], which are also known to exist under similar restrictions. Additionally, we show that when the message set $\mathcal{M}$ is classical, such a construction can be realized as a \emph{non-malleable code} against any $\mathcal{U}_{\mathsf{Adv}}$ of size up to $2^{2^{\alpha n}}$.

Related papers

• Mitigating Non-Markovian and Coherent Errors Using Quantum Process Tomography of Proxy States [0.0]
  We consider three of the most common bosonic error correction codes -- the CLY, binomial and dual rail. We find that the dual rail code shows the best performance. We also develop a new technique for error mitigation in quantum control.
  arXiv  Detail & Related papers  (2024-11-05T19:18:30Z)
• SDP bounds on quantum codes [6.417777780911225]
  This paper provides a semidefinite programming hierarchy based on state optimization to determine the existence of quantum codes. The hierarchy is complete, in the sense that if a $(!(n,K,delta)!)$ code does not exist then a level of the hierarchy is infeasible. While it is formally-free, we restrict it to qubit codes through quasi-Clifford algebras.
  arXiv  Detail & Related papers  (2024-08-19T18:00:07Z)
• Quantum Depth in the Random Oracle Model [57.663890114335736]
  We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. For some problems, the ability to perform adaptive measurements in a single shallow quantum circuit is more useful than the ability to perform many shallow quantum circuits without adaptive measurements.
  arXiv  Detail & Related papers  (2022-10-12T17:54:02Z)
• Divisible Codes for Quantum Computation [0.6445605125467572]
  Divisible codes are defined by the property that codeword weights share a common divisor greater than one. This paper explores how they can be used to protect quantum information as it is transformed by logical gates.
  arXiv  Detail & Related papers  (2022-04-27T20:18:51Z)
• Quantum secure non-malleable codes in the split-state model [10.018311966441027]
  Non-malleable-codes introduced by Dziembowski, Pietrzak and Wichs [DPW18] encode a classical message $S$. We construct explicit quantum secure non-malleable-codes in the split-state model.
  arXiv  Detail & Related papers  (2022-02-27T12:56:34Z)
• Uncertainties in Quantum Measurements: A Quantum Tomography [52.77024349608834]
  The observables associated with a quantum system $S$ form a non-commutative algebra $mathcal A_S$. It is assumed that a density matrix $rho$ can be determined from the expectation values of observables. Abelian algebras do not have inner automorphisms, so the measurement apparatus can determine mean values of observables.
  arXiv  Detail & Related papers  (2021-12-14T16:29:53Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• Bosonic quantum communication across arbitrarily high loss channels [68.58838842613457]
  A general attenuator $Phi_lambda, sigma$ is a bosonic quantum channel that acts by combining the input with a fixed environment state. We show that for any arbitrary value of $lambda>0$ there exists a suitable single-mode state $sigma(lambda)$. Our result holds even when we fix an energy constraint at the input of the channel, and implies that quantum communication at a constant rate is possible even in the limit of arbitrarily low transmissivity.
  arXiv  Detail & Related papers  (2020-03-19T16:50:11Z)
• Quantum Coupon Collector [62.58209964224025]
  We study how efficiently a $k$-element set $Ssubseteq[n]$ can be learned from a uniform superposition $|Srangle of its elements. We give tight bounds on the number of quantum samples needed for every $k$ and $n$, and we give efficient quantum learning algorithms.
  arXiv  Detail & Related papers  (2020-02-18T16:14:55Z)

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.