# Tamper Detection against Unitary Operators

@article{Boddu2021TamperDA, title={Tamper Detection against Unitary Operators}, author={Naresh Goud Boddu and Upendra Kapshikar}, journal={ArXiv}, year={2021}, volume={abs/2105.04487} }

Abstract. We consider (Enc,Dec) schemes which are used to encode a classical/quantum message m and derive an n-qubit quantum codeword ψm. The quantum codeword ψm can be adversarially tampered via a unitary U ∈ U from some known tampering unitary family U , resulting in UψmU . Firstly, we initiate the general study of quantum tamper detection codes, which must detect that tampering occurred with high probability. In case there was no tampering, we would like to output message m with probability…

## References

SHOWING 1-10 OF 30 REFERENCES

Uncloneable Quantum Encryption via Random Oracles

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2019

This work formally defines uncloneable encryption, and shows how to achieve it using Wiesner's conjugate coding, combined with a quantum-secure pseudorandom function (qPRF), and shows security by adapting techniques from the quantum one-way-to-hiding lemma, as well as using bounds from quantum monogamy-of-entanglement games.

Tamper Detection and Continuous Non-malleable Codes

- Computer Science, MathematicsTCC
- 2015

The different types of security guarantees that can be achieved in this scenario for different families \(\mathcal{F}\) of tampering attacks are studied.

Nonmalleable encryption of quantum information

- Computer Science, Mathematics
- 2009

We introduce the notion of nonmalleability of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we…

Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model

- Computer ScienceTCC
- 2015

This paper considers, for the first time, the regime of arbitrary positive constant error probability e in combination with unbounded cardinality M of the message space and proposes a novel constructive method based on symmetries of codes that leads to an explicit construction based on certain BCH codes that improves the parameters of the polynomial construction and to an efficient randomized construction of optimal AMD codes.

Quantum Non-malleability and Authentication

- Computer Science, MathematicsCRYPTO
- 2017

It is proved that quantum non-malleability implies secrecy; this is in stark contrast to the classical setting, where the two properties are completely independent.

Good quantum error-correcting codes exist.

- PhysicsPhysical review. A, Atomic, molecular, and optical physics
- 1996

The techniques investigated in this paper can be extended so as to reduce the accuracy required for factorization of numbers large enough to be difficult on conventional computers appears to be closer to one part in billions.

Stabilizer Codes and Quantum Error Correction

- Computer Science
- 1997

An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed.

Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience

- Computer Science, MathematicsICALP
- 2011

This work proposes a compiler that transforms any circuit into a new circuit with the same functionality, but which is resilient against a welldefined and powerful tampering adversary, and shows that a q-query tampering attack against the transformed circuit can be "simulated" with only black-box access to the original circuit and log(q) bits of additional auxiliary information.

Capacity of Non-Malleable Codes

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2016

It is proved that for every family P with IFI I≤I 22αn, there exist non-malleable codes against P with rate arbitrarily close to 1-α, which implies that the capacity of non-Malleable coding in the split-state model (where the tampering function acts independently but arbitrarily on the two halves of the codeword, a model which has received some attention recently) equals 1/2.

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors

- Computer Science, MathematicsEUROCRYPT
- 2008

This work introduces a new primitive called an algebraic manipulation detection code, which encodes a source s into a value x stored on Σ(G) so that any tampering by an adversary will be detected, and gives a nearly optimal construction of AMD codes, which can flexibly accommodate arbitrary choices for the length of the source s and security level.