Composable security of delegated quantum computation
From MaRDI portal
(Redirected from Publication:2936621)
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.
Recommendations
- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
- Secure quantum computation with classical communication
- Delegating quantum computation in the quantum random oracle model
- Security limitations of classical-client delegated quantum computing
- BLIND QUANTUM COMPUTATION
Cited in
(21)- Finite-data-size study on practical universal blind quantum computation
- Composable and finite computational security of quantum message transmission
- Delegating quantum computation in the quantum random oracle model
- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
- Verification of quantum computation: an overview of existing approaches
- Arbitrable blind quantum computation
- Security limitations of classical-client delegated quantum computing
- Secure quantum computation with classical communication
- Optimised resource construction for verifiable quantum computation
- Information theoretically secure hypothesis test for temporally unstructured quantum computation (extended abstract)
- How to Verify a Quantum Computation
- scientific article; zbMATH DE number 7561499 (Why is no real title available?)
- A simple protocol for verifiable delegation of quantum computation in one round
- DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES
- Robustness and device independence of verifiable blind quantum computing
- Dispelling myths on superposition attacks: formal security model and attack analyses
- Sumcheck-based delegation of quantum computing to rational server
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
- On the obfuscatability of quantum point functions
- Computing on quantum shared secrets for general quantum access structures
- Quantum cryptography beyond quantum key distribution
This page was built for publication: Composable security of delegated quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936621)
