Quantum Private Information Retrieval for Quantum Messages

• URL: http://arxiv.org/abs/2101.09041v1
• Date: Fri, 22 Jan 2021 10:28:32 GMT
• Title: Quantum Private Information Retrieval for Quantum Messages
• Authors: Seunghoan Song and Masahito Hayashi
• Abstract summary: Quantum private information retrieval (QPIR) for quantum messages is the protocol in which a user retrieves one of the multiple quantum states from one or multiple servers without revealing which state is retrieved. We consider QPIR in two different settings: the blind setting, in which the servers contain one copy of the message states, and the visible setting, in which the servers contain the description of the message states.
• Score: 71.78056556634196
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum private information retrieval (QPIR) for quantum messages is the protocol in which a user retrieves one of the multiple quantum states from one or multiple servers without revealing which state is retrieved. We consider QPIR in two different settings: the blind setting, in which the servers contain one copy of the message states, and the visible setting, in which the servers contain the description of the message states. One trivial solution in both settings is downloading all states from the servers and the main goal of this paper is to find more efficient QPIR protocols. First, we prove that the trivial solution is optimal for one-server QPIR in the blind setting. In one-round protocols, the same optimality holds even in the visible setting. On the other hand, when the user and the server share entanglement, we prove that there exists an efficient one-server QPIR protocol in the blind setting. Furthermore, in the visible setting, we prove that it is possible to construct symmetric QPIR protocols in which the user obtains no information of the non-targeted messages. We construct three two-server symmetric QPIR protocols for pure states. Note that symmetric classical PIR is impossible without shared randomness unknown to the user.

Related papers

• Prior Entanglement Exponentially Improves One-Server Quantum Private Information Retrieval for Quantum Messages [60.889483085250355]
  We find an exponential gap in the communication complexities between the presence and absence of prior entanglement. We propose an efficient one-server one-round QPIR protocol with prior entanglement.
  arXiv  Detail & Related papers  (2023-04-11T10:34:53Z)
• Two-Server Oblivious Transfer for Quantum Messages [71.78056556634196]
  We propose two-server oblivious transfer protocols for quantum messages. Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network.
  arXiv  Detail & Related papers  (2022-11-07T05:12:24Z)
• Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems [71.78056556634196]
  This paper unifiedly addresses two kinds of key quantum secure tasks, i.e., quantum versions of secret sharing (SS) and symmetric private information retrieval (SPIR) In particular, two kinds of quantum extensions of SS are known; One is the classical-quantum (CQ) setting, in which the secret to be sent is classical information and the shares are quantum systems. We newly introduce the third setting, i.e., the entanglement-assisted (EA) setting, which is defined by modifying the CQ setting with allowing prior entanglement between the dealer and the end-user who recovers the secret by
  arXiv  Detail & Related papers  (2022-05-29T10:28:04Z)
• On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers [59.98425646542448]
  In quantum private information retrieval, a user retrieves a classical file from multiple servers by downloading quantum systems without revealing the identity of the file. The capacity of QPIR from MDS-coded and colluding servers is studied for the first time.
  arXiv  Detail & Related papers  (2021-06-28T13:48:22Z)
• Multi-server Blind Quantum Computation Protocol With Limited Classical Communication Among Servers [0.0]
  We propose a protocol, by extend this two-server protocol to multiple servers, which remains secure even if some servers communicate with each other after the computation. Dummy gates and a circuit modeled after brickwork states play a crucial role in the new protocol.
  arXiv  Detail & Related papers  (2021-06-10T06:58:22Z)
• Quantum Private Information Retrieval from Coded and Colluding Servers [16.23970875497387]
  In the quantum PIR (QPIR) setting, a user privately retrieves a classical file by receiving quantum information from the servers. In this paper, the QPIR setting is extended to account for maximum distance separable (MDS) coded servers. The rates achieved are better than those known or conjectured in the classical counterparts.
  arXiv  Detail & Related papers  (2020-01-16T15:19:08Z)
• Capacity of Quantum Private Information Retrieval with Colluding Servers [71.78056556634196]
  Quantum private information retrieval (QPIR) is a protocol in which a user retrieves one of multiple files from non-communicating servers. As variants of QPIR with stronger security requirements, symmetric QPIR is a protocol in which no other files than the target file are leaked to the user. We construct a capacity-achieving QPIR protocol by the stabilizer formalism and prove the optimality of our protocol.
  arXiv  Detail & Related papers  (2020-01-13T18:12:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.