



@article {2058,
	title = {Quantum Fully Homomorphic Encryption With Verification},
	journal = {Proceedings of ASIACRYPT 2017},
	year = {2017},
	month = {2017/11/30},
	pages = {438-467},
	abstract = {<p><span style="font-family: \&quot;Lucida Grande\&quot;, helvetica, arial, verdana, sans-serif; font-size: 14.4px;">Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proofs, secure two-party computation, obfuscation, etc.) it is reasonable to hope that quantum FHE (or QFHE) will lead to many new results in the quantum setting. However, a crucial ingredient in almost all applications of FHE is circuit verification. Classically, verification is performed by checking a transcript of the homomorphic computation. Quantumly, this strategy is impossible due to no-cloning. This leads to an important open question: can quantum computations be delegated and verified in a non-interactive manner? In this work, we answer this question in the affirmative, by constructing a scheme for QFHE with verification (vQFHE). Our scheme provides authenticated encryption, and enables arbitrary polynomial-time quantum computations without the need of interaction between client and server. Verification is almost entirely classical; for computations that start and end with classical states, it is completely classical. As a first application, we show how to construct quantum one-time programs from classical one-time programs and vQFHE.</span></p>},
	doi = {10.1007/978-3-319-70694-8_16},
	url = {https://arxiv.org/abs/1708.09156},
	author = {Gorjan Alagic and Yfke Dulek and Christian Schaffner and Florian Speelman}
}
