Code-Based Single-Server Private Information Retrieval : Circumventing the Sub-Query Attack

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

8 Downloads (Pure)

Abstract

Private information retrieval from a single server is considered, utilizing the hardness of the decoding problem of random linear codes. Presented is a modified version of the first code-based single-server computational PIR scheme proposed by Holzbaur, Hollanti, and Wachter-Zeh in [Holzbaur et al., 'Computational Code-Based Single-Server Private Information Retrieval', 2020 IEEE ISIT]. The original scheme was broken in [Bordage et al., 'On the privacy of a code-based single-server computational PIR scheme', Cryptogr. Comm., 2021] by an attack arising from highly probable rank differences in sub-matrices of the user's query. Here, this attack is now circumvented by ensuring that the sub-matrices have negligible rank difference. Furthermore, the rank difference cannot be attributed to the desired file index, thereby ensuring privacy. In the case of retrieving multiple files, the rate of the modified scheme is largely unaffected and at par with the original scheme.

Original languageEnglish
Title of host publication2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings
PublisherIEEE
Pages2880-2885
Number of pages6
ISBN (Electronic)979-8-3503-8284-6
DOIs
Publication statusPublished - 2024
MoE publication typeA4 Conference publication
EventIEEE International Symposium on Information Theory - Athens, Greece
Duration: 7 Jul 202412 Jul 2024

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
PublisherIEEE
ISSN (Print)2157-8095

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
Country/TerritoryGreece
CityAthens
Period07/07/202412/07/2024

Cite this