1-out-of-2 oblivious transfer using a flawed bit-string quantum protocol

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F17%3A00095480" target="_blank" >RIV/00216224:14330/17:00095480 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1103/PhysRevA.95.042324" target="_blank" >http://dx.doi.org/10.1103/PhysRevA.95.042324</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1103/PhysRevA.95.042324" target="_blank" >10.1103/PhysRevA.95.042324</a>

Jazyk výsledku

angličtina

Název v původním jazyce

1-out-of-2 oblivious transfer using a flawed bit-string quantum protocol

Popis výsledku v původním jazyce

Oblivious transfer (OT) is an important tool in cryptography. It serves as a subroutine to other complex procedures of both theoretical and practical significance. A common attribute of OT protocols is that one party (Alice) has to send a message to another party (Bob) and has to stay oblivious to whether Bob did receive the message. Specific (OT) protocols vary by exact definition of the task—in the all-or-nothing protocol, Alice sends a single bit-string message, which Bob is able to read with only 50% probability, whereas in a 1-out-of-2 OT protocol Bob reads one out of two messages sent by Alice. These two flavors of protocol are known to be equivalent. Recently, a computationally secure all-or-nothing OT protocol based on quantum states was developed by A. Souto et al. [Phys. Rev. A91,042306(2015)], which, however, cannot be reduced to a 1-out-of-2 OT protocol by standard means. Here we present an elaborate reduction of this protocol that retains the security of the original.

Název v anglickém jazyce

1-out-of-2 oblivious transfer using a flawed bit-string quantum protocol

Popis výsledku anglicky

Oblivious transfer (OT) is an important tool in cryptography. It serves as a subroutine to other complex procedures of both theoretical and practical significance. A common attribute of OT protocols is that one party (Alice) has to send a message to another party (Bob) and has to stay oblivious to whether Bob did receive the message. Specific (OT) protocols vary by exact definition of the task—in the all-or-nothing protocol, Alice sends a single bit-string message, which Bob is able to read with only 50% probability, whereas in a 1-out-of-2 OT protocol Bob reads one out of two messages sent by Alice. These two flavors of protocol are known to be equivalent. Recently, a computationally secure all-or-nothing OT protocol based on quantum states was developed by A. Souto et al. [Phys. Rev. A91,042306(2015)], which, however, cannot be reduced to a 1-out-of-2 OT protocol by standard means. Here we present an elaborate reduction of this protocol that retains the security of the original.

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

<a href="/cs/project/GA16-22211S" target="_blank" >GA16-22211S: Rényiho entropie v kvantovém zpracování informace</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

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

Physical Review A

ISSN

2469-9926

e-ISSN

—

Svazek periodika

95

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

6

Strana od-do

042324

Kód UT WoS článku

000399783900005

EID výsledku v databázi Scopus

2-s2.0-85017634964