Paper 2015/551
Quantum homomorphic encryption for circuits of low -gate complexity
Anne Broadbent and Stacey Jeffery
Abstract
Fully homomorphic encryption is an encryption method with the property that any computation on the plaintext can be performed by a party having access to the ciphertext only.
Here, we formally define and give schemes for \emph{quantum} homomorphic encryption, which is the encryption of \emph{quantum} information such that \emph{quantum} computations can be performed given the ciphertext only. Our schemes allow for arbitrary Clifford group gates, but become inefficient for circuits with
large complexity, measured in terms of the non-Clifford portion of the circuit (we use the ``
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in CRYPTO 2015
- Keywords
- quantum cryptographypublic-key cryptographysecret-key cryptographyhomomorphic encryption
- Contact author(s)
- smjeffery @ gmail com
- History
- 2015-06-12: received
- Short URL
- https://ia.cr/2015/551
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/551, author = {Anne Broadbent and Stacey Jeffery}, title = {Quantum homomorphic encryption for circuits of low $T$-gate complexity}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/551}, year = {2015}, url = {https://eprint.iacr.org/2015/551} }