Constructions for Quantum Indistinguishability Obfuscation

Anne Broadbent and Raza Ali Kazmi

Abstract

An indistinguishability obfuscator is a probabilistic polynomial-time algorithm that takes a circuit as input and outputs a new circuit that has the same functionality as the input circuit, such that for any two circuits of the same size that compute the same function, the outputs of the indistinguishability obfuscator are indistinguishable. Here, we study schemes for indistinguishability obfuscation for quantum circuits. We present two definitions for indistinguishability obfuscation: in our first definition (qiO) the outputs of the obfuscator are required to be indistinguishable if the input circuits are perfectly equivalent, while in our second definition (qiOD), the outputs are required to be indistinguishable as long as the input circuits are approximately equivalent with respect to a pseudo-distance D. Our main results provide (1) a computationally-secure scheme for qiO where the size of the output of the obfuscator is exponential in the number of non-Clifford (T gates), which means that the construction is efficient as long as the number of T gates is logarithmic in the circuit size and (2)a statistically-secure qiOD, for circuits that are close to the kth level of the Gottesman-Chuang hierarchy (with respect to D); this construction is efficient as long as k is small and fixed.

Available format(s)
Category
Cryptographic protocols
Publication info
Preprint. MAJOR revision.
Keywords
Indistinguishability obfuscationquantum circuits
Contact author(s)
rkazmi @ uottawa ca
History
2021-07-18: last of 4 revisions
See all versions
Short URL
https://ia.cr/2020/639

CC BY

BibTeX

@misc{cryptoeprint:2020/639,
author = {Anne Broadbent and Raza Ali Kazmi},
title = {Constructions for Quantum Indistinguishability Obfuscation},
howpublished = {Cryptology ePrint Archive, Paper 2020/639},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/639}},
url = {https://eprint.iacr.org/2020/639}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.