Checked quantum preprocessing generates one-time tables and gives asymptotically secure two-party computation, including interactive quantum homomorphic encryption, without a trusted initializer.
Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Future quantum computers are likely to be expensive and affordable outright by few, motivating client/server models for outsourced computation. However, the applications for quantum computing will often involve sensitive data, and the client would like to keep her data secret, both from eavesdroppers and the server itself. Homomorphic encryption is an approach for encrypted, outsourced quantum computation, where the client's data remains secret, even during execution of the computation. We present a scheme for the homomorphic encryption of arbitrary quantum states of light with no more than a fixed number of photons, under the evolution of both passive and adaptive linear optics, the latter of which is universal for quantum computation. The scheme uses random coherent displacements in phase-space to obfuscate client data. In the limit of large coherent displacements, the protocol exhibits asymptotically perfect information-theoretic secrecy. The experimental requirements are modest, and easily implementable using present-day technology.
fields
quant-ph 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum preprocessing for information-theoretic security in two-party computation
Checked quantum preprocessing generates one-time tables and gives asymptotically secure two-party computation, including interactive quantum homomorphic encryption, without a trusted initializer.