Private Information Retrieval: Combinatorics of the Star-Product Scheme
Loading...
URL
Journal Title
Journal ISSN
Volume Title
Perustieteiden korkeakoulu |
Master's thesis
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Authors
Date
2019-06-18
Department
Major/Subject
Mathematics
Mcode
SCI3054
Degree programme
Master’s Programme in Mathematics and Operations Research
Language
en
Pages
70+2
Series
Abstract
In coded private information retrieval (PIR), a user wants to download a file from a distributed storage system without revealing the identity of the file. We consider the setting where certain subsets of servers collude to deduce the identity of the requested file. These subsets form an abstract simplicial complex called the collusion pattern. In this thesis, we study the combinatorics of the general star-product scheme for PIR under the assumption that the distributed storage system is encoded using a repetition code.Description
Supervisor
Hollanti, CamillaThesis advisor
Freij-Hollanti, RagnarKeywords
private information retrieval, matroids, simplicial complexes, linear codes