Delegating quantum computation in the quantum random oracle model

DOI10.1007/978-3-030-36033-7_2zbMath1455.81016arXiv1810.05234OpenAlexW3103105946MaRDI QIDQ2175931

Jiayu Zhang

Publication date: 30 April 2020

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

zbMATH Keywords

quantum cryptographyquantum random oraclegarbled circuitKDM securityquantum computation delegation

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items

KDM security for the Fujisaki-Okamoto transformations in the QROM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum resource estimates for computing elliptic curve discrete logarithms
• Quantum and classical tradeoffs
• Quantum Homomorphic Encryption for Polynomial-Sized Circuits
• Quantum Computation and Quantum Information
• Random Oracles in a Quantum World
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Classical Homomorphic Encryption for Quantum Circuits
• BLIND QUANTUM COMPUTATION
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES
• Universal Blind Quantum Computation
• Revocable Quantum Timed-Release Encryption