Polynomial Reconstruction Based Cryptography (A Short Survey)

Cryptography and Coding Theory are closely knitted in many respects. Recently, the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) was suggested as an intractability as- sumption upon which the security of cryptographic protocols can be based. This has initiated a line of research that exploited the rich al- gebraic structure of the problem and related subproblems of which in the cryptographic setting. Here we give a short overview of recent works on the subject and the novel applications that were enabled due to this development.

[1]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[2]  Ronitt Rubinfeld,et al.  Learning Polynomials with Queries: The Highly Noisy Case , 2000, SIAM J. Discret. Math..

[3]  Carsten Lund,et al.  On the hardness of computing the permanent of random matrices , 1996, STOC '92.

[4]  Phong Q. Nguyen,et al.  Noisy Polynomial Interpolation and Noisy Chinese Remaindering , 2000, EUROCRYPT.

[5]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[6]  Jin-Yi Cai,et al.  On the Hardness of Permanent , 1999, STACS.

[7]  Hideki Imai,et al.  Efficient Asymmetric Self-Enforcement Scheme with Public Traceability , 2001, Public Key Cryptography.

[8]  Moni Naor,et al.  Oblivious transfer and polynomial evaluation , 1999, STOC '99.

[9]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[10]  Michael K. Reiter,et al.  Password hardening based on keystroke dynamics , 2002, International Journal of Information Security.

[11]  Ravi Kumar,et al.  Proofs, codes, and polynomial-time reducibilities , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[12]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[13]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[14]  Niv Gilboa,et al.  Two Party RSA Key Generation , 1999, CRYPTO.

[15]  Aggelos Kiayias,et al.  Secure Games with Polynomial Expressions , 2001, ICALP.