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

Loading...
Thumbnail Image

Access rights

openAccess
acceptedVersion

URL

Journal Title

Journal ISSN

Volume Title

A4 Artikkeli konferenssijulkaisussa

Date

2024

Major/Subject

Mcode

Degree programme

Language

en

Pages

6

Series

2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings, pp. 2880-2885, IEEE International Symposium on Information Theory - Proceedings

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.

Description

Publisher Copyright: © 2024 IEEE. | openaire: EC/HE/101072316/EU//ENCODE

Keywords

Other note

Citation

Verma, N & Hollanti, C 2024, Code-Based Single-Server Private Information Retrieval : Circumventing the Sub-Query Attack . in 2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings . IEEE International Symposium on Information Theory - Proceedings, IEEE, pp. 2880-2885, IEEE International Symposium on Information Theory, Athens, Greece, 07/07/2024 . https://doi.org/10.1109/ISIT57864.2024.10619469