Capacity of Quantum Private Information Retrieval With Multiple Servers

Song, Seunghoan1; Hayashi, Masahito1,2,3

10.1109/TIT.2020.3022515

2021-01

1557-9654

978-1-5386-9292-9

IEEE Transactions on Information Theory

67

1

452-463

7-12 July 2019

Paris, France

345 E 47TH ST, NEW YORK, NY 10017 USA

We study the capacity of quantum private information retrieval (QPIR) with multiple servers. In the QPIR problem with multiple servers, a user retrieves a classical file by downloading quantum systems from multiple servers each of which containing the whole classical file set, without revealing the identity of the retrieved file to any individual server. The QPIR capacity is defined as the maximum rate of the file size over the whole dimension of the downloaded quantum systems. Assuming the preexisting entanglement among servers, we prove that the QPIR capacity with multiple servers is 1 regardless of the number of servers and files. We propose a rate-one protocol which can be implemented by using only two servers. This capacity-achieving protocol outperforms its classical counterpart in the sense of the capacity, server secrecy, and upload cost. The strong converse bound is derived concisely without using the secrecy conditions.

Private information retrieval capacity quantum cryptography malicious adversary oblivious transfer (OT)

其他

CPCI-S ; SCI ; EI

COMPUTER SCIENCE

IEEE

1.Nagoya Univ, Grad Sch Math, Nagoya, Aichi, Japan
2.Natl Univ Singapore, Ctr Quantum Technol, Singapore, Singapore
3.Southern Univ Sci & Technol, Shenzhen Inst Quantum Sci & Engn, Shenzhen, Peoples R China

Song, Seunghoan,Hayashi, Masahito. Capacity of Quantum Private Information Retrieval With Multiple Servers[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA,2021:452-463.