{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T01:18:03Z","timestamp":1774142283911,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679073","type":"print"},{"value":"9783540445982","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_3","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"36-54","source":"Crossref","is-referenced-by-count":480,"title":["Privacy Preserving Data Mining"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Lindell","sequence":"first","affiliation":[]},{"given":"Benny","family":"Pinkas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare and S. Micali, Non-interactive oblivious transfer and applications, Advances in Cryptology-Cryptord\u2019 89, pp. 547\u2013557, 1990.","DOI":"10.1007\/0-387-34805-0_48"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness theorems for non cryptographic fault tolerant distributed computation, 20th STOC, (1988), 1\u20139.","DOI":"10.1145\/62212.62213"},{"key":"3_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Proc. of Crypto\u2019 97","author":"D. Boneh","year":"1997","unstructured":"D. Boneh and M. Franklin, Efficient generation of shared RSA keys, Proc. of Crypto\u2019 97, LNCS, Vol. 1233, Springer-Verlag, pp. 425\u2013439, 1997."},{"key":"3_CR4","unstructured":"R. Canetti, Security and Composition of Multi-party Cryptographic Protocols. To appear in the Journal of Cryptology. Available from the Theory of Cryptography Library at http:\/\/philby.ucsd.edu\/cryptlib , 1998."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau and I. Damgard, Multiparty unconditionally secure protocols, 20th Proc. ACM Symp. on Theory of Computing, (1988), 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"3_CR6","unstructured":"B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan, Private Information Retrieval, 36th FOCS, pp. 41\u201350, 1995."},{"key":"3_CR7","unstructured":"R. Cramer, N. Gilboa. M. Naor, B. Pinkas and G. Poupard, Oblivious Polynomial Evaluation, 2000."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich and A. Lempel, A Randomized Protocol for Signing Contracts, Communications of the ACM 28, pp. 637\u2013647, 1985.","journal-title":"Communications of the ACM"},{"issue":"5","key":"3_CR9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"Ronald Fagin","year":"1996","unstructured":"R. Fagin, M. Naor and P. Winkler, Comparing Information Without Leaking It, Communications of the ACM, vol 39, May 1996, pp. 77\u201385.","journal-title":"Communications of the ACM"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum, J. Fong, M. Strauss and R. N. Wright, Secure Multiparty Computation of Approximations, manuscript, 2000.","DOI":"10.1007\/3-540-48224-5_75"},{"key":"3_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"Proc of Crypto\u2019 99","author":"N. Gilboa","year":"1999","unstructured":"N. Gilboa, Two Party RSA Key Generation, Proc of Crypto\u2019 99, Lecture Notes in Computer Science, Vol. 1666, Springer-Verlag, pp. 116\u2013129, 1999."},{"key":"3_CR12","unstructured":"O. Goldreich, Secure Multi-Party Computation, 1998. (Available at http:\/\/philby.ucsd.edu )"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson, How to Play any Mental Game-A Completeness Theorem for Protocols with Honest Majority. In 19th ACM Symposium on the Theory of Computing, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"3_CR14","unstructured":"J. Kilian, Uses of randomness in algorithms and protocols, MIT Press, 1990."},{"key":"3_CR15","unstructured":"T. Mitchell, Machine Learning. McGraw Hill, 1997."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas, Oblivious Transfer and Polynomial Evaluation, Proc. of the 31st STOC, Atlanta, GA, pp. 245\u2013254, May 1\u20134, 1999.","DOI":"10.1145\/301250.301312"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas, Efficient Oblivious Transfer Protocols, manuscript, 2000.","DOI":"10.1007\/3-540-44448-3_16"},{"key":"3_CR18","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Proc. of Eurocrypt\u2019 99","author":"P. Paillier","year":"1999","unstructured":"P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuocity Classes. Proc. of Eurocrypt\u2019 99, LNCS Vol. 1592, pp. 223\u2013238, 1999."},{"issue":"1","key":"3_CR19","first-page":"81","volume":"1","author":"J. R. Quinlan","year":"1986","unstructured":"J. Ross Quinlan, Induction of Decision Trees. Machine Learning 1(1): 81\u2013106 (1986)","journal-title":"Machine Learning"},{"key":"3_CR20","unstructured":"M. O. Rabin, How to exchange secrets by oblivious transfer, Tech. Memo TR-81, Aiken Computation Laboratory, 1981."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"A.C. Yao, How to generate and exchange secrets, Proc. of the 27th IEEE Symp. on Foundations of Computer Science, 1986, pp. 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T17:25:46Z","timestamp":1683825946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}