Locally Decodable Codes and Private Information Retrieval Schemes

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 ce...

Full description

Bibliographic Details
Main Author: Yekhanin, Sergey
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2010, 2010
Edition:1st ed. 2010
Series:Information Security and Cryptography
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02389nmm a2200301 u 4500
001 EB000384854
003 EBX01000000000000000237906
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783642143588 
100 1 |a Yekhanin, Sergey 
245 0 0 |a Locally Decodable Codes and Private Information Retrieval Schemes  |h Elektronische Ressource  |c by Sergey Yekhanin 
250 |a 1st ed. 2010 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2010, 2010 
300 |a XII, 82 p  |b online resource 
505 0 |a Locally decodable codes via the point removal method -- Limitations of the point removal method -- Private information retrieval 
653 |a Data Structures and Information Theory 
653 |a Information theory 
653 |a Data structures (Computer science) 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Information Security and Cryptography 
028 5 0 |a 10.1007/978-3-642-14358-8 
856 4 0 |u https://doi.org/10.1007/978-3-642-14358-8?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 003.54 
082 0 |a 005.73 
520 |a 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