Private Locally Decodable Codes
Private Locally Decodable Codes
复制标题
私有本地可解码代码
DOI：
10.1007/978-3-540-73420-8_35
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
A. Sahai
中科院分区：
文献类型：
--
作者：
R. Ostrovsky;Omkant Pandey;A. Sahai
我们考虑在存在计算有限的广告的情况下构建有效的本地解码代码的问题。从常数通道错误率ρ的任何给定的消息都可以与我们的知识状态进行比较，而无需加密假设。该消息的位在安全参数中可以忽略不计
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 construct efficient locally decodable codes with positive information rate and low (almost optimal) query complexity which can correctly decode any given bit of the message from constant channel error rate ρ. This compares favorably to our state of knowledge locally-decodable codes without cryptographic assumptions. For all our constructions, the probability for any polynomial-time adversary, that the decoding algorithm incorrectly decodes any bit of the message is negligible in the security parameter