| 书目名称 | Locally Decodable Codes and Private Information Retrieval Schemes |
| 编辑 | Sergey Yekhanin |
| 视频video | |
| 概述 | First book on this topic A fresh look at the theory Related thesis won the ACM Dissertation Award in 2007.Includes supplementary material: |
| 丛书名称 | Information Security and Cryptography |
| 图书封面 |  |
| 描述 | 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 proof |
| 出版日期 | Book 2010 |
| 关键词 | Locally decodable codes; Point removal method; database; information retrieval; privacy; private informat |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-14358-8 |
| isbn_softcover | 978-3-642-26577-8 |
| isbn_ebook | 978-3-642-14358-8Series ISSN 1619-7100 Series E-ISSN 2197-845X |
| issn_series | 1619-7100 |
| copyright | Springer-Verlag Berlin Heidelberg 2010 |
发表于 2025-3-21 18:26:10
