Universal Blind Quantum Computation

DOI10.1109/FOCS.2009.36zbMath1292.81023arXiv0807.4154OpenAlexW3100206777MaRDI QIDQ5171217

Elham Kashefi, Joseph Fitzsimons, Anne Broadbent

Publication date: 25 July 2014

Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0807.4154

Mathematics Subject Classification ID

Quantum computation (81P68) Network protocols (68M12) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Quantum entanglement establishment between two strangers, Effective agent quantum private data query against malicious joint attack with blind quantum computing, Maximally nonlocal subspaces, Transferable quantum cheque scheme based on quantum public-key cryptography, Verification of quantum computation and the price of trust, Analysis of a tripartite entanglement distribution switch, Constant-round blind classical verification of quantum sampling, Delegating quantum computation in the quantum random oracle model, Classical Verification of Quantum Computations, Arbitrable blind quantum computation, Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security, Computational Security of Quantum Encryption, Impact of the malicious input data modification on the efficiency of quantum spatial search, Rigidity of quantum steering and one-sided device-independent verifiable quantum computation, Commuting quantum circuits and complexity of Ising partition functions, Fault-tolerant quantum error correction code preparation in UBQC, Improved multiparty quantum private comparison based on quantum homomorphic encryption, Entangled states as robust and re-usable carriers of information, Fault-tolerant blind quantum computing using GHZ states over depolarization channel, The quantum internet: a hardware review, Equivalence of single-server and multiple-server blind quantum computation protocols, A prototype of quantum von Neumann architecture, Secure two-party computation based on blind quantum computation, Secure delegated quantum algorithms for solving Mahalanobis distance, Categorical composable cryptography: extended version, Categorical composable cryptography, Universal blind quantum computation for hybrid system, Security limitations of classical-client delegated quantum computing, Public verifiable measurement-only blind quantum computation based on entanglement witnesses, Quantum cryptography beyond quantum key distribution, Rate-1 quantum fully homomorphic encryption, Blind quantum signature with blind quantum computation, Unnamed Item, A hybrid universal blind quantum computation, Entanglement distribution between quantum repeater nodes with an absorptive type memory, Optimised resource construction for verifiable quantum computation, Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing, An Introduction to Quantum Computing, without the Physics, Symmetric quantum fully homomorphic encryption with perfect security, Quantum fully homomorphic encryption scheme based on universal quantum circuit, Quantum security computation on shared secrets, Robustness and device independence of verifiable blind quantum computing, Secure multi-party quantum computation based on blind quantum computation, Multi-server blind quantum computation over collective-noise channels, Photonic four-qubit entangled decoherence-free states assisted by cavity-QED system, Single-server blind quantum computation with quantum circuit model, Controlled mutual quantum entity authentication with an untrusted third party, Finite-data-size study on practical universal blind quantum computation, Authenticated semiquantum dialogue with secure delegated quantum computation over a collective noise channel, Measurement-Based and Universal Blind Quantum Computation, Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation, How to Verify a Quantum Computation, Unnamed Item, Contextuality in multipartite pseudo-telepathy graph games, Arbitrated quantum signature with Hamiltonian algorithm based on blind quantum computation, Application of blind quantum computation to two-party quantum computation, Verifying quantum computations at scale: A cryptographic leash on quantum devices, Unitary circuit synthesis for tomography of generalized coherent states, Adiabatic graph-state quantum computation, Classical Homomorphic Encryption for Quantum Circuits, Classical Homomorphic Encryption for Quantum Circuits, Secure multi-party quantum private information query, Efficient arbitrated quantum signature scheme without entangled states, Verification of quantum computation: an overview of existing approaches, Quantum Homomorphic Encryption for Polynomial-Sized Circuits, Self-testing protocols based on the chained Bell inequalities, Optimal quantum networks and one-shot entropies, Blind quantum machine learning based on quantum circuit model, Quantum verifiable protocol for secure modulo zero-sum randomness, Measurement-based universal blind quantum computation with minor resources, Multi-server blind quantum computation protocol with limited classical communication among servers, The brickwork state with fewer qubits in blind quantum computation, Multiparty blind quantum computation protocol with deterministic mutual identity authentication, Computation in a general physical setting