How to construct random functions
Journal of the ACM (JACM)
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A New Approach To Information Theory
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Private Codes or Succinct Random Codes That Are (Almost) Perfect
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Public-Key Locally-Decodable Codes
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
The complexity of online memory checking
Journal of the ACM (JACM)
Authenticated Adversarial Routing
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
HAIL: a high-availability and integrity layer for cloud storage
Proceedings of the 16th ACM conference on Computer and communications security
Authenticated error-correcting codes with applications to multicast authentication
ACM Transactions on Information and System Security (TISSEC)
Opportunistic sensing: security challenges for the new paradigm
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
From weak to strong watermarking
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Optimal error correction for computationally bounded noise
IEEE Transactions on Information Theory
Public key locally decodable codes with short keys
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Optimally robust private information retrieval
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Private locally decodable codes
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.06 |
For computationally bounded adversarial models of error, we construct appealingly simple, efficient, cryptographic encoding and unique decoding schemes whose error-correction capability is much greater than classically possible. In particular: For binary alphabets, we construct positive-rate coding schemes which are uniquely decodable from a 1/2 – γerror rate for any constant γ 0. For large alphabets, we construct coding schemes which are uniquely decodable from a $1 - \sqrt{R}$error rate for any information rate R 0. Our results are qualitatively stronger than related work: the construction works in the public-key model (requiring no shared secret key or joint local state) and allows the channel to know everything that the receiver knows. In addition, our techniques can potentially be used to construct coding schemes that have information rates approaching the Shannon limit. Finally, our construction is qualitatively optimal: we show that unique decoding under high error rates is impossible in several natural relaxations of our model.