{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:55:58Z","timestamp":1768910158591,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540429876","type":"print"},{"value":"9783540456827","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45682-1_22","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T06:31:48Z","timestamp":1180161108000},"page":"369-384","source":"Crossref","is-referenced-by-count":38,"title":["Oblivious Polynomial Evaluation and Oblivious Neural Learning"],"prefix":"10.1007","author":[{"given":"Yan-Cheng","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Jen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Non-interactive oblivious transfer and applications","author":"M. Bellare","year":"1990","unstructured":"M. Bellare and S. Micali, Non-interactive oblivious transfer and applications, in: Proc. CRYPTO\u2019 89, Lecture Notes in Computer Science, Vol. 435 (Springer, 1990), pp. 547\u2013557."},{"key":"22_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Decision Diffie-Hellman problem","author":"D. Boneh","year":"1998","unstructured":"D. Boneh, Decision Diffie-Hellman problem, in: Proc. Algorithmic Number Theory 1998, Lecture Notes in Computer Science, Vol. 1423 (Springer, 1998), pp. 48\u201363."},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/3-540-45539-6_4","volume-title":"Noisy polynomial interpolation and noisy chinese remaindering","author":"D. Bleichenbacher","year":"2000","unstructured":"D. Bleichenbacher and P. Nguyen, Noisy polynomial interpolation and noisy chinese remaindering, in: Proc. EUROCRYPT 2000, Lecture Notes in Computer Science, Vol. 1807 (Springer, 2000), pp. 53\u201369."},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, and C. Crepeau, Minimum disclosure proofs of knowledge, Journal of Computer and System Sciences 37(2), 1988, pp. 156\u2013189.","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Crepeau, and J. M. Robert, Information theoretical reductions among disclosure problems, in: Proc. 27th Ann. IEEE Symp. Foundations of Computer Science, 1986, pp. 168\u2013173.","DOI":"10.1109\/SFCS.1986.26"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damgard, Multiparty unconditionally secure protocols (extended abstract), in: Proc. 20th Ann. ACM Symp. Theory of Computing, 1988, pp. 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, and M. Naor, A minimal model for secure computation, in: Proc. 26th Ann. ACM Symp. Theory of Computing, 1994, pp. 554\u2013563.","DOI":"10.1145\/195058.195408"},{"key":"22_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"Two party RSA key generation","author":"N. Gilboa","year":"1999","unstructured":"Niv Gilboa, Two party RSA key generation, in: Proc. CRYPTO\u2019 99, Lecture Notes in Computer Science, Vol. 1666 (Springer, 1999), pp. 116\u2013129."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in: Proc. 19th Ann. ACM Symp. Theory of Computing, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a pseudorandom generator from any one-way function, SIAM Journal on Computing 28(4), 1999, pp. 1364\u20131396.","journal-title":"SIAM Journal on Computing"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and D. Zuckerman, How to recycle random bits, in: Proc. 30th Ann. IEEE Symp. Foundations of Computer Science, 1989, pp. 248\u2013253.","DOI":"10.1109\/SFCS.1989.63486"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Y. Ishai and E. Kushilevitz, Randomizing polynomials: a new representation with applications to round-efficient secure computaion, in: Proc. 41st Ann. IEEE Symp. Foundations of Computer Science, 2000, pp. 294\u2013304.","DOI":"10.1109\/SFCS.2000.892118"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"J. Kilian, Founding cryptography on oblivious transfer, in: Proc. 20th Ann. ACM Symp. Theory of Computing, 1988, pp. 20\u201331.","DOI":"10.1145\/62212.62215"},{"key":"22_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Privacy preserving data mining","author":"Y. Lindell","year":"2000","unstructured":"Y. Lindell and B. Pinkas, Privacy preserving data mining, in: Proc. CRYPTO 2000, Lecture Notes in Computer Science, Vol. 1880(Springer, 2000), pp. 36\u201354."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas, Oblivious transfer and polynomial evaluation, in: Proc. 31st Ann. ACM Symp. Theory of Computing, 1999, pp. 245\u2013254.","DOI":"10.1145\/301250.301312"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"T. Sander, A. Young, and M. Yung, Non-interactive cryptocomputing for NC1, in: Proc. 40th Ann. IEEE Symp. Foundations of Computer Science, 1999, pp. 554\u2013567.","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"A. C. Yao, How to generate and exchange secrets, in: Proc. 27th Ann. IEEE Symp. Foundations of Computer Science, 1986, pp. 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"},{"key":"22_CR18","unstructured":"J. M. Zurada, Introduction to Artificial Neural Systems, PWS Publishing, 1994."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45682-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:11:55Z","timestamp":1737051115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45682-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429876","9783540456827"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45682-1_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}