Computational Code-Based Single-Server Private Information Retrieval

No Thumbnail Available
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
Conference article in proceedings
This publication is imported from Aalto University research portal.
View publication in the Research portal

Other link related to publication
Date
2020-06
Major/Subject
Mcode
Degree programme
Language
en
Pages
6
1065-1070
Series
2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings, IEEE International Symposium on Information Theory - Proceedings, Volume 2020-June
Abstract
A new computational private information retrieval (PIR) scheme based on random linear codes is presented. A matrix of messages from a McEliece scheme is used to query the server with carefully chosen errors. The server responds with the sum of the scalar multiple of the rows of the query matrix and the files. The user recovers the desired file by erasure decoding the response. Contrary to code-based cryptographic systems, the scheme presented here enables to use truly random codes, not only codes disguised as such. Further, we show the relation to the so-called error subspace search problem and quotient error search problem, which we assume to be difficult, and show that the scheme is secure against attacks based on solving these problems.
Description
| openaire: EC/H2020/700621/EU//SmartResilience
Keywords
Other note
Citation
Holzbaur , L , Hollanti , C & Wachter-Zeh , A 2020 , Computational Code-Based Single-Server Private Information Retrieval . in 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings . , 9174138 , IEEE International Symposium on Information Theory - Proceedings , vol. 2020-June , IEEE , pp. 1065-1070 , IEEE International Symposium on Information Theory , Los Angeles , California , United States , 21/07/2020 . https://doi.org/10.1109/ISIT44484.2020.9174138