Composable Security of Delegated Quantum Computation

DOI10.1007/978-3-662-45608-8_22zbMath1318.68077arXiv1301.3662OpenAlexW2130618624WikidataQ59202458 ScholiaQ59202458MaRDI QIDQ2936621

Renato Renner, Vedran Dunjko, Christopher Portmann, Joseph Fitzsimons

Publication date: 6 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Data encryption (aspects in computer science) (68P25)

Related Items (15)

Composable and finite computational security of quantum message transmission ⋮ Arbitrable blind quantum computation ⋮ Security limitations of classical-client delegated quantum computing ⋮ Quantum cryptography beyond quantum key distribution ⋮ Secure quantum computation with classical communication ⋮ Unnamed Item ⋮ Optimised resource construction for verifiable quantum computation ⋮ On the obfuscatability of quantum point functions ⋮ Computing on quantum shared secrets for general quantum access structures ⋮ Robustness and device independence of verifiable blind quantum computing ⋮ Finite-data-size study on practical universal blind quantum computation ⋮ How to Verify a Quantum Computation ⋮ Dispelling myths on superposition attacks: formal security model and attack analyses ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits

This page was built for publication: Composable Security of Delegated Quantum Computation