Show simple item record

dc.contributor.authorGuarente, Jeffreyen_US
dc.date.accessioned2015-08-07T03:14:51Z
dc.date.available2015-08-07T03:14:51Z
dc.date.issued2013
dc.date.submitted2013
dc.identifier.other(ALMA)contemp
dc.identifier.urihttps://hdl.handle.net/2144/12769
dc.descriptionThesis (M.S.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you.en_US
dc.description.abstractPrivate Information Retrieval (PIR) is a protocol for a client to retrieve information from a server without revealing anything about which item (s)he retrieved. It has numerous applications but its impracticality due to extremely poor performance or awkward assumptions about its usage prevent its uptake. This work provides a background on the topic of PIR performance, frames the problem of finding efficient PIR as the problem of finding a code with a local decoding property, shows existing families of locally decodable codes are not suitable, and lists some requirements that codes must have to produce secure PIR.en_US
dc.language.isoen_US
dc.publisherBoston Universityen_US
dc.titleStudy of the computational efficiency of single server private information retrievalen_US
dc.typeThesis/Dissertationen_US
etd.degree.nameMaster of Scienceen_US
etd.degree.levelmastersen_US
etd.degree.disciplineComputer Scienceen_US
etd.degree.grantorBoston Universityen_US


This item appears in the following Collection(s)

Show simple item record