Write, autoreview, editor, reviewer
3,125
edits
Secure Client- Server Delegated Computation: Difference between revisions
Secure Client- Server Delegated Computation (view source)
Revision as of 05:30, 11 July 2019
, 11 July 2019→Further Information
| Line 30: | Line 30: | ||
==Further Information== | ==Further Information== | ||
Secure Delegated Computation was an open problem in classical computation until Gentry's work in 1994 on Homomorphic Encryption using Lattice Based Cryptography [[Secure Client- Server Delegated Computation#References|(1)]]. An analogue was required in case of delegating quantum data. Childs proposed the first work in the field in 2005 [[Secure Client- Server Delegated Computation#References|(2)]]. Following this, new protocols came into picture, some using the measurement based quantum computation framework like blind quantum computation and some devising homomorphic encryption for quantum data. Out of which, Prepare-and-Send Universal Blind Quantum Computation has been proven to be universally composable i.e. it is secure in any and every scenerio | |||
possible. The only other protocol which is proven to be universally composable is [[Quantum Key Distribution]]. All the above protocols required quantum communication until the latest work by Urmila Mahadev in 2018, Classical Fully Homomorphic Encryption for Quantum Circuits. It requires no quantum operation on client's side. Pseudo-Secret Random Qubit Generator (PSQRG) is a functionality with multiple uses, one of which being universal blind quantum computation. This protocol also requires no quantum computation on client's side in order to instruct server to prepare her secret random qubits, of which she has complete knowledge but not the server. | |||
'''Review Papers:''' | |||
# [https://www.nature.com/articles/s41534-017-0025-3 Fitzsimons (2017)] | |||
# [https://arxiv.org/abs/1301.3662 Dunjko et al (2013)] | |||
(1) gives an overall view of delegated quantum computation prior to Urmila's result in 2018 and (2) gives the abstract cryptography framework for delegated computing and uses it prove universal composability of UBQC. | |||
==References== | |||
#[https://crypto.stanford.edu/craig/craig-thesis.pdf Gentry (1994)] | |||
#[https://arxiv.org/abs/quant-ph/0111046 Childs (2005)] | |||
<div style='text-align: right;'>''*contributed by Shraddha Singh''</div> | <div style='text-align: right;'>''*contributed by Shraddha Singh''</div> | ||