CB-cPIR: Code-Based Computational Private Information Retrieval

• URL: http://arxiv.org/abs/2505.03407v1
• Date: Tue, 06 May 2025 10:34:44 GMT
• Title: CB-cPIR: Code-Based Computational Private Information Retrieval
• Authors: Camilla Hollanti, Neehar Verma,
• Abstract summary: We present CB-cPIR, a single-server code-based computational private information retrieval scheme that derives security from code-based cryptography.<n>The scheme is heavily inspired by the pioneering code-based cPIR scheme proposed by Holzbaur, Hollanti, and Wachter-Zeh.
• Score: 9.054540533394928
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A private information retrieval (PIR) scheme is a protocol that allows a user to retrieve a file from a database without revealing the identity of the desired file to a curious database. Given a distributed data storage system, efficient PIR can be achieved by making assumptions about the colluding capabilities of the storage servers holding the database. If these assumptions turn out to be incorrect, privacy is lost. In this work, we focus on the worst-case assumption: full collusion or, equivalently, viewing the storage system virtually as a single honest-but-curious server. We present CB-cPIR, a single-server code-based computational private information retrieval (cPIR) scheme that derives security from code-based cryptography. Specifically, the queries are protected by the hardness of decoding a random linear code. The scheme is heavily inspired by the pioneering code-based cPIR scheme proposed by Holzbaur, Hollanti, and Wachter-Zeh in [Holzbaur et al., "Computational Code-Based Single-Server Private Information Retrieval", 2020 IEEE ISIT] and fixes the vulnerabilities of the original scheme arising from highly probable rank differences in submatrices of the user's query. For further validation, we draw comparisons to the state-of-the-art lattice-based cPIR schemes.

Related papers

• On the Security of a Code-Based PIR Scheme [1.3812010983144802]
  CB-cPIR is a pioneering effort to base PIR schemes on hard problems in coding theory.<n>Our research reveals a critical vulnerability in CB-cPIR, substantially diminishing its security levels.
  arXiv  Detail & Related papers  (2025-07-25T14:12:00Z)
• Cryptanalysis of a Lattice-Based PIR Scheme for Arbitrary Database Sizes [0.0]
  In 2008, Melchor and Gaborit proposed a PIR scheme that achieves a balance between communication overhead and server-side computational cost.<n>Liu and Bi identified a vulnerability in the scheme using lattice-based methods.<n>We present a novel two-stage attack that extends the work of Liu and Bi to databases of arbitrary sizes.
  arXiv  Detail & Related papers  (2025-05-09T10:25:03Z)
• Cryptanalysis via Machine Learning Based Information Theoretic Metrics [58.96805474751668]
  We propose two novel applications of machine learning (ML) algorithms to perform cryptanalysis on any cryptosystem.<n>These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem.<n>We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy.
  arXiv  Detail & Related papers  (2025-01-25T04:53:36Z)
• Enc2DB: A Hybrid and Adaptive Encrypted Query Processing Framework [47.11111145443189]
  We introduce Enc2DB, a novel secure database system following a hybrid strategy on and openGauss. We present a micro-benchmarking test and self-adaptive mode switch strategy that can choose the best execution path (cryptography or TEE) to answer a given query. We also design and implement a ciphertext index compatible with native cost model and querys to accelerate query processing.
  arXiv  Detail & Related papers  (2024-04-10T08:11:12Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• 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 Private Information Retrieval from Coded Storage Systems [0.0]
  In a Quantum Private Information Retrieval (QPIR) protocol, a user can retrieve information from a database by downloading quantum systems from multiple servers. This thesis aims to develop QPIR protocols for coded storage by combining known classical PIR protocols with quantum communication algorithms.
  arXiv  Detail & Related papers  (2023-12-10T12:36:10Z)
• PEOPL: Characterizing Privately Encoded Open Datasets with Public Labels [59.66777287810985]
  We introduce information-theoretic scores for privacy and utility, which quantify the average performance of an unfaithful user. We then theoretically characterize primitives in building families of encoding schemes that motivate the use of random deep neural networks.
  arXiv  Detail & Related papers  (2023-03-31T18:03:53Z)
• Deep Learning-Based Rate-Splitting Multiple Access for Reconfigurable Intelligent Surface-Aided Tera-Hertz Massive MIMO [56.022764337221325]
  Reconfigurable intelligent surface (RIS) can significantly enhance the service coverage of Tera-Hertz massive multiple-input multiple-output (MIMO) communication systems. However, obtaining accurate high-dimensional channel state information (CSI) with limited pilot and feedback signaling overhead is challenging. This paper proposes a deep learning (DL)-based rate-splitting multiple access scheme for RIS-aided Tera-Hertz multi-user multiple access systems.
  arXiv  Detail & Related papers  (2022-09-18T03:07:37Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)
• 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)
• Provably-secure symmetric private information retrieval with quantum cryptography [0.0]
  We propose using quantum key distribution (QKD) instead for a practical implementation, which can realise both the secure communication and shared randomness requirements. We prove that QKD maintains the security of the SPIR protocol and that it is also secure against any external eavesdropper.
  arXiv  Detail & Related papers  (2020-04-29T02:08:10Z)
• 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)

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.