000 -LEADER |
fixed length control field |
02707nam a22003975i 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OSt |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20140310151119.0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
fixed length control field |
cr nn 008mamaa |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
101109s2010 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9783642143588 |
|
978-3-642-14358-8 |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
QA76.9.D35 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
005.74 |
Edition number |
23 |
264 #1 - |
-- |
Berlin, Heidelberg : |
-- |
Springer Berlin Heidelberg, |
-- |
2010. |
912 ## - |
-- |
ZDB-2-SCS |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Yekhanin, Sergey. |
Relator term |
author. |
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
Title |
Locally Decodable Codes and Private Information Retrieval Schemes |
Medium |
[electronic resource] / |
Statement of responsibility, etc |
by Sergey Yekhanin. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
XII, 82 p. |
Other physical details |
online resource. |
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE |
Title |
Information Security and Cryptography, |
International Standard Serial Number |
1619-7100 |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
Locally decodable codes via the point removal method -- Limitations of the point removal method -- Private information retrieval. |
520 ## - SUMMARY, ETC. |
Summary, etc |
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 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computer science. |
|
Topical term or geographic name as entry element |
Data structures (Computer science). |
|
Topical term or geographic name as entry element |
Computer Science. |
|
Topical term or geographic name as entry element |
Data Structures, Cryptology and Information Theory. |
710 2# - ADDED ENTRY--CORPORATE NAME |
Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
773 0# - HOST ITEM ENTRY |
Title |
Springer eBooks |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
Display text |
Printed edition: |
International Standard Book Number |
9783642143571 |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-14358-8 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Item type |
E-Book |