Sciweavers

103 search results - page 1 / 21
» Private Locally Decodable Codes
Sort
View
ICALP
2007
Springer
13 years 11 months ago
Private Locally Decodable Codes
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
Rafail Ostrovsky, Omkant Pandey, Amit Sahai
ICALP
2005
Springer
13 years 10 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf
ECCC
2006
120views more  ECCC 2006»
13 years 4 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 5 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
13 years 6 months ago
Public-Key Locally-Decodable Codes
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
Brett Hemenway, Rafail Ostrovsky