Abstract
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 assumption upon which the security of cryptographic protocols can be based. This has initiated a line of research that exploited the rich algebraic 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.
Chapter PDF
Keywords
- Cryptographic Protocol
- Homomorphic Encryption
- Oblivious Transfer
- Reed Solomon Code
- Cryptographic Application
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
Elwyn R. Berlekamp and L. Welch, Error Correction of Algebraic Block Codes. U.S. Patent, Number 4,633,470 1986.
Daniel Bleichenbacher, Aggelos Kiayias and Moti Yung, Batched Decoding of Reed-Solomon Codes with Correlated Errors, work in progress, 2001.
Daniel Bleichenbacher and Phong Nguyen, Noisy Polynomial Interpolation and Noisy Chinese Remaindering. In the Proceedings of EUROCRYPT2000, Lecture Notes in Computer Science, Springer, 2000.
Jin-Yi Cai, A. Pavan, and D. Sivakumar, On the Hardness of the Permanent, In the Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, 1999.
Uriel Feige and Carsten Lund, On the Hardness of Computing the Permanent of Random Matrices, In the Proceedings of the 24th ACM Symposium on the Theory of Computing, 1992.
Niv Gilboa, Two Party RSA Key Generation, CRYPTO 1999.
Oded Goldreich, Madhu Sudan and Ronitt Rubinfeld, Learning Polynomials with Queries: The Highly Noisy Case. In the Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995.
Sha. Goldwasser and Silvio Micali, Probabilistic Encryption, JCSS 28(2): 270–299, 1984.
Venkatesan Guruswami and Madhu Sudan, Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes. In the Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998.
Hirotaka Komaki, Yuji Watanabe, Goichiro Hanaoka, and Hideki Imai, Efficient Asymmetric Self-Enforcement Scheme with Public Traceability, International Workshop on Practice and Theory in Public Key Cryptography, 2001.
Aggelos Kiayias and Moti Yung, Secure Games with Polynomial Expressions, In the Proceedings of the 28th International Colloquium in Algorithms, Languages and Programming, 2001, pp. 939–950.
Aggelos Kiayias and Moti Yung, Cryptographic Hardness based on the Decoding of Reed-Solomon Codes, manuscript, 2001.
Aggelos Kiayias and Moti Yung, Symmetric Encryption based on Polynomial Reconstruction, manuscript, 2001.
S. Ravi Kumar and D. Sivakumar, Proofs, Codes and Polynomial-time Reducibilities, In the Proceedings of the 14th IEEE Conference on Computational Complexity, 1999.
Richard J. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory, JPL Deep Space Network Progress Report 42-44, pp. 114–116, 1978.
Fabian Monrose, Michael K. Reiter, and Suzanne Wetzel, Password Hardening based on Keystroke Dynamics. In the Proceedings of the 6th ACM Computer and Communications Security Conference, Singapore, November, 1999.
Moni Naor and Benny Pinkas, Oblivious Transfer and Polynomial Evaluation. In the Proceedings of the 31th ACM Symposium on the Theory of Computing, 1999.
Moni Naor and Benny Pinkas, Oblivious Polynomial Evaluation, manuscript 2001, available at http://www.wisdom.weizmann.ac.il/naor/onpub.html.
Madhu Sudan, Decoding of Reed Solomon Codes beyond the Error-Correction Bound. Journal of Complexity 13(1), pp. 180–193, 1997.
Madhu Sudan, Luca Trevisan and Salil Vadhan, Pseudorandom Generators without the XOR Lemma, In the Proceedings of the 31th ACM Symposium on the Theory of Computing, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiayias, A., Yung, M. (2001). Polynomial Reconstruction Based Cryptography. In: Vaudenay, S., Youssef, A.M. (eds) Selected Areas in Cryptography. SAC 2001. Lecture Notes in Computer Science, vol 2259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45537-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-45537-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43066-7
Online ISBN: 978-3-540-45537-0
eBook Packages: Springer Book Archive