Cryptographic hardness based on the decoding of Reed-Solomon codes

IEEE Transactions on Information Theory

Volumn 54, Issue 6, 2008, Pages 2752-2769

  Kiayias, Aggelos ^a   Yung, Moti ^b,c  

^a University of Connecticut   (United States)

^b Department of Earth and Environmental Sciences   (United States)

^c GOOGLE INC   (United States)

Author keywords

Cryptographic primitives; Reed Solomon (RS) codes

Indexed keywords

CODES (STANDARDS); CODES (SYMBOLS); COMPUTER NETWORKS; CRYPTOGRAPHY; HARDNESS; INFORMATION THEORY; MICROFLUIDICS; NETWORK PROTOCOLS; NUMBER THEORY; NUMERICAL METHODS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; RANDOM PROCESSES; RAPID SOLIDIFICATION; REED-SOLOMON CODES; SEMANTICS; SET THEORY;

(001) PARAMETER; (PL) PROPERTIES; CODE WORDS; CRYPTOGRAPHIC PRIMITIVES; ERROR LOCATION; FINITE FIELDS; FORWARD SECRECY; OBLIVIOUS POLYNOMIAL EVALUATION (OPE); PARTIAL INFORMATION; PLAIN TEXT; POLYNOMIAL RECONSTRUCTION; POLYNOMIAL SOLUTION; PROVABLE SECURITY; PROVABLY SECURE; PSEUDO RANDOM NUMBER GENERATOR (PRNG); PSEUDO-RANDOM (PN); RANDOM NOISES; RANDOM VECTORS; REED SOLOMON (RS); REED-SOLOMON (RS) CODING; SEMANTIC SECURITY;

DECODING;

EID: 45249087656     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.921876     Document Type: Article

References (29)

1. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, "Strengths and weaknesses of quantum computing," SIAM J. Comput., vol. 26, no. 5, pp. 1510-1523, Oct. 1997.
2. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
3. E. R. Berlekamp and L. Welch, "Error correction of algebraic block codes," U.S. Patent 4 633 470, 1986.
4. D. Bleichenbacher, A. Kiayias, and M. Yung, "Decoding interleaved Reed-Solomon codes over noisy channels," Theor. Comput. Sci., vol. 379, no. 3, pp. 348-360, 2007.
5. D. Bleichenbacher and P. Nguyen, "Noisy polynomial interpolation and noisy Chinese remaindering," in Lecture Notes in Computer Science ser. 1807, B. Preneel, Ed. Berlin, Germany: Springer-Verlag, 2000, pp. 53-69.
6. M. Blum and S. Goldwasser, "An efficient probabilistic public-key encryption scheme which hides all partial information," in Lecture Notes in Computer Science, ser. 196, G. R. Blakley and D. Chaum, Eds. Berlin, Germany: Springer-Verlag, 1984.
7. D. Coppersmith and M. Sudan, "Reconstructing curves in three (and higher) dimensional space from noisy data," in Proc. 35th Annu. ACM Symp. Theory Comput., San Diego, CA, Jun. 9-11, 2003, pp. 136-142.
8. O. Goldreich, "A note on computational indistinguishability," Inf. Process. Lett., vol. 34, no. 6, pp. 277-281, 1990.
9. O. Goldreich, "A uniform complexity treatment of encryption and zero-knowledge," J. Cryptology, vol. 6, pp. 21-53, 1993.
10. O. Goldreich, Foundations of Cryptography. Cambridge, U.K.: Cambridge Univ. Press, 2001.
11. O. Goldreich, R. Rubinfeld, and M. Sudan, "Learning polynomials with queries: The highly noisy case," SIAM J. Discrete Math., vol. 13, no. 4, pp. 535-570, 2000.
12. S. Goldwasser and S. Micali, "Probabilistic encryption," J. Comput. Syst. Sci., vol. 28, no. 2, pp. 270-299, Apr. 1984.
13. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometry codes," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 1757-1767, Sep. 1999.
14. J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, "Construction of a pseudo-random generator from any one-way function," SIAM J. Comput. vol. 28, no. 4, pp. 1364-1396, 1999.
15. A. Kiayias, "Polynomial reconstruction based cryptography," Ph.D. dissertation, Comput. Sci. Dept., City Univ. New York, New York, 2002.
16. A. Kiayias and M. Yung, "Cryptographic hardness based on the de-coding of Reed Solomon codes," in Lecture Notes in Computer Science, ser. 2380, P. Widmayer, F. T. Ruiz, R. M. Bueno, M. Hennessy, S. Eidenbenz, and R. Conejo, Eds. Berlin, Germany: Springer-Verlag, 2002, pp. 232-243.
17. A. Kiayias and M. Yung, "Directions in polynomial reconstruction based cryptography," IEICE Trans., vol. E87-A, no. 5, pp. 978-985, May 2004.
18. J. Katz and M. Yung, "Characterization of security notions for probabilistic private-key encryption," J. Cryptology, vol. 19, no. 1, pp. 67-95, 2006.
19. M. Luby, Pseudorandomness and Cryptographic Applications. Princeton, NJ: Princeton Univ. Press, 1996.
20. F. J. MacWilliams and N. Sloane, The Theory of Error Correcting Codes Amsterdam, The Netherlands: North Holland, 1977.
21. M. Naor, "Bit commitment using pseudorandomness," J. Cryptology, vol. 4, no. 2, pp. 151-158, 1991.
22. M. Naor and B. Pinkas, "Oblivious transfer and polynomial evaluation," in Proc. T31st Annu. ACM Symp. Theory Comput., Atlanta, GA, May 1-4, 1999, pp. 245-254.
23. M. Naor and B. Pinkas, "Oblivious polynomial evaluation," SIAM J. Comput., vol. 35, no. 5, pp. 1254-1281, 2006.
24. M. Naor and O. Reingold, "Number-theoretic constructions of efficient pseudo-random functions," in Proc. 38th Annu. Symp. Found. Comput. Sci., Miami Beach, FL, Oct. 19-22, 1997, pp. 458-467.
25. F. Parvaresh and A. Vardy, "Correcting errors beyond the Guruswami-Sudan radius," in Proc. 46th Annu. IEEE Symp. Found. Comput. Sci., Pittsburgh, PA, Oct. 23-25, 2005, vol. 2005, pp. 285-294.
26. I. Reed and G. Solomon, "Polynomial codes over certain finite fields," SIAM J. Appl. Math., vol. 8, no. 2, pp. 300-304, 1960.
27. V. Shoup, A Computational Introduction to Number Theory and Algebra Cambridge, U.K.: Cambridge Univ. Press, 2005.
28. M. Sudan, "Decoding of Reed Solomon codes beyond the error-correction bound," J. Complexity, vol. 13, no. 1, pp. 180-193, 1997.
29. A. C. Yao, "Theory and applications of trapdoor functions," in Proc. 23rd Annu. Symp. Found. Comput. Sci., Chicago, IL, Nov. 3-5, 1982, pp. 80-91.