Tamper Detection against Unitary Operators
Naresh Goud Boddu, Upendra S. Kapshikar

TL;DR
This paper introduces quantum tamper detection codes that can identify tampering by unitary operators on quantum messages, extending classical concepts to the quantum setting with specific size and proximity constraints.
Contribution
It establishes the existence of quantum tamper detection codes for large families of unitary tampering operators, generalizing classical tamper detection to quantum information.
Findings
Quantum tamper detection codes exist for unitary families of size less than 2^{2^{αn}}.
Constructed codes can detect tampering and recover original messages when no tampering occurs.
Classical message sets allow for non-malleable code constructions against large unitary families.
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 -qubit quantum message to obtain an -qubit quantum codeword . A quantum codeword can be adversarially tampered via a unitary from some known tampering unitary family (acting on ). Firstly, we initiate the general study of \emph{quantum tamper detection codes}, which detect if there is any tampering caused by the action…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Cryptography and Data Security
