عنوان

Locally decodable codes and private information retrieval schemes /

(Number (ISBN

3642143571

(Number (ISBN

364214358X

(Number (ISBN

9783642143571

(Number (ISBN

9783642143588

Number

b702152

Title Proper

Locally decodable codes and private information retrieval schemes /

General Material Designation

[Book]

First Statement of Responsibility

Sergey Yekhanin.

Place of Publication, Distribution, etc.

London :

Name of Publisher, Distributor, etc.

Springer,

Date of Publication, Distribution, etc.

2010.

Specific Material Designation and Extent of Item

1 online resource

Series Title

Information security and cryptography

Text of Note

Includes bibliographical references and index.

Text of Note

""Preface""; ""Acknowledgments""; ""Contents""; ""1 Introduction""; ""1.1 Locally decodable codes""; ""1.1.1 Hadamard code""; ""1.1.2 A code based on polynomial interpolation""; ""1.2 Private information retrieval schemes""; ""1.2.1 A PIR scheme based on polynomial interpolation""; ""1.3 The history of LDCs and PIR schemes""; ""1.3.1 The first generation: interpolation""; ""1.3.2 The second generation: recursion""; ""1.3.3 The third generation: point removal""; ""1.3.4 Lower bounds""; ""1.4 Applications of LDCs and PIR schemes""; ""1.4.1 Secure multiparty computation""

Text of Note

""1.4.2 Other models of private information retrieval""""1.4.3 Average-case complexity""; ""1.5 Organization of the book""; ""1.6 Addendum""; ""2 Locally decodable codes via the point removal method""; ""2.1 Notation""; ""2.2 Locally decodable codes""; ""2.3 Binary LDCs via point removal""; ""2.3.1 Regular intersecting families of sets""; ""2.3.2 Basic construction""; ""2.3.3 The main construction: point removal""; ""2.4 General LDCs via point removal""; ""2.5 Combinatorially nice subsets of Fp*""; ""2.6 Algebraically nice subsets of Fp*""

Text of Note

""2.6.1 3-dependences between p-th roots: sufficient conditions""""2.6.2 k-dependences between p-th roots: a sufficient condition""; ""2.6.3 Summary""; ""2.7 Results""; ""2.7.1 Results for three-query binary codes""; ""2.7.2 Results for general codes""; ""2.8 Addendum""; ""2.8.1 The code""; ""3 Limitations of the point removal method""; ""3.1 Attaining subexponential length requires a nice sequence""; ""3.1.1 Point removal method""; ""3.1.2 Point removal and bounds for P(rt-1)""; ""3.1.3 Our results""; ""3.2 A nice sequence yields short dependences between p-th roots""

Text of Note

""3.2.1 Algebraically nice subsets of Fq*""""3.2.2 Combinatorially nice subsets of Fq*""; ""3.2.3 Summary""; ""3.3 k-dependences between p-th roots: a necessary condition""; ""3.4 3-dependences between p-th roots: a necessary condition""; ""3.5 Summary""; ""3.6 Conclusions""; ""3.7 Addendum""; ""4 Private information retrieval""; ""4.1 Preliminaries""; ""4.2 From LDCs to PIR schemes""; ""4.2.1 Upper bounds for three-server binary PIR schemes""; ""4.2.2 Upper bounds for general PIR schemes""; ""4.3 A combinatorial view of two-server PIR""; ""4.3.1 Bilinear PIR""; ""4.3.2 Group-based PIR""

Text of Note

""4.4 Complexity of bilinear group-based PIR""""4.4.1 Algebraic preliminaries""; ""4.4.2 Algebraic formulation""; ""4.4.3 Low-dimensional principal ideals in group algebras""; ""4.5 Summary of lower bounds for two-server PIR""; ""4.6 Addendum""; ""References""; ""Index""

0

8

8

8

8

Text of Note

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

Source for Acquisition/Subscription Address

Springer

Stock Number

978-3-642-14357-1

Title

Locally decodable codes and private information retrieval schemes.

International Standard Book Number

9783642143571

Data encryption (Computer science)

Information retrieval.

COMPUTERS-- Security-- Cryptography.

Data encryption (Computer science)

Fehlerkorrekturcode

Information Retrieval

Information retrieval.

Informatique.

Kryptologie

Privatsphäre

Sicherheitsprotokoll

COM-- 083000

UMB

URY

Number

Edition

Class number

Book number

Yekhanin, Sergey.

Date of Transaction

20201207174521.0

Cataloguing Rules (Descriptive Conventions))

pn

Electronic name

[Book]

Y