{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:47:02Z","timestamp":1775054822015,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540281382","type":"print"},{"value":"9783540319375","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535706_11","type":"book-chapter","created":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T18:03:17Z","timestamp":1280080997000},"page":"139-152","source":"Crossref","is-referenced-by-count":68,"title":["Privacy-Preserving Decision Trees over Vertically Partitioned Data"],"prefix":"10.1007","author":[{"given":"Jaideep","family":"Vaidya","sequence":"first","affiliation":[]},{"given":"Chris","family":"Clifton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/342009.335438","volume-title":"Proceedings of the 2000 ACM SIGMOD Conference on Management of Data","author":"R. Agrawal","year":"2000","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, Dallas, TX, pp. 439\u2013450. ACM, New York (2000)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 36\u201354. Springer, Heidelberg (2000)"},{"key":"11_CR3","first-page":"81","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Machine Learning\u00a01, 81\u2013106 (1986)","journal-title":"Machine Learning"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. Journal of Cryptology\u00a015, 177\u2013206 (2002)","journal-title":"Journal of Cryptology"},{"key":"11_CR5","unstructured":"Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Clifton, C., Estivill-Castro, V. (eds.) IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, Maebashi City, Japan, vol.\u00a014, pp. 1\u20138. Australian Computer Society (2002)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1145\/375551.375602","volume-title":"Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"D. Agrawal","year":"2001","unstructured":"Agrawal, D., Aggarwal, C.C.: On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Santa Barbara, California, USA, pp. 247\u2013255. ACM, New York (2001)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, pp. 217\u2013228 (2002)","DOI":"10.1145\/775047.775080"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Rizvi, S.J., Haritsa, J.R.: Maintaining data privacy in association rule mining. In: Proceedings of 28th International Conference on Very Large Data Bases, VLDB, Hong Kong, pp. 682\u2013693 (2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: Proceedings of the Third IEEE International Conference on Data Mining (ICDM 2003), Melbourne, Florida (2003)","DOI":"10.1109\/ICDM.2003.1250908"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M. Kantarc\u0131o\u01e7lu","year":"2004","unstructured":"Kantarc\u0131o\u01e7lu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Transactions on Knowledge and Data Engineering\u00a016, 1026\u20131037 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"11_CR11","unstructured":"Rozenberg, B., Gudes, E.: Privacy preserving frequent item-set mining in vertically partitioned databases. In: Proceedings of the Seventeenth Annual IFIP WG 11.3 Working Conference on Data and Applications Security, Estes Park, Colorado, U.S.A (2003)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, pp. 639\u2013644 (2002)","DOI":"10.1145\/775047.775142"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. In: Journal of Computer Security (to appear)","DOI":"10.3233\/JCS-2005-13401"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Lin, X., Clifton, C., Zhu, M.: Privacy preserving clustering with distributed EM mixture modeling. In: Knowledge and Information Systems 2004( to appear )","DOI":"10.1007\/s10115-004-0148-7"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, pp. 206\u2013215 (2003)","DOI":"10.1145\/956750.956776"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving na\u00efve bayes classifier for vertically partitioned data. In: 2004 SIAM International Conference on Data Mining, Lake Buena Vista, Florida, pp. 522\u2013526 (2004)","DOI":"10.1137\/1.9781611972740.59"},{"key":"11_CR17","volume-title":"Applied Cryptography","author":"B. Schneier","year":"1995","unstructured":"Schneier, B.: Applied Cryptography, 2nd edn. John Wiley & Sons, Chichester (1995)","edition":"2"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of ACM SIGMOD International Conference on Management of Data, San Diego, California (2003)","DOI":"10.1145\/872757.872771"},{"key":"11_CR20","unstructured":"Blake, C., Merz, C.: UCI repository of machine learning databases (1998)"},{"key":"11_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: General Cryptographic Protocols. In: The Foundations of Cryptography, vol.\u00a02. Cambridge University Press, Cambridge (2004)"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security XIX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535706_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T12:57:19Z","timestamp":1635771439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535706_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281382","9783540319375"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11535706_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}