[2311.07794] How to Use Quantum Indistinguishability Obfuscation
source link: https://arxiv.org/abs/2311.07794
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
How to Use Quantum Indistinguishability Obfuscation
Quantum copy protection, introduced by Aaronson, enables giving out a quantum program-description that cannot be meaningfully duplicated. Despite over a decade of study, copy protection is only known to be possible for a very limited class of programs. As our first contribution, we show how to achieve "best-possible" copy protection for all programs. We do this by introducing quantum state indistinguishability obfuscation (qsiO), a notion of obfuscation for quantum descriptions of classical programs. We show that applying qsiO to a program immediately achieves best-possible copy protection. Our second contribution is to show that, assuming injective one-way functions exist, qsiO is concrete copy protection for a large family of puncturable programs -- significantly expanding the class of copy-protectable programs. A key tool in our proof is a new variant of unclonable encryption (UE) that we call coupled unclonable encryption (cUE). While constructing UE in the standard model remains an important open problem, we are able to build cUE from one-way functions. If we additionally assume the existence of UE, then we can further expand the class of puncturable programs for which qsiO is copy protection. Finally, we construct qsiO relative to an efficient quantum oracle.
Subjects: | Quantum Physics (quant-ph); Cryptography and Security (cs.CR) |
Cite as: | arXiv:2311.07794 [quant-ph] |
(or arXiv:2311.07794v2 [quant-ph] for this version) | |
https://doi.org/10.48550/arXiv.2311.07794 |
Recommend
-
6
in which, were a title to be summarized from the content, it would be altogether too similar to many of the titles used for past articles, possibly to the point of indistinguishability
-
6
Damian Edelberg December 12, 2023 1 minute read...
-
5
Computer Science > Logic in Computer Science [Submitted on 24 Nov 2023] Refinement Proofs in Rust Using Ghost Locks...
-
5
Pensieve: 2311 2023-11-26 13:51 这个月有点懒, 不太想读书. 读完了两本, 一本是记录老北京历史的府门儿·宅门儿, 本来期望能读到更多普通老百...
-
4
Computer Science > Computation and Language [Submitted on 28 Nov 2023 (v1), last revised...
-
15
Sap B1 Patch 2311 sluggish and slowing down system ...
-
1
SAP Business one 10 FP 2311 bypassing authentication while accessing DT...
-
6
Quantum Physics [Submitted on 18 Jan 2024] Quantum State Obfuscation from Classical Oracles
-
4
[Submitted on 16 Nov 2023 (v1), last revised 3 Feb 2024 (this version, v3)] On the Pauli Spectrum of QAC0
-
3
[Submitted on 27 Nov 2023 (v1), last revised 7 Dec 2023 (this version, v2)] The Power of Adaptivity in Quantum Query Algorithms...
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK