Advertisement

Optimal Error Correction Against Computationally Bounded Noise

  • Silvio Micali
  • Chris Peikert
  • Madhu Sudan
  • David A. Wilson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3378)

Abstract

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:

  1. 1

    For binary alphabets, we construct positive-rate coding schemes which are uniquely decodable from a 1/2 – γ error rate for any constant γ> 0.

     
  2. 2

    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.

Keywords

Signature Scheme Information Rate High Error Rate Message Authentication Code Maximum Distance Separability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792–807 (1986)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281–308 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Gopalan, P., Lipton, R.J., Ding, Y.Z.: Error correction against computationally bounded adversaries. Manuscript (October 2004)Google Scholar
  4. 4.
    Guruswami, V.: List decoding with side information. In: 18th IEEE Annual Conference on Computational Complexity, pp. 300–312 (2003)Google Scholar
  5. 5.
    Guruswami, V., Håstad, J., Sudan, M., Zuckerman, D.: Combinatorial bounds for list decoding. In: Proceedings of the 38th Annual Allerton Conference on Communication, Control and Computing (2000)Google Scholar
  6. 6.
    Guruswami, V., Sudan, M.: Improved decoding of reed-solomon and algebraic-geometric codes. In: IEEE Symposium on Foundations of Computer Science, pp. 28–39 (1998)Google Scholar
  7. 7.
    Guruswami, V., Sudan, M.: List decoding algorithms for certain concatenated codes. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 181–190. ACM Press, New York (2000)CrossRefGoogle Scholar
  8. 8.
    Langberg, M.: Private codes or succinct random codes that are (almost) perfect. In: Proceedings of the forty-fifth annual IEEE Symposium on Foundations of Computer Science (2004)Google Scholar
  9. 9.
    Lipton, R.J.: A new approach to information theory. In: Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, pp. 699–708. Springer, Heidelberg (1994)Google Scholar
  10. 10.
    Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 387–394. ACM Press, New York (1990)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Silvio Micali
    • 1
  • Chris Peikert
    • 1
  • Madhu Sudan
    • 1
  • David A. Wilson
    • 1
  1. 1.CSAILMITCambridge

Personalised recommendations