
Locally Decodable Codes and Private Information Retrieval Schemes
Sergey Yekhanin(Author)
Springer (Publisher)
Published on 2. January 2013
Book
Paperback/Softback
XII, 82 pages
978-3-642-26577-8 (ISBN)
Description
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.
More details
Series
Edition
2010 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XII, 82 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 6 mm
Weight
160 gr
ISBN-13
978-3-642-26577-8 (9783642265778)
DOI
10.1007/978-3-642-14358-8
Schweitzer Classification
Other editions
Additional editions

Book
11/2010
1st Edition
Springer
€106.99
Shipment within 7-9 days
Content
Locally decodable codes via the point removal method.- Limitations of the point removal method.- Private information retrieval.