The tremendous development of cloud computing and network technology makes it possible for multiple people with limited resources to complete a large-scale computing with the help of cloud servers. In order to protect the privacy of clients, secure multiparty computation plays an important role in the process of computing. Recently, Clementi et al[\textcolor[rgb]{0.00,0.07,1.00}{Phys. Rev. A {\bf 96}, 062317(2017)}] proposed a secure multiparty computation protocol using quantum resources. In their protocol, utilizing only linear classical computing and limited manipulation of quantum information, a method of computing
n−variable symmetric Boolean function
f(x1,x2,⋯,xn) with degree 2 is proposed, and all clients can jointly compute
f(x1,x2,⋯,xn) without revealing their private inputs with the help of a sever. They proposed an open problem: are there more simple nonlinear functions like the one presented by them that can be used as subroutines for larger computation protocols? We will give the answer to this question in this paper. Inspired by Clementi et al's work, we continue to explore the quantum realization of Boolean functions. First, we demonstrate a way to compute a class of
n−variable symmetric Boolean function
fnk by using single-particle quantum state
∣0⟩ and single-particle unitary operations
Uk. Second, we show that each
n−variable symmetric Boolean function can be represented by the linear combination of
fnk(k=0,1,⋯,n) and each function
fnk(2≤k≤n) can be used to perform secure multiparty computation. Third, we propose an universal quantum implementation method for arbitrary
n−variable symmetric Boolean function
f(x1,x2,⋯,xn). Finally, we demonstrate our secure multiparty computation protocol on IBM quantum cloud platform.
In this paper, we propose a multiparty delegated quantum computing protocol for the completely classical clients. Our protocol is mainly based on the work of Cojocaru et al, in which they proposed a concrete protocol that can make a classical client instruct a quantum server to prepare a random qubit. We simplify their protocol by replacing the one-way functions with the one-way permutations that are post-quantum secure only. Then we extend this improved scheme to multiparty delegated quantum computation, where a group of classical clients can delegate their joint computation task to a distrusted quantum server.
A longstanding question is whether it is possible to delegate computational tasks securely---such that neither the computation nor the data is revealed to the server. Recently, both a classical and a quantum solution to this problem were found [C. Gentry, in Proceedings of the 41st Annual ACM Symposium on the Theory of Computing (Association for Computing Machinery, New York, 2009), pp. 167--178; A. Broadbent, J. Fitzsimons, and E. Kashefi, in Proceedings of the 50th Annual Symposium on Foundations of Computer Science (IEEE Computer Society, Los Alamitos, CA, 2009), pp. 517--526]. Here, we study the first step towards the interplay between classical and quantum approaches and show how coherence can be used as a tool for secure delegated classical computation. We show that a client with limited computational capacity---restricted to an XOR gate---can perform universal classical computation by manipulating information carriers that may occupy superpositions of two states. Using single photonic qubits or coherent light, we experimentally implement secure delegated classical computations between an independent client and a server, which are installed in two different laboratories and separated by
50m. The server has access to the light sources and measurement devices, whereas the client may use only a restricted set of passive optical devices to manipulate the information-carrying light beams. Thus, our work highlights how minimal quantum and classical resources can be combined and exploited for classical computing.
Abstract Secure multi-party computation (SMPC) protocols allow several parties distrusting each other to collectively compute a function on their inputs, without revealing the input values. In this paper, we introduce a protocol that lifts SMPC to its quantum counterpart—secure multi-party quantum computation (SMPQC) for classical inputs and outputs—in a composable and statistically secure way, even for a single honest party. The soundness error—the maximum cheating probability of malicious parties—is shown to be proportional to the inverse of a polynomial with respect to the number of rounds in the protocol, and can be further decreased to a negligible quantity for bounded-error quantum-polynomial-time computations. Unlike previous SMPQC protocols, our proposal only requires very limited quantum resources from all but one party. In addition, the protocol exhibits some noise robustness that can facilitate small-scale implementations with near-future technologies. The protocol is based on a new technique for quantum verification that requires only the collective remote preparation of quantum states in a single plane of the Bloch sphere. To demonstrate the ability of verifying the computation with such limited clients, we uncover and use a fundamental invariance that is inherent to measurement-based quantum computing.
Abstract Quantum computing on encrypted data allows a client who has limited quantum capacity to delegate his or her private computation to an untrusted quantum server, while the input and output are encrypted by the quantum one-time pad and only the client can correctly decrypt them. Generally, the client is required to have ability to prepare some single qubits and perform some basic gates. In this work, we consider a further restricted situation where the client can only prepare one single qubit and perform one basic gate. Specifically, we show that as long as the client can prepare a fixed qubit and perform a fixed phase gate P , then he or she can still achieve the secure delegated quantum computation. Besides, our protocol can provide a more rigorous security for any quantum computation. For example, even if some encryption keys about the computation are leaked, it can still guarantee the privacy of the input and output. Finally, our protocol experimentally has a great significance in reducing the device complexity of the client's side.
The rapid evolution of quantum technologies is likely to cause major shifts in the mainstream computing landscape. In order to fully reach their potential in a wide base accessible to any user, remote access of quantum computers and manipulation of data with strong privacy and integrity guarantees are essential. Consider a setting where a client having a fully classical computer wants to determine the result of some quantum computation, but lacks the necessary resources to perform the computation herself. She has access to a more powerful server which has quantum resources and can solve the problem and send the outcome back to the client. However, the client does not trust the powerful server, so she needs to find a way to hide her data. Therefore, the main question that arises is how can we guarantee the client’s privacy of the input and even the computation itself against the server possessing quantum computational capabilities. In the present thesis, we study this problem, denoted here as classical secure delegation of quantum computations (CSDQC) between a fully classical honest client and a quantum untrusted server. We focus on different models of security, analyzing the limitations and potential of each of the settings. Concretely, we first study the CSDQC problem under information-theoretic security. We analyse two categories of quantum computations, decision and sampling problems and in both cases we provide evidence indicating the impossibility of achieving information-theoretic security. Subsequently, we consider relaxing the security framework and specifically, we will analyze this task in the computational security setting (against quantum polynomial-time adversaries). As a result, in the second part of the thesis we put forward the remote state preparation as a key component that would allow us to achieve classical secure delegation of universal quantum computations. We present two protocols realizing the remote state preparation primitive assuming only a classical channel between client and server. The first candidate is shown to be secure in the honest-but-curious model, while the second candidate is proven secure against the server in the malicious setting. The security of both constructions relies on the hardness of the learning with errors problem. Finally, given the important role the remote state preparation plays not only in CSDQC, but also in other quantum communication protocols, we analyze its composable security to determine the privacy loss as a result of using remote state preparation as a sub-module in different protocols.