Private Information Retrieval with limited server storage: combinatorics and coding theory

Lead Research Organisation: Royal Holloway University of London
Department Name: Mathematics

Abstract

Private Information Retrieval (PIR) schemes operate in the following setting. Suppose a database is stored on one or more remote servers. A user wishes to retrieve a piece of information from the database, but does not wish the servers to know which piece is being retrieved. PIR schemes allow this goal to be achieved.

Classically, the aim of a good PIR scheme is to reduce the amount of communication between the user and each server. More recently, a breakthrough paper of Fazeli, Vardy and Yaakobi has shown that techniques from coding theory can be used to reduce the amount of storage needed by the servers, without increasing the communication complexity to impractical levels: each server need not store the whole database. This aspect will become increasingly important as the size of remotely stored databases increases.

The proposal aims to study the ramifications of this breakthrough result: to construct better PIR schemes; to understand the limitations of the new techniques; to apply these techniques to related areas. This forms a part of a long-running project by the Principal Investigator to apply techniques from combinatorics, coding theory and algebra to problems in cryptography. The proposal includes an 8-month visit of Prof. Tuvi Etzion (Technion) to the UK, and a one-day meeting in the summer of 2016 to raise the academic profile of this rapidly developing area.

Planned Impact

In the short term, the impact of the research in this proposal is to the academic community. In the medium-term, the techniques (for enhancing privacy and reducing the need for storage) generated by this project will underpin real-world applications; their importance can only increase as the use of remote storage and of large databases becomes more prevalent. The efficient and secure use of distributed databases will contribute to the full spectrum of the Research Councils' definition of impact, including UK economic competitiveness (particularly in the digital economy), the effective delivery of public services (where large remotely-accessed databases are already used) and by enhancing quality of life by enabling new distributed applications. As well as the direct influence of the research itself, the project will enhance the community's awareness of the area's techniques and problems (via a one-day meeting, and associated collaborations). This background will benefit industry by training consulting academics, and researchers who move into associated industries.

Publications

10 25 50
 
Description The grant has led to the discovery of several new families of PIR array codes, which are a key building block in the construction of protocols for users to retrieve information privately and efficiently from a database stored across several remote servers. Two papers have been produced describing these constructions: "PIR array codes with optimal virtual server rate" (originally "PIR array codes with optimal PIR rate") by Blackburn and Etzion, and "PIR schemes with small download complexity and low storage requirements" by Blackburn, Etzion and Paterson. They have been posted on arXiv with a final version published in IEEE Transactions on Information Theory. Both papers appeared (in extended abstract form) at an IEEE Symposium in Information Theory. The first paper defines the virtual server rate, which measures how efficient a PIR code can be relative to the number of remote servers involved in the protocol. Schemes with good, often optimal, virtual server rate are constructed and upper bounds on the possible PIR rate are proved. The second paper constructs schemes where the amount of data downloaded from servers is small, with the aim of reducing the total storage requirements across all servers. Various bounds are proved on the minimum download complexity of such schemes.

One aim of the grant was to organise a meeting on the topic of Private Information Retrieval: the resulting meeting was very well attended and useful.
Exploitation Route This is underpinning work, designed to explore the possible data structures for storing a distributed database, and the possible protocols for delivering selected information privately to users. The work is near the start of a growing academic field, likely to expand significantly over the next few years. The work has already been taken forward as part of the academic literature in the area: as of mid-February 2020 Google Scholar lists 63 citations for the preprints/papers produced under the grant. In the longer term, beneficiaries in industry will include any business that uses large remotely-stored distributed databases, particularly that part of industry that designs and runs remote servers that store these databases. The results of the grant have been submitted to (and accepted by) high-profile conferences and journals that are read by both academia and industry, maximising the chances that the ideas generated will be taken up.
Sectors Digital/Communication/Information Technologies (including Software)

URL http://www.ma.rhul.ac.uk/SRBpapers