Next Article in Journal
Maximum-Order Complexity and Correlation Measures
Next Article in Special Issue
Simple, Near-Optimal Quantum Protocols for Die-Rolling
Previous Article in Journal
Privacy in a Digital, Networked World: Technologies, Implications and Solutions. By Sherali Zeadally and Mohamad Badra. Springer International Publishing: 418 pp.; $51.89; ISBN-10: 3319084690, ISBN-13: 978-3319084695

Garbled Quantum Computation

by 1,2 and 1,*
School of Informatics, University of Edinburgh, 10 Crichton Street, Edinburgh EH8 9AB, UK
CNRS LTCI, UPMC–LIP6, 4 Place Jussieu 75252, Paris CEDEX 05, France
Author to whom correspondence should be addressed.
Academic Editor: Kwangjo Kim
Cryptography 2017, 1(1), 6;
Received: 2 March 2017 / Revised: 28 March 2017 / Accepted: 30 March 2017 / Published: 7 April 2017
(This article belongs to the Special Issue Quantum-Safe Cryptography)
The 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
Keywords: blind quantum computation; Yao’s two-party computation protocol; one-time memory blind quantum computation; Yao’s two-party computation protocol; one-time memory
Show Figures

Figure 1

MDPI and ACS Style

Kashefi, E.; Wallden, P. Garbled Quantum Computation. Cryptography 2017, 1, 6.

AMA Style

Kashefi E, Wallden P. Garbled Quantum Computation. Cryptography. 2017; 1(1):6.

Chicago/Turabian Style

Kashefi, Elham, and Petros Wallden. 2017. "Garbled Quantum Computation" Cryptography 1, no. 1: 6.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Back to TopTop