Garbled Quantum Computation
AbstractThe universal blind quantum computation protocol (UBQC) enables an almost classical client to delegate a quantum computation to an untrusted quantum server (in the form of a garbled quantum circuit) while the security for the client is unconditional. In this contribution, we explore the possibility of extending the verifiable UBQC, to achieve further functionalities following the analogous research for classical circuits (Yao 1986). First, exploring the asymmetric nature of UBQC (the client preparing only single qubits, while the server runs the entire quantum computation), we present a “Yao”-type protocol for secure two-party quantum computation. Similar to the classical setting, our quantum Yao protocol is secure against a specious (quantum honest-but-curious) garbler, but in our case, against a (fully) malicious evaluator. Unlike the previous work on quantum two-party computation of Dupuis et al., 2010, we do not require any online-quantum communication between the garbler and the evaluator and, thus, no extra cryptographic primitive. This feature will allow us to construct a simple universal one-time compiler for any quantum computation using one-time memory, in a similar way to the classical work of Goldwasser et al., 2008, while more efficiently than the previous work of Broadbent et al., 2013. View Full-Text
Share & Cite This Article
Kashefi, E.; Wallden, P. Garbled Quantum Computation. Cryptography 2017, 1, 6.
Kashefi E, Wallden P. Garbled Quantum Computation. Cryptography. 2017; 1(1):6.Chicago/Turabian Style
Kashefi, Elham; Wallden, Petros. 2017. "Garbled Quantum Computation." Cryptography 1, no. 1: 6.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.