{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:29:02Z","timestamp":1775096942817,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540430667","type":"print"},{"value":"9783540455370","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45537-x_10","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T17:29:27Z","timestamp":1180891767000},"page":"129-133","source":"Crossref","is-referenced-by-count":11,"title":["Polynomial Reconstruction Based Cryptography"],"prefix":"10.1007","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"10_CR1","unstructured":"Elwyn R. Berlekamp and L. Welch, Error Correction of Algebraic Block Codes. U.S. Patent, Number 4,633,470 1986."},{"key":"10_CR2","unstructured":"Daniel Bleichenbacher, Aggelos Kiayias and Moti Yung, Batched Decoding of Reed-Solomon Codes with Correlated Errors, work in progress, 2001."},{"key":"10_CR3","series-title":"Lect Notes Comput Sci","volume-title":"the Proceedings of EUROCRYPT2000","author":"D. Bleichenbacher","year":"2000","unstructured":"Daniel Bleichenbacher and Phong Nguyen, Noisy Polynomial Interpolation and Noisy Chinese Remaindering. In the Proceedings of EUROCRYPT2000, Lecture Notes in Computer Science, Springer, 2000."},{"key":"10_CR4","unstructured":"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."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/129712.129775"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Niv Gilboa, Two Party RSA Key Generation, CRYPTO 1999.","DOI":"10.1007\/3-540-48405-1_8"},{"key":"10_CR7","unstructured":"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."},{"issue":"2","key":"10_CR8","first-page":"270","volume":"28","author":"Sha. Goldwasser","year":"1984","unstructured":"Sha. Goldwasser and Silvio Micali, Probabilistic Encryption, JCSS 28(2): 270\u2013299, 1984.","journal-title":"JCSS"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/SFCS.1998.743426"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-44586-2_17"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013950.","DOI":"10.1007\/3-540-48224-5_76"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Aggelos Kiayias and Moti Yung, Cryptographic Hardness based on the Decoding of Reed-Solomon Codes, manuscript, 2001.","DOI":"10.1007\/3-540-45465-9_21"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Aggelos Kiayias and Moti Yung, Symmetric Encryption based on Polynomial Reconstruction, manuscript, 2001.","DOI":"10.1007\/3-540-45537-X_10"},{"key":"10_CR14","unstructured":"S. Ravi Kumar and D. Sivakumar, Proofs, Codes and Polynomial-time Reducibilities, In the Proceedings of the 14th IEEE Conference on Computational Complexity, 1999."},{"key":"10_CR15","unstructured":"Richard J. McEliece, A Public-Key Cryptosystem Based on Algebraic Coding Theory, JPL Deep Space Network Progress Report 42-44, pp. 114\u2013116, 1978."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/319709.319720"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Moni Naor and Benny Pinkas, Oblivious Transfer and Polynomial Evaluation. In the Proceedings of the 31th ACM Symposium on the Theory of Computing, 1999.","DOI":"10.1145\/301250.301312"},{"key":"10_CR18","unstructured":"Moni Naor and Benny Pinkas, Oblivious Polynomial Evaluation, manuscript 2001, available at http:\/\/www.wisdom.weizmann.ac.il\/naor\/onpub.html ."},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jcom.1997.0439","volume":"13","author":"M. Sudan","year":"1997","unstructured":"Madhu Sudan, Decoding of Reed Solomon Codes beyond the Error-Correction Bound. Journal of Complexity 13(1), pp. 180\u2013193, 1997.","journal-title":"Journal of Complexity"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/301250.301397"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45537-X_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:58:25Z","timestamp":1556456305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45537-X_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430667","9783540455370"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45537-x_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}