Polynomial Reconstruction Based Cryptography
暂无分享,去创建一个
[1] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[2] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma (extended abstract) , 1999, STOC '99.
[3] Michael K. Reiter,et al. Password hardening based on keystroke dynamics , 1999, CCS '99.
[4] Carsten Lund,et al. On the hardness of computing the permanent of random matrices , 1996, STOC '92.
[5] Ronitt Rubinfeld,et al. Learning polynomials with queries: The highly noisy case , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[6] Jin-Yi Cai,et al. On the Hardness of Permanent , 1999, STACS.
[7] Phong Q. Nguyen,et al. Noisy Polynomial Interpolation and Noisy Chinese Remaindering , 2000, EUROCRYPT.
[8] Niv Gilboa,et al. Two Party RSA Key Generation , 1999, CRYPTO.
[9] Aggelos Kiayias,et al. Secure Games with Polynomial Expressions , 2001, ICALP.
[10] 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).
[11] Carsten Lund,et al. On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) , 1992, STOC.
[12] Robert J. McEliece,et al. A public key cryptosystem based on algebraic coding theory , 1978 .
[13] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[14] Hideki Imai,et al. Efficient Asymmetric Self-Enforcement Scheme with Public Traceability , 2001, Public Key Cryptography.
[15] 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).
[16] Aggelos Kiayias,et al. Polynomial Reconstruction Based Cryptography (A Short Survey) , 2001 .