BLIND QUANTUM COMPUTATION
From MaRDI portal
Publication:3430389
DOI10.1142/S0219749906002171zbMath1121.81015arXivquant-ph/0309152OpenAlexW1966842050MaRDI QIDQ3430389
Publication date: 21 March 2007
Published in: International Journal of Quantum Information (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0309152
quantum cryptographyinformation hidingsecure two-party computationsecure circuit evaluationinformation gain versus disturbance
Related Items (20)
Multiple-server flexible blind quantum computation in networks ⋮ Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity ⋮ Verification of quantum computation and the price of trust ⋮ Delegating quantum computation in the quantum random oracle model ⋮ Fault-tolerant quantum error correction code preparation in UBQC ⋮ Fault-tolerant blind quantum computing using GHZ states over depolarization channel ⋮ Quantum cryptography beyond quantum key distribution ⋮ Blind quantum signature with blind quantum computation ⋮ Symmetric quantum fully homomorphic encryption with perfect security ⋮ Quantum fully homomorphic encryption scheme based on universal quantum circuit ⋮ Photonic hybrid state entanglement swapping using cat state superpositions ⋮ Finite-data-size study on practical universal blind quantum computation ⋮ Measurement-Based and Universal Blind Quantum Computation ⋮ Unnamed Item ⋮ Application of blind quantum computation to two-party quantum computation ⋮ Quantum and semi-quantum blind signature schemes based on entanglement swapping ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ The brickwork state with fewer qubits in blind quantum computation ⋮ Multiparty blind quantum computation protocol with deterministic mutual identity authentication
Cites Work
This page was built for publication: BLIND QUANTUM COMPUTATION
