Capacity of Quantum Private Information Retrieval With Multiple Servers

DOI10.1109/TIT.2020.3022515MaRDI QIDQ5151723zbMATH OpenOpenAlexFDO

Authors Seunghoan Song, Masahito Hayashi

Publication date 22 February 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.10209

capacity of quantum private information retrieval (QPIR)multiple servers rate-one protocol

Information storage and retrieval of data (68P20) Privacy of data (68P27) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Abstract: 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 contains the copy of a classical file set while the identity of the downloaded file is not leaked to each server. The QPIR capacity is defined as the maximum rate of the file size over the whole dimension of the downloaded quantum systems. When the servers are assumed to share prior entanglement, we prove that the QPIR capacity with multiple servers is 1 regardless of the number of servers and files. We construct a rate-one protocol only with two servers. This capacity-achieving protocol outperforms its classical counterpart in the sense of capacity, server secrecy, and upload cost. The strong converse bound is derived concisely without using any secrecy condition. We also prove that the capacity of multi-round QPIR is 1.

Cited in

(1)

Authenticated sublinear quantum private information retrieval

This page was built for publication: Capacity of Quantum Private Information Retrieval With Multiple Servers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151723)