1 / 5

New Locally Decodable Codes and Private Information Retrieval Schemes

New Locally Decodable Codes and Private Information Retrieval Schemes. Sergey Yekhanin. LDCs and PIRs.

boyce
Télécharger la présentation

New Locally Decodable Codes and Private Information Retrieval Schemes

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. New Locally Decodable Codes and Private Information Retrieval Schemes Sergey Yekhanin

  2. LDCs and PIRs Definition: A code C encoding n bits to N bits is called q LDC if every bit of the message can be recovered (w.h.p.) by a randomized decoder reading only q bits of the encoding even after some constant fraction of the encoding has been corrupted. Definition: A q server PIR protocol is a protocol between a user and q non-communicating servers holding an n bit database D, that allows the user to retrieve any bit Di, while leaking no information about i to any server.

  3. LDCs: progress

  4. PIRs: progress

  5. Proof overview Goal: 3 query LDCs of length Exp(n1/3) • Regular Intersecting Families (RIFs) • RIFs yield LDCs • Basic linear-algebraic construction of RIFs • Combinatorial and algebraic niceness of sets • Main construction of RIFs

More Related