Public-Key Locally-Decodable Codes

DOI10.1007/978-3-540-85174-5_8MaRDI QIDQ3600217zbMATH OpenOpenAlexFDO

Authors Brett Hemenway, Rafail Ostrovsky

Publication date 10 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85174-5_8

zbMATH Keywords

Chinese Remainder TheoremBounded Channel ModelError Correcting CodesLocally Decodable CodesPrivate Information RetrievalPublic Key Cryptography

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Cryptography (94A60) Decoding (94B35)

Recommendations

• Public key locally decodable codes with short keys
• Private Locally Decodable Codes
• On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
• On locally decodable codes, self-correctable codes, and \(t\)-private PIR
• Locally decodable codes and private information retrieval schemes.

Cited in

(11)

• Locally Decodable Codes
• Is there an oblivious RAM lower bound for online reads?
• Public key locally decodable codes with short keys
• Optimal security proofs for full domain hash. Revisited
• Outlaw distributions and locally decodable codes
• Optimal computational split-state non-malleable codes
• scientific article; zbMATH DE number 7376033 (Why is no real title available?)
• Locally decodable codes and private information retrieval schemes.
• Is there an oblivious RAM lower bound for online reads?
• Instantiability of RSA-OAEP under chosen-plaintext attack
• Improved cryptanalysis of the multi-prime -hiding assumption

This page was built for publication: Public-Key Locally-Decodable Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600217)