Multiparty Delegated Quantum Computing

  title={Multiparty Delegated Quantum Computing},
  author={Elham Kashefi and Anna Pappa},
  • E. Kashefi, Anna Pappa
  • Published 29 June 2016
  • Computer Science
  • Cryptogr.
Quantum computing has seen tremendous progress in the past few years. However, due to limitations in the scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of blind quantum computation, with guarantees for both the secrecy of the input and of the computation being… 

Figures from this paper

Private quantum computation: an introduction to blind quantum computing and related protocols

A review of the progress to date in quantum cryptography protocols addressing the task of securely delegating quantum computation to an untrusted device while maintaining the privacy, and in some instances the integrity, of the computation.

Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds

The main technical ingredient of the paper is the bootstraping of the MPQC construction by Double Blind Quantum Computation, a new composable resource for blind multiparty quantum computation, that demonstrates the surprising fact that the full protocol does not require verifiability of all components to achieve security.

Equivalence in delegated quantum computing

A novel stringent definition of the equivalence of protocols is provided and it is shown that these distinct DQC settings are, in fact, equivalent in this sense.

Composable secure multi-client delegated quantum computation

This paper constructs a composable secure multi-client delegated quantum computation scheme from any composableSecure single-client delegate quantum computation protocol and quantum authentication codes.

Secure Two-Party Quantum Computation Over Classical Channels

This work takes the first steps towards understanding the setting where two parties can communicate only via a classical channel, and indicates that in this setting it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.

Secure Quantum Computation with Classical Communication

  • James Bartusek
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2021
A constant-round composable protocol for blind and verifiable classical delegation of quantum computation is constructed, and applications to secure quantum computation with classical communication are shown.

Secure Quantum Two-Party Computation: Impossibility and Constructions

This work presents a first, simple and modular, construction of one-sided quantum two-party computation and quantum oblivious transfer over classical networks, and introduces the notion of oblivious quantum function evaluation (OQFE).

Private Set Intersection with Delegated Blind Quantum Computing

  • M. Amoretti
  • Computer Science
    2021 IEEE Global Communications Conference (GLOBECOM)
  • 2021
A protocol is proposed that solves the server-aided PSI problem using delegated blind quantum computing and is correct, secure and blind against a malicious server, and characterized by a quantum communication complexity that is linear in the input size.

Composable security in relativistic quantum cryptography

A framework for performing such a modular security analysis of classical and quantum cryptographic schemes in Minkowski space is introduced and implies in particular the non-composability of existing relativistic bit commitment and coin flipping protocols.

Security Limitations of Classical-Client Delegated Quantum Computing

A fundamental relationship between constructing ideal RSP resources (from classical channels) and the task of cloning quantum states is uncovered, and it is found that the realization of common RSP Resources, without weakening their guarantees drastically, is impossible due to the no-cloning theorem.



Extending the delegated verifiable blind quantum computation functionality

This contribution explores the asymmetric nature of UBQC and presents a "Yao" type protocol for secure two party quantum computation, which is secure against a specious (quantum honest-but-curious) garbler but in this case, against a (fully) malicious evaluator.

Composable Security of Delegated Quantum Computation

This work defines composable security for delegated quantum computation, and distinguishes between protocols which provide only blindness – the computation is hidden from the server – and those that are also verifiable – the client can check that it has received the correct result.

Insecurity of Quantum Secure Computations

  • H. Lo
  • Computer Science, Mathematics
  • 1996
This work shows that all one-sided two-party computations (which allow only one of the two parties to learn the result) are necessarily insecure, and constructs a class of functions that cannot be computed securely in any two-sidedTwo-party computation.

Unconditionally secure quantum bit commitment is impossible

It is shown that the claim that quantum cryptography can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space, or technology available to the cheaters, does not hold for any quantum bit commitment protocol.

Unconditionally verifiable blind quantum computation

It is rigorously proved that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter, which allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead.

Universal Blind Quantum Computation

The protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side.

Quantum Homomorphic Encryption for Polynomial-Sized Circuits

A new scheme for quantum homomorphic encryption which is compact and allows for efficient evaluation of arbitrary polynomial-sized quantum circuits, and a three-round scheme for blind delegated quantum computation which puts only very limited demands on the quantum abilities of the client.

Blind quantum computing with weak coherent pulses.

The concept of ϵ blindness for UBQC is introduced, in analogy to the concept ofπ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections.

Blind quantum computation protocol in which Alice only makes measurements

This work proposes another type of blind computing protocol where Alice does only measurements, such as the polarization measurements with a threshold detector, and the security of the protocol is based on the no-signaling principle, which is more fundamental than quantum physics.

Is Quantum Bit Commitment Really Possible?

At the heart of such optimism has been the widespread belief that unconditionally secure quantum bit commitment (QBC) schemes exist, which is put into very serious doubt by showing.