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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Yekhanin, Sergey (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edición:1st ed. 2010.
Colección:Information Security and Cryptography,
Temas:
Data structures (Computer science).
Information theory.
Data Structures and Information Theory.
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-14358-8
003 DE-He213
005 20220118142219.0
007 cr nn 008mamaa
008 101109s2010 gw | s |||| 0|eng d
020 |a 9783642143588  |9 978-3-642-14358-8 
024 7 |a 10.1007/978-3-642-14358-8  |2 doi 
050 4 |a QA76.9.D35 
050 4 |a Q350-390 
072 7 |a UMB  |2 bicssc 
072 7 |a GPF  |2 bicssc 
072 7 |a COM031000  |2 bisacsh 
072 7 |a UMB  |2 thema 
072 7 |a GPF  |2 thema 
082 0 4 |a 005.73  |2 23 
082 0 4 |a 003.54  |2 23 
100 1 |a Yekhanin, Sergey.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Locally Decodable Codes and Private Information Retrieval Schemes  |h [electronic resource] /  |c by Sergey Yekhanin. 
250 |a 1st ed. 2010. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2010. 
300 |a XII, 82 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Information Security and Cryptography,  |x 2197-845X 
505 0 |a Locally decodable codes via the point removal method -- Limitations of the point removal method -- Private information retrieval. 
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. 
650 0 |a Data structures (Computer science). 
650 0 |a Information theory. 
650 1 4 |a Data Structures and Information Theory. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642143571 
776 0 8 |i Printed edition:  |z 9783642265778 
776 0 8 |i Printed edition:  |z 9783642143595 
830 0 |a Information Security and Cryptography,  |x 2197-845X 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-14358-8  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 

Ejemplares similares