Public-Key Locally-Decodable Codes

DOI10.1007/978-3-540-85174-5_8zbMath1183.94036OpenAlexW2171179652MaRDI QIDQ3600217

Rafail Ostrovsky, Brett Hemenway

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

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

Related Items (8)

Instantiability of RSA-OAEP under chosen-plaintext attack ⋮ Unnamed Item ⋮ Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption ⋮ Optimal security proofs for full domain hash. Revisited ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Optimal Computational Split-state Non-malleable Codes ⋮ Public Key Locally Decodable Codes with Short Keys

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