Security improvements of several basic quantum private query protocols with O(log N) communication complexity

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00115600" target="_blank" >RIV/00216224:14330/20:00115600 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.tcs.2019.12.008" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2019.12.008</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.tcs.2019.12.008" target="_blank" >10.1016/j.tcs.2019.12.008</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Security improvements of several basic quantum private query protocols with O(log N) communication complexity

Popis výsledku v původním jazyce

New quantum private database (with N elements) query protocols are presented and analyzed. Protocols preserve O (log N) communication complexity of known protocols for the same task, but achieve several significant improvements in security, especially concerning user privacy. For example, the randomized form of our protocol has a cheat-sensitive property - it allows the user to detect a dishonest database with a nonzero probability, while the phase-encoded private query protocols [6,7] for the same task do not have such a property. Moreover, when the database performs the computational basis measurement, a particular projective measurement which can cause a significant loss of user privacy in the previous private query protocols with O (log N) communication complexity, at most half of the user privacy could leak to such a database in our protocol, while in the QPQ protocol [5], the entire user privacy could leak out. In addition, it is proved here that for large N, the user could detect a cheating via the computational basis measurement, with a probability close to 1/2 using O(root N) special queries. Finally, it is shown here, for both forms of our protocol, basic and randomized, how a dishonest database has to act in case it could not learn user's queries.

Název v anglickém jazyce

Security improvements of several basic quantum private query protocols with O(log N) communication complexity

Popis výsledku anglicky

New quantum private database (with N elements) query protocols are presented and analyzed. Protocols preserve O (log N) communication complexity of known protocols for the same task, but achieve several significant improvements in security, especially concerning user privacy. For example, the randomized form of our protocol has a cheat-sensitive property - it allows the user to detect a dishonest database with a nonzero probability, while the phase-encoded private query protocols [6,7] for the same task do not have such a property. Moreover, when the database performs the computational basis measurement, a particular projective measurement which can cause a significant loss of user privacy in the previous private query protocols with O (log N) communication complexity, at most half of the user privacy could leak to such a database in our protocol, while in the QPQ protocol [5], the entire user privacy could leak out. In addition, it is proved here that for large N, the user could detect a cheating via the computational basis measurement, with a probability close to 1/2 using O(root N) special queries. Finally, it is shown here, for both forms of our protocol, basic and randomized, how a dishonest database has to act in case it could not learn user's queries.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

—

Svazek periodika

807

Číslo periodika v rámci svazku

6 February 2020

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

11

Strana od-do

330-340

Kód UT WoS článku

000512219400021

EID výsledku v databázi Scopus

2-s2.0-85077397571