Constructions for Quantum Indistinguishability Obfuscation

Broadbent, Anne; Kazmi, Raza Ali

doi:10.1007/978-3-030-88238-9_2

Cited by 8 publications

(2 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Is It Possible To Obfuscate Quantum Computation?mentioning

confidence: 99%

“…Prior research has focused its efforts on definitional work [AF16], impossibility results [AF16, AL21, ABDS21], and limited classes of quantum computation [AJJ14, BK21,BM22]. The best feasibility results we had prior to this work were for obfuscating quantum circuits with logarithmically many non-Clifford gates [BK21] and for obfuscating "null" quantum circuits that always output zero [BM22]. Neither of these classes comes close to a notion of "general-purpose" quantum computation, and thus the feasibility of quantum obfuscation as a tool for quantum software protection has remained wide open.…”

Section: Is It Possible To Obfuscate Quantum Computation?mentioning

confidence: 99%

See 1 more Smart Citation

Obfuscation of Pseudo-Deterministic Quantum Circuits

Bartusek¹,

Kitagawa²,

Nishimaki³

et al. 2023

Preprint

View full text Add to dashboard Cite

We show how to obfuscate pseudo-deterministic quantum circuits, assuming the quantum hardness of learning with errors (QLWE) and post-quantum virtual black-box (VBB) obfuscation for classical circuits. Given the classical description of a quantum circuit Q, our obfuscator outputs a quantum state | Q that can be used to evaluate Q repeatedly on arbitrary inputs.Instantiating the VBB obfuscator for classical circuits with any candidate post-quantum indistinguishability obfuscator gives us the first candidate construction of indistinguishability obfuscation for all polynomial-size pseudo-deterministic quantum circuits. In particular, our scheme is the first candidate obfuscator for a class of circuits that is powerful enough to implement Shor's algorithm (SICOMP 1997).Our approach follows Bartusek and Malavolta (ITCS 2022), who obfuscate null quantum circuits by obfuscating the verifier of an appropriate classical verification of quantum computation (CVQC) scheme. We go beyond null circuits by constructing a publicly-verifiable CVQC scheme for quantum partitioning circuits, which can be used to verify the evaluation procedure of Mahadev's quantum fully-homomorphic encryption scheme (FOCS 2018). We achieve this by upgrading the one-time secure scheme of Bartusek (TCC 2021) to a fully reusable scheme, via a publicly-decodable Pauli functional commitment, which we formally define and construct in this work. This commitment scheme, which satisfies a notion of binding against committers that can access the receiver's standard and Hadamard basis decoding functionalities, is constructed by building on techniques of Amos, Georgiou, Kiayias, and Zhandry (STOC 2020) introduced in the context of equivocal but collision-resistant hash functions. * Part of this work was done while visiting NTT Social Informatics Laboratories for an internship.

show abstract

Section: Is It Possible To Obfuscate Quantum Computation?mentioning

confidence: 99%