Quantum $X$-Secure $B$-Byzantine $T$-Colluding Private Information Retrieval

• URL: http://arxiv.org/abs/2401.17252v2
• Date: Tue, 7 May 2024 17:19:49 GMT
• Title: Quantum $X$-Secure $B$-Byzantine $T$-Colluding Private Information Retrieval
• Authors: Mohamed Nomeir, Alptug Aytekin, Sennur Ulukus,
• Abstract summary: We consider the problems arising from the presence of Byzantine servers in a quantum private information retrieval (QPIR) setting. We show that quantum Byzantine servers have more capabilities than their classical counterparts due to the possibilities created by quantum encoding procedures.
• Score: 31.285983939625098
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the problems arising from the presence of Byzantine servers in a quantum private information retrieval (QPIR) setting. This is the first work to precisely define what the capabilities of Byzantine servers could be in a QPIR context. We show that quantum Byzantine servers have more capabilities than their classical counterparts due to the possibilities created by quantum encoding procedures. We focus on quantum Byzantine servers that can apply any reversible operation on their individual qudits. In this case, Byzantine servers can generate any error, i.e., this covers \emph{all} possible single qudit operations that can be applied by Byzantine servers on their qudits. We design a scheme based on cross-subspace alignment (CSA) and we show that this scheme achieves superdense coding gain in some cases.

Related papers

• Universal quantum homomorphic encryption based on $(k, n)$-threshold quantum state sharing [0.26217304977339473]
  homomorphic encryption integrates quantum computing with homomorphic encryption. We propose a $(k, n)$-threshold universal quantum homomorphic encryption scheme based on quantum state sharing.
  arXiv  Detail & Related papers  (2025-02-26T06:56:25Z)
• The Asymptotic Capacity of Byzantine Symmetric Private Information Retrieval and Its Consequences [31.285983939625098]
  We consider the problem of finding the capacity of symmetric private information retrieval (SPIR) with $B$ Byzantine servers. We define Byzantine servers, inspired by citebyzantine_tpir, as the servers that can share everything, before and after the scheme initiation.
  arXiv  Detail & Related papers  (2025-01-28T18:14:55Z)
• Byzantine-Eavesdropper Alliance: How to Achieve Symmetric Privacy in Quantum $X$-Secure $B$-Byzantine $E$-Eavesdropped $U$-Unresponsive $T$-Colluding PIR? [31.285983939625098]
  We consider the quantum emphsymmetric private information retrieval problem in a system with $N$ databases and $K$ messages. In the first model, there are $mathcalE$ eavesdropped links in the uplink direction (the direction from the user to the $N$ servers) In the second model, we consider the case with Byzantine servers that can coordinate to devise a plan to harm the privacy and security of the system together with static eavesdroppers.
  arXiv  Detail & Related papers  (2024-12-09T18:17:24Z)
• Understanding Byzantine Robustness in Federated Learning with A Black-box Server [47.98788470469994]
  Federated learning (FL) becomes vulnerable to Byzantine attacks where some of participators tend to damage the utility or discourage the convergence of the learned model. Previous works propose to apply robust rules to aggregate updates from participators against different types of Byzantine attacks. In practice, FL systems can involve a black-box server that makes the adopted aggregation rule inaccessible to participants, which can naturally defend or weaken some Byzantine attacks.
  arXiv  Detail & Related papers  (2024-08-12T10:18:24Z)
• 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)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Another Round of Breaking and Making Quantum Money: How to Not Build It from Lattices, and More [13.02553999059921]
  We provide both negative and positive results for publicly verifiable quantum money. We propose a framework for building quantum money and quantum lightning. We discuss potential instantiations of our framework.
  arXiv  Detail & Related papers  (2022-11-22T04:17:32Z)
• Beating the fault-tolerance bound and security loopholes for Byzantine agreement with a quantum solution [12.059343107638188]
  We propose a Byzantine agreement framework with unconditional security to break the $1/3$ fault-tolerance bound. Our work strictly obeys two Byzantine conditions and can be extended to any number of players without requirements for multiparticle entanglement. Our work indicates the quantum advantage in terms of consensus problems and suggests an important avenue for quantum blockchain and quantum consensus networks.
  arXiv  Detail & Related papers  (2022-06-18T09:46:58Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• 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)
• 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.