Composable security of delegated quantum computation

Abstract

Delegating difficult computations to remote large computation facilities, with appropriate security guarantees, is a possible solution for the ever-growing needs of personal computing power. For delegated computation protocols to be usable in a larger context---or simply to securely run two protocols in parallel---the security definitions need to be composable. Here, we define composable security for delegated quantum computation. We distinguish 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. We show that the composable security definition capturing both these notions can be reduced to a combination of several distinct "trace-distance-type" criteria---which are, individually, non-composable security definitions. Additionally, we study the security of some known delegated quantum computation protocols, including Broadbent, Fitzsimons and Kashefi's Universal Blind Quantum Computation protocol. Even though these protocols were originally proposed with insufficient security criteria, they turn out to still be secure given the stronger composable definitions.

37+9 pages, 13 figures. v3: minor changes, new references. v2: extended the reduction between composable and local security to include entangled inputs, substantially rewritten the introduction to the Abstract Cryptography (AC) framework

References in corpus (11)

• Experimental verification of quantum computations
• Quantum one-time programs
• Interactive Proofs For Quantum Computations
• Optimal Blind Quantum Computation
• Efficient universal blind computation
• Composable security of delegated quantum computation
• Ancilla-Driven Universal Blind Quantum Computation
• Continuous-variable blind quantum computation
• Cryptographic security of quantum key distribution
• Fault-tolerant Operations for Universal Blind Quantum Computation
• Composable security of measuring-Alice blind quantum computation

Cited by in corpus (45)

• Security in Quantum Cryptography
• Quantum Cryptography Beyond Quantum Key Distribution
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Verification of quantum computation: An overview of existing approaches
• Quantum computing on encrypted data
• Quantum homomorphic encryption for circuits of low $T$-gate complexity
• Robustness and device independence of verifiable blind quantum computing
• Quantum one-time programs
• Tools for quantum network design
• Composable security of delegated quantum computation
• Multiparty Delegated Quantum Computing
• How to Verify a Quantum Computation
• Device-Independent Verifiable Blind Quantum Computation
• Optimised resource construction for verifiable quantum computation
• Measurement-only verifiable blind quantum computing with quantum input verification
• Causal Boxes: Quantum Information-Processing Systems Closed under Composition
• Garbled Quantum Computation
• Composable security in relativistic quantum cryptography
• QEnclave -- A practical solution for secure quantum cloud computing
• Connecting Quantum Cities: Simulation of a Satellite-Based Quantum Network
• Probabilistic one-time programs using quantum entanglement
• Blind quantum computing with two almost identical states
• Security Limitations of Classical-Client Delegated Quantum Computing
• Nonadaptive fault-tolerant verification of quantum supremacy with noise
• Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations
• Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation
• Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)
• The Quantum Cut-and-Choose Technique and Quantum Two-Party Computation
• Composable and Finite Computational Security of Quantum Message Transmission
• Computing on Quantum Shared Secrets for General Quantum Access Structures
• Blind Oracular Quantum Computation
• Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States
• Quantum homomorphic encryption for polynomial-sized circuits
• Verified Delegated Quantum Computing with One Pure Qubit
• Composable Security for Multipartite Entanglement Verification
• Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority
• Secure Two-Party Quantum Computation Over Classical Channels
• Quantum randomized encoding, verification of quantum computing, no-cloning, and blind quantum computing
• Impossibility of blind quantum sampling for classical client
• On the composable security of weak coin flipping
• Towards practical secure delegated quantum computing with semi-classical light
• Quantum-enhanced Secure Delegated Classical Computing
• Blind quantum computation with completely classical client and a trusted center
• Blind quantum computing can always be made verifiable
• Unifying communication paradigms in measurement-based delegated quantum computing