Paper 2025/1826

Proofs of No Intrusion

Vipul Goyal, NTT Research
Justin Raizes, NTT Research
Abstract

A central challenge in data security is not just preventing theft, but detecting whether it has occurred. Classically, this is impossible because a perfect copy leaves no evidence. Quantum mechanics, on the other hand, forbids general duplication, opening up new possibilities. We introduce Proofs of No Intrusion, which enable a classical client to remotely test whether a quantum server has been hacked and the client's data stolen. Crucially, the test does not destroy the data being tested, avoiding the need to store a backup elsewhere. We define and construct proofs of no intrusion for ciphertexts assuming fully homomorphic encryption. Additionally, we show how to equip several constructions of unclonable primitives with proofs of non-intrusion, such as unclonable decryption keys and signature tokens. Conceptually, proofs of non-intrusion can be defined for essentially any unclonable primitive. At the heart of our techniques is a new method for non-destructively testing coset states with classical communication. It can be viewed as a non-destructive proof of knowledge of a measurement result of the coset state.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
A major revision of an IACR publication in EUROCRYPT 2026
Keywords
Quantumcertified deletionunclonability
Contact author(s)
vipul @ vipulgoyal org
justin raizes @ ntt-research com
History
2026-04-22: last of 3 revisions
2025-10-03: received
See all versions
Short URL
https://ia.cr/2025/1826
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/1826,
      author = {Vipul Goyal and Justin Raizes},
      title = {Proofs of No Intrusion},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1826},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1826}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.