Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input
message by making a constant number of queries to a codeword, even if a constant fraction …

Locally decodable codes are a class of" error-correcting codes." Error-correcting codes help
to ensure reliability when transmitting information over noisy channels. They allow a sender …

A 2-server Private Information Retrieval (PIR) scheme allows a user to retrieve the i th bit of
an n-bit database replicated among two noncommunicating servers, while not revealing any …

Locally decodable codes are error-correcting codes that admit efficient decoding algorithms;
any bit of the original message can be recovered by looking at only a small number of …

An (r,δ,ϵ)-locally decodable code encodes ak-bit message x to an N-bit codeword C(x),
such that for every i∈k, the i th message bit can be recovered with probability 1-ϵ, by a …

An information-theoretic private information retrieval (PIR) protocol allows a client to retrieve
the i-th bit of a database, held by two or more servers, without revealing information about i …

In this work, we present the first local-decoding algorithm for expander codes. This yields a
new family of constant-rate codes that can recover from a constant fraction of errors in the …

Private information retrieval (PIR) allows a client to retrieve any block xi from a database x= x
1 xn such that i remains hidden from the database servers. PIR• protocols with unconditional …

Oblivious RAM (ORAM), introduced by Goldreich (STOC 1987) and Ostrovsky (STOC 1990),
can be used to read and write to memory in a way that hides which locations are being …

Locally decodable codes are error correcting codes that simultaneously provide efficient
random-access to encoded data and high noise resilience by allowing reliable …