Private Information Retrieval from Coded Storage

Research output: ThesisDoctoral ThesisCollection of Articles

Researchers

  • Razane Tajeddine

Research units

Abstract

Along with the technological advancements and the remarkable growth of digital data storage, new challenges arise regarding the reliabilty of the digital data storage and the privacy of the users. A distributed storage system (DSS) can store big amounts of data for a long time over possibly unreliable servers. As for the privacy concern of the users, much effort has been spent in trying to find systems and schemes that allow users to communicate, search, upload and download files while maintaining their privacy. One of those schemes is private information retrieval (PIR). PIR allows the users to hide the identity of files they request from a DSS. In other words, a PIR scheme allows the user to retrieve any file from a DSS without revealing the file identity to any of the servers. It goes without saying that, to achieve privacy, the user should download a bigger amount of data than the size of the desired file. The extra amount of data downloaded is quantified by the communication complexity of a PIR scheme. Naturally, downloading all the data from the DSS hides the identity of the desired file, but has a very high communication complexity, especially as the number of files in a DSS is typically very large. Moreover, this also raises the question of the server privacy, meaning that the user should not be able to retrieve any extra information about the undesired files while retrieving a certain file. Schemes taking into account the server privacy are called symmetric PIR (SPIR) schemes. This thesis focuses on constructing PIR schemes for different DSSs with low communication cost. We study different DSSs which reduce the storage cost of the system while providing reliability. We construct PIR schemes on such systems, where we consider both cases, the case where the servers in the DSS do not communicate, and the case where some subsets of the servers communicate in an effort to figure out the desired file identity. Moreover, we consider the SPIR problem, and consider the case where some servers may be unresponsive, such that they do not respond to the sent query, and the case where the servers may be malicious or unsynchronized and thus give false information to the user. Last but not least, this thesis also considers schemes providing privacy for users requesting data from a DSS over a random linear network.

Details

Translated title of the contributionPrivate Information Retrieval from Coded Storage
Original languageEnglish
QualificationDoctor's degree
Awarding Institution
Supervisors/Advisors
Publisher
  • Aalto University
Print ISBNs978-952-60-8421-3
Electronic ISBNs978-952-60-8422-0
Publication statusPublished - 2019
MoE publication typeG5 Doctoral dissertation (article)

    Research areas

  • privacy, information retrieval, coding, storage systems, Reed-Solomon codes, regenrating codes, networks

ID: 32446854