Private Information Retrieval over Random Linear Networks

Loading...
Thumbnail Image

Access rights

openAccess

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Date

2019-07-15

Major/Subject

Mcode

Degree programme

Language

en

Pages

Series

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY

Abstract

In this paper, the problem of providing privacy to users requesting data over a network from a distributed storage system (DSS) is considered. The DSS, which is considered as the multi-terminal destination of the network from the user’s perspective, is encoded by a maximum rank distance (MRD) code to store the data on these multiple servers. A private information retrieval (PIR) scheme ensures that a user can request a file without revealing any information on which file is being requested to any of the servers. In this paper, a novel PIR scheme is proposed, allowing the user to recover a file from a storage system with low communication cost, while allowing some servers in the system to collude in the quest of revealing the identity of the requested file. The network is modeled as a random linear network, i.e., all nodes of the network forward random (unknown) linear combinations of incoming packets. Both error-free and erroneous random linear networks are considered.

Description

Keywords

Data privacy, Frequency modulation, Information retrieval, Linear codes, Network coding, Servers, Uplink

Other note

Citation

Tajeddine, R, Wachter-Zeh, A & Hollanti, C 2019, ' Private Information Retrieval over Random Linear Networks ', IEEE Transactions on Information Forensics and Security, vol. 15, no. 1, pp. 790-799 . https://doi.org/10.1109/TIFS.2019.2928483