Locally Decodable Codes and Private Information Retrieval Schemes

In this book, the author provides a fresh algebraic look at the theory of locally decodable codes and private information retrieval schemes. The author's related thesis won the ACM Dissertation Award in 2007, and this book includes some expanded sections.

Locally decodable codes (LDCs) are codes that simultaneously provide efficient random access retrieval and high noise resilience by allowing reliable reconstruction of an arbitrary bit of a message by looking at only a small number of randomly chosen codeword bits. Local decodability comes with a certain loss in terms of efficiency specifically, locally decodable codes require longer codeword lengths than their classical counterparts. Private information retrieval (PIR) schemes are cryptographic protocols designed to safeguard the privacy of database users. They allow clients to retrieve records from public databases while completely hiding the identity of the retrieved records from database owners. In this book the author provides a fresh algebraic look at the theory of locally decodable codes and private information retrieval schemes, obtaining new families of each which have much better parameters than those of previously known constructions, and he also proves limitations of two server PIRs in a restricted setting that covers all currently known schemes. The author's related thesis won the ACM Dissertation Award in 2007, and this book includes some expanded sections and proofs, and notes on recent developments.

First book on this topic A fresh look at the theory Related thesis won the ACM Dissertation Award in 2007 Includes supplementary material: sn.pub/extras

Contenu
Locally decodable codes via the point removal method.- Limitations of the point removal method.- Private information retrieval.