Locally Decodable Codes and Private Information Retrieval Schemes [recurso electrónico] / by Sergey Yekhanin.

Por: Yekhanin, Sergey [author.]Colaborador(es): SpringerLink (Online service)Tipo de material: Texto

TextoSeries Information Security and CryptographyEditor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Descripción: XII, 82 p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642143588Tema(s): Computer science | Data structures (Computer science) | Computer Science | Data Structures, Cryptology and Information TheoryFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 005.74 Clasificación LoC:QA76.9.D35Recursos en línea: Libro electrónico Texto

Contenidos:

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

En: Springer eBooksResumen: 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.

Existencias ( 1 )
Notas de título ( 3 )

Existencias
Tipo de ítem	Biblioteca actual	Colección	Signatura	Copia número	Estado	Fecha de vencimiento	Código de barras
Libro Electrónico	Biblioteca Electrónica	Colección de Libros Electrónicos	QA76.9 .D35 (Browse shelf(Abre debajo))	1	No para préstamo		374739-2001

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

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.