The functionality of classically-instructed remotely prepared random secret
qubits was introduced in (Cojocaru et al 2018) as a way to enable classical
parties to participate in secure quantum computation and communications
protocols. The idea is that a classical party (client) instructs a quantum
party (server) to generate a qubit to the server's side that is random, unknown
to the server but known to the client. Such task is only possible under
computational assumptions. In this contribution we define a simpler (basic)
primitive consisting of only BB84 states, and give a protocol that realizes
this primitive and that is secure against the strongest possible adversary (an
arbitrarily deviating malicious server). The specific functions used, were
constructed based on known trapdoor one-way functions, resulting to the
security of our basic primitive being reduced to the hardness of the Learning
With Errors problem. We then give a number of extensions, building on this
basic module: extension to larger set of states (that includes non-Clifford
states); proper consideration of the abort case; and verifiablity on the module
level. The latter is based on "blind self-testing", a notion we introduced,
proved in a limited setting and conjectured its validity for the most general
case.
%0 Generic
%1 cojocaru2019qfactory
%A Cojocaru, Alexandru
%A Colisson, Léo
%A Kashefi, Elham
%A Wallden, Petros
%D 2019
%K classical_client
%T QFactory: classically-instructed remote secret qubits preparation
%U http://arxiv.org/abs/1904.06303
%X The functionality of classically-instructed remotely prepared random secret
qubits was introduced in (Cojocaru et al 2018) as a way to enable classical
parties to participate in secure quantum computation and communications
protocols. The idea is that a classical party (client) instructs a quantum
party (server) to generate a qubit to the server's side that is random, unknown
to the server but known to the client. Such task is only possible under
computational assumptions. In this contribution we define a simpler (basic)
primitive consisting of only BB84 states, and give a protocol that realizes
this primitive and that is secure against the strongest possible adversary (an
arbitrarily deviating malicious server). The specific functions used, were
constructed based on known trapdoor one-way functions, resulting to the
security of our basic primitive being reduced to the hardness of the Learning
With Errors problem. We then give a number of extensions, building on this
basic module: extension to larger set of states (that includes non-Clifford
states); proper consideration of the abort case; and verifiablity on the module
level. The latter is based on "blind self-testing", a notion we introduced,
proved in a limited setting and conjectured its validity for the most general
case.
@misc{cojocaru2019qfactory,
abstract = {The functionality of classically-instructed remotely prepared random secret
qubits was introduced in (Cojocaru et al 2018) as a way to enable classical
parties to participate in secure quantum computation and communications
protocols. The idea is that a classical party (client) instructs a quantum
party (server) to generate a qubit to the server's side that is random, unknown
to the server but known to the client. Such task is only possible under
computational assumptions. In this contribution we define a simpler (basic)
primitive consisting of only BB84 states, and give a protocol that realizes
this primitive and that is secure against the strongest possible adversary (an
arbitrarily deviating malicious server). The specific functions used, were
constructed based on known trapdoor one-way functions, resulting to the
security of our basic primitive being reduced to the hardness of the Learning
With Errors problem. We then give a number of extensions, building on this
basic module: extension to larger set of states (that includes non-Clifford
states); proper consideration of the abort case; and verifiablity on the module
level. The latter is based on "blind self-testing", a notion we introduced,
proved in a limited setting and conjectured its validity for the most general
case.},
added-at = {2019-04-15T13:49:37.000+0200},
author = {Cojocaru, Alexandru and Colisson, Léo and Kashefi, Elham and Wallden, Petros},
biburl = {https://www.bibsonomy.org/bibtex/295a5a420fe162fc38f5cd6df1f59ee4c/annapappa},
description = {QFactory: classically-instructed remote secret qubits preparation},
interhash = {f014c964a96bdab0843727e3f3910b9e},
intrahash = {95a5a420fe162fc38f5cd6df1f59ee4c},
keywords = {classical_client},
note = {cite arxiv:1904.06303Comment: 51 pages, 4 figures},
timestamp = {2019-04-15T13:49:37.000+0200},
title = {QFactory: classically-instructed remote secret qubits preparation},
url = {http://arxiv.org/abs/1904.06303},
year = 2019
}