Edinburgh Research Explorer

QFactory: classically-instructed remote secret qubits preparation

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Related Edinburgh Organisations

Open Access permissions

Open

Documents

https://eprint.iacr.org/2019/1237
https://link.springer.com/chapter/10.1007/978-3-030-34578-5_22
Original languageEnglish
Title of host publicationAdvances in Cryptology – ASIACRYPT 2019
EditorsSteven D. Galbraith, Shiho Moriai
PublisherSpringer, Cham
Pages615-645
Number of pages30
ISBN (Electronic)978-3-030-34578-5
ISBN (Print)978-3-030-34577-8
DOIs
Publication statusPublished - 25 Nov 2019
Event25th Annual International Conference on the Theory and Application of Cryptology and Information Security - Kobe, Japan
Duration: 8 Dec 201912 Dec 2019
https://asiacrypt.iacr.org/2019/

Publication series

NameLecture Notes in Computer Science (LNCS)
PublisherSpringer, Cham
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference25th Annual International Conference on the Theory and Application of Cryptology and Information Security
Abbreviated titleASIACRYPT 2019
CountryJapan
CityKobe
Period8/12/1912/12/19
Internet address

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 considera- tion 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.

    Research areas

  • Classical delegated quantum computation, Learning With Errors, Provable security

Download statistics

No data available

ID: 119007546