Private Information Retrieval: Combinatorics of the Star-Product Scheme

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.advisor Freij-Hollanti, Ragnar
dc.contributor.author Kuznetsova, Olga
dc.date.accessioned 2019-06-26T11:06:20Z
dc.date.available 2019-06-26T11:06:20Z
dc.date.issued 2019-06-18
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/39149
dc.description.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. en
dc.format.extent 70+2
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.title Private Information Retrieval: Combinatorics of the Star-Product Scheme en
dc.type G2 Pro gradu, diplomityö fi
dc.contributor.school Perustieteiden korkeakoulu fi
dc.subject.keyword private information retrieval en
dc.subject.keyword matroids en
dc.subject.keyword simplicial complexes en
dc.subject.keyword linear codes en
dc.identifier.urn URN:NBN:fi:aalto-201906264214
dc.programme.major Mathematics fi
dc.programme.mcode SCI3054 fi
dc.type.ontasot Master's thesis en
dc.type.ontasot Diplomityö fi
dc.contributor.supervisor Hollanti, Camilla
dc.programme Master’s Programme in Mathematics and Operations Research fi
local.aalto.electroniconly yes
local.aalto.openaccess yes


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search archive


Advanced Search

article-iconSubmit a publication

Browse