High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes

• URL: http://arxiv.org/abs/2102.02511v2
• Date: Mon, 10 May 2021 16:04:15 GMT
• Title: High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes
• Authors: Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti
• Abstract summary: 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 allow for retrieval with high rate for any number of colluding servers $t$ with $1 leq tleq n-k$.
• Score: 16.23970875497387
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identity to the servers holding the data. In the quantum PIR (QPIR) setting, a user privately retrieves a classical file by receiving quantum information from the servers. The QPIR problem has been treated by Song et al. in the case of replicated servers, both with and without collusion. QPIR over $[n,k]$ maximum distance separable (MDS) coded servers was recently considered by Allaix et al., but the collusion was essentially restricted to $t=n-k$ servers in the sense that a smaller $t$ would not improve the retrieval rate. In this paper, the QPIR setting is extended to allow for retrieval with high rate for any number of colluding servers $t$ with $1 \leq t \leq n-k$. Similarly to the previous cases, the rates achieved are better than those known or conjectured in the classical counterparts, as well as those of the previously proposed coded and colluding QPIR schemes. This is enabled by considering the stabilizer formalism and weakly self-dual generalized Reed--Solomon (GRS) star product codes.

Related papers

• Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack [9.054540533394928]
  modified version of the first code-based single-server computational PIR scheme proposed by Holzbaur, Hollanti, and Wachter-Zeh. In the case of retrieving multiple files, the rate of the modified scheme is largely unaffected and at par with the original scheme.
  arXiv  Detail & Related papers  (2024-02-05T10:37:26Z)
• Quantum Symmetric Private Information Retrieval with Secure Storage and Eavesdroppers [32.97918488607827]
  We consider both the classical and quantum variations of $X$-secure, $E$-eavesdropped and $T$-colluding symmetric private information retrieval (SPIR) We first develop a scheme for classical $X$-secure, $E$-eavesdropped and $T$-colluding SPIR (XSETSPIR) based on a modified version of cross subspace alignment (CSA)
  arXiv  Detail & Related papers  (2023-08-21T17:30:38Z)
• Group Pose: A Simple Baseline for End-to-End Multi-person Pose Estimation [102.02917299051757]
  We present a simple yet effective transformer approach, named Group Pose. We replace single self-attention over all the $Ntimes(K+1)$ queries with two subsequent group self-attentions. Experimental results on MS COCO and CrowdPose show that our approach without human box supervision is superior to previous methods.
  arXiv  Detail & Related papers  (2023-08-14T17:58:04Z)
• 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)
• 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)
• Quantum Private Information Retrieval for Quantum Messages [71.78056556634196]
  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.
  arXiv  Detail & Related papers  (2021-01-22T10:28:32Z)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)
• 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.