© 2010

Locally Decodable Codes and Private Information Retrieval Schemes


Part of the Information Security and Cryptography book series (ISC)

Table of contents

  1. Front Matter
    Pages i-xii
  2. Sergey Yekhanin
    Pages 1-17
  3. Sergey Yekhanin
    Pages 47-59
  4. Sergey Yekhanin
    Pages 61-74
  5. Back Matter
    Pages 75-82

About this book


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.


Locally decodable codes Point removal method database information retrieval privacy private information retrieval

Authors and affiliations

  1. 1.Silicon Valley Lab.Microsoft ResearchMountain ViewUSA

Bibliographic information

  • Book Title Locally Decodable Codes and Private Information Retrieval Schemes
  • Authors Sergey Yekhanin
  • Series Title Information Security and Cryptography
  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Hardcover ISBN 978-3-642-14357-1
  • Softcover ISBN 978-3-642-26577-8
  • eBook ISBN 978-3-642-14358-8
  • Series ISSN 1619-7100
  • Edition Number 1
  • Number of Pages XII, 82
  • Number of Illustrations 0 b/w illustrations, 0 illustrations in colour
  • Topics Data Structures and Information Theory
  • Buy this book on publisher's site