Главная
Study mode:
on
1
Intro
2
The point of this talk
3
Outline
4
What are error correcting codes?
5
Dumb Example: Repetition Code
6
What is "locality" in error correcting codes?
7
t-query Locally Decodable Code
8
Locally Decodable Codes Adversary introduces a 0.01 fraction of errors. Bob can recover a single symbol using a few queries (whp)
9
t-server Private Information Retrieval
10
Back to distributed storage
11
Low-communication decoding of RS codes?
12
Reed-Solomon codes are regenerating codes!
13
What do these look like?
14
Summary so far: Regenerating Codes
15
Application 1 Communication-Efficient Secret Sharing
16
A slightly different setting for PIR
17
RECALL What one of these schemes looks like
18
Example: Coded PIR with RS codes
Description:
Explore cryptography, local decoding, and distributed storage in this 48-minute conference talk by Mary Wootters at "Beyond Crypto: A TCS Perspective". Delve into error-correcting codes, including repetition codes and locally decodable codes, and their applications in adversarial scenarios. Examine the concept of locality in error-correcting codes and its relevance to t-query locally decodable codes and t-server private information retrieval. Investigate Reed-Solomon codes as regenerating codes and their role in distributed storage systems. Learn about low-communication decoding of RS codes and their application in communication-efficient secret sharing. Conclude with an exploration of coded private information retrieval using Reed-Solomon codes, providing a comprehensive overview of the intersection between cryptography, coding theory, and distributed systems.

Cryptography, Local Decoding, and Distributed Storage

TheIACR
Add to list
0:00 / 0:00