Security limitations of classical-client delegated quantum computing
From MaRDI portal
Publication:2692401
DOI10.1007/978-3-030-64834-3_23OpenAlexW3046641999MaRDI QIDQ2692401
Atul Mantri, Elham Kashefi, Léo Colisson, Petros Wallden, Alexandru Cojocaru, Dominik Leichtle, Christian Badertscher
Publication date: 21 March 2023
Full work available at URL: https://arxiv.org/abs/2007.01668
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum FHE (almost) as secure as classical
- Cluster-state quantum computation
- Qfactory: classically-instructed remote secret qubits preparation
- Verification of quantum computation: an overview of existing approaches
- An operational approach to quantum probability
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits
- Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
- Composable Security of Delegated Quantum Computation
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Universally Composable Quantum Multi-party Computation
- Foundations of Cryptography
- Universal Blind Quantum Computation
- Verifying quantum computations at scale: A cryptographic leash on quantum devices
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Security limitations of classical-client delegated quantum computing