Public Key Locally Decodable Codes with Short Keys

DOI10.1007/978-3-642-22935-0_51zbMath1343.94102OpenAlexW127527215MaRDI QIDQ3088130

Brett Hemenway, Rafail Ostrovsky, Mary Wootters, Martin J. Strauss

Publication date: 17 August 2011

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_51

zbMATH Keywords

public-key cryptographylocally decodable codesbounded channel

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Related Items (4)

Locally Decodable Codes for Edit Distance ⋮ Unnamed Item ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads?

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Efficient checking of polynomials and proofs and the hardness of approximation problems
• Concentration of the hypergeometric distribution
• Nearly-linear size holographic proofs
• On the efficiency of local decoding procedures for error-correcting codes
• Public-Key Locally-Decodable Codes
• 3-query locally decodable codes of subexponential length
• High-rate codes with sublinear-time decoding
• Private Locally Decodable Codes
• Some Applications of Coding Theory in Computational Complexity
• Theory of Cryptography
• Locally Decodable Codes

This page was built for publication: Public Key Locally Decodable Codes with Short Keys