On the possibility of classical client blind quantum computing
arXiv:1802.08759 · doi:10.3390/cryptography5010003
Abstract
We define the functionality of delegated pseudo-secret random qubit generator (PSRQG), where a classical client can instruct the preparation of a sequence of random qubits at some distant party. Their classical description is (computationally) unknown to any other party (including the distant party preparing them) but known to the client. We emphasize the unique feature that no quantum communication is required to implement PSRQG. This enables classical clients to perform a class of quantum communication protocols with only a public classical channel with a quantum server. A key such example is the delegated universal blind quantum computing. Using our functionality one could achieve a purely classical-client computational secure verifiable delegated universal quantum computing (also referred to as verifiable blind quantum computation). We give a concrete protocol (QFactory) implementing PSRQG, using the Learning-With-Errors problem to construct a trapdoor one-way function with certain desired properties (quantum-safe, two-regular, collision-resistant). We then prove the security in the Quantum-Honest-But-Curious setting and briefly discuss the extension to the malicious case.
50 pages, 3 figures, function construction in Section 6 corrected and other small changes
References in corpus (21)
- Quantum cryptography: Public key distribution and coin tossing
- Advances in Quantum Cryptography
- Universal blind quantum computation
- Quantum Cryptography Beyond Quantum Key Distribution
- Quantum digital signatures with quantum key distribution components
- Quantum homomorphic encryption for circuits of low -gate complexity
- Quantum one-time programs
- Efficient universal blind computation
- Optimal Blind Quantum Computation
- Limitations on information theoretically secure quantum homomorphic encryption
- Multiparty Delegated Quantum Computing
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- Experimental investigation of practical unforgeable quantum money
- A quantum approach to homomorphic encryption
- QFactory: classically-instructed remote secret qubits preparation
- Quantum Fully Homomorphic Encryption With Verification
- Practical Quantum Coin Flipping
- Garbled Quantum Computation
- Reducing resources for verification of quantum computations
- Succinct Blind Quantum Computation Using a Random Oracle
- Security Limitations of Classical-Client Delegated Quantum Computing
Cited by in corpus (7)
- Verifiable blind quantum computing with trapped ions and single photons
- Quantum cryptography beyond key distribution: theory and experiment
- Lattice-Based Quantum Advantage from Rotated Measurements
- Blindly Factorizing 21 Quantumly
- A Remote Quantum Error-correcting Code Preparation Protocol on Cluster State
- Towards practical secure delegated quantum computing with semi-classical light
- Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection