{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T05:45:15Z","timestamp":1778305515921,"version":"3.51.4"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,26]],"date-time":"2007-01-26T00:00:00Z","timestamp":1169769600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2007,2,24]]},"DOI":"10.1007\/s10618-006-0051-9","type":"journal-article","created":{"date-parts":[[2007,1,25]],"date-time":"2007-01-25T20:23:13Z","timestamp":1169756593000},"page":"131-170","source":"Crossref","is-referenced-by-count":44,"title":["Privacy-preserving boosting"],"prefix":"10.1007","volume":"14","author":[{"given":"S\u00e9bastien","family":"Gambs","sequence":"first","affiliation":[]},{"given":"Bal\u00e1zs","family":"K\u00e9gl","sequence":"additional","affiliation":[]},{"given":"Esma","family":"A\u00efmeur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,1,26]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal D, Aggarwal CC (2001) On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the 20th ACM symposium of principles of databases systems, pp 247\u2013255","DOI":"10.1145\/375551.375602"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 439\u2013450","DOI":"10.1145\/342009.335438"},{"key":"51_CR3","unstructured":"A\u00efmeur E, Brassard G, Gambs S, K\u00e9gl B (2004) Privacy-preserving boosting. In: Proceedings of the international workshop on privacy and security issues in data mining, in conjunction with PKDD\u201904, pp 51\u201369"},{"key":"51_CR4","unstructured":"Amit Y, Blanchard G, Wilder K (2000) Multiple randomized classifiers: MRCL. Technical Report 496, Department of Statistics, University of Chicago"},{"key":"51_CR5","unstructured":"Atallah MJ, Bertino E, Elmagarmid AK, Ibrahim M, Verykios VS (1999) Disclosure limitations of sensitive rules. In: Proceedings of the IEEE knowledge and data engineering workshop, pp 45\u201352"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Bayardo R, Agrawal R (2005) Data privacy through optimal k-anonymization. In: Proceedings of the 21st IEEE international conference on data engineering, pp 217\u2013228","DOI":"10.1109\/ICDE.2005.42"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or M, Goldwasser S, Wigderson A (1988) Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th ACM annual symposium on the theory of computing, pp 1\u201310","DOI":"10.1145\/62212.62213"},{"issue":"2","key":"51_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10618-005-0006-6","volume":"11","author":"E Bertino","year":"2005","unstructured":"Bertino E, Fovino IN, Provenza LP (2005) A framework for evaluating privacy preserving data mining algorithms. Data Mining Knowledge Discovery 11(2):121\u2013154","journal-title":"Data Mining Knowledge Discovery"},{"key":"51_CR9","unstructured":"Blake CL, Merz CJ (1998) UCI repository of machine learning databases. Available at http:\/\/www.ics.uci.edu\/\u223cmlearn\/MLRepository.html"},{"key":"51_CR10","unstructured":"Chang L, Moskowitz IL, (2000) An integrated framework for database inference and privacy protection. In: Proceedings of data and applications security, pp 161\u2013172"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Chang Y-C, Lu C-J (2001) Oblivious polynomial evaluation and oblivious neural learning. In: Proceedings of Asiacrypt\u201901, pp 369\u2013384","DOI":"10.1007\/3-540-45682-1_22"},{"issue":"2","key":"51_CR12","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum D (1981) Untracable electronic mail, return address and digital pseudonyms. Commun ACM 24(2):84\u201388","journal-title":"Commun ACM"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Chaum D, Cr\u00e9peau C, Damg\u00e5rd I (1988) Multiparty unconditionally secure protocols. In: Proceedings of the 20th ACM annual symposium on the theory of computing, pp 11\u201319","DOI":"10.1145\/62212.62214"},{"key":"51_CR14","unstructured":"Chaum D, Damg\u00e5rd I, van de Graaf J (1987) Multiparty computations ensuring privacy of each party\u2019s input and correctness of the result. In: Proceedings of Crypto\u201987, pp 87\u2013119"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Chawla S, Dwork C, McSherry F, Smith A, Wee H (2005) Towards privacy in public databases. In: Proceedings of the 2nd theory of cryptography conference, pp 363\u2013385","DOI":"10.1007\/978-3-540-30576-7_20"},{"key":"51_CR16","unstructured":"Clifton C, Kantarciogl\u01d4 M, Vaidya J (2004) Data mining: next generation challenges and future directions, chapter Defining privacy for data mining. AAAI\/MIT Press"},{"issue":"2","key":"51_CR17","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton C, Kantarciogl\u01d4 M, Vaidya J, Lin X, Zhiu MY (2002) Tools for privacy preserving distributed data mining. SIGKDD Explor 4(2):28\u201334","journal-title":"SIGKDD Explor"},{"issue":"3","key":"51_CR18","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273\u2013297","journal-title":"Mach Learn"},{"key":"51_CR19","doi-asserted-by":"crossref","unstructured":"Dinur I, Nissim K (2003) Revealing information while preserving privacy. In: Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART symposium on principles of databases systems, pp 202\u2013210","DOI":"10.1145\/773153.773173"},{"issue":"2","key":"51_CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/772862.772869","volume":"4","author":"A Evfimievski","year":"2002","unstructured":"Evfimievski A (2002) Randomization in privacy preserving data mining. SIGKDD Explor 4(2): 43\u201348","journal-title":"SIGKDD Explor"},{"key":"51_CR21","doi-asserted-by":"crossref","unstructured":"Evfimievski A, Gehrke JE, Srikant R (2003) Limiting privacy breaches in privacy preserving data mining. In: Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART symposium on principles of databases systems, pp 211\u2013222","DOI":"10.1145\/773153.773174"},{"key":"51_CR22","doi-asserted-by":"crossref","unstructured":"Fan W, Stolfo SJ, Zhang J (1999) The application of AdaBoost for distributed, scalable and on-line learning. In: Proceedings of the 5th ACM SIGKDD international conference on knowledge discovery and data mining, pp 362\u2013366","DOI":"10.1145\/312129.312283"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Feigenbaum J, Ishai Y, Malkin T, Nissim K, Strauss M, Wright R (2001) Secure multiparty computation of approximations. In: Proceedings of the 28th international colloquium on automata, languages and programming, pp 927\u2013938","DOI":"10.1007\/3-540-48224-5_75"},{"key":"51_CR24","doi-asserted-by":"crossref","unstructured":"Fienberg SE, McIntyre J, (2004) Data swapping: variations on a theme by Dalenius and Reiss. In: Proceedings of privacy in statistical databases, pp 14\u201329","DOI":"10.1007\/978-3-540-25955-8_2"},{"key":"51_CR25","doi-asserted-by":"crossref","unstructured":"Freedman M, Nissim K, Pinkas B (2004) Efficient private matching and set intersection. In: Proceedings of Eurocrypt\u201904, pp 1\u201319","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"51_CR26","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund Y, Schapire RE, (1997) A decision-theoretic generalization of on-line learning and an application to boosting. J Comput System Sci 55:119\u2013139","journal-title":"J Comput System Sci"},{"issue":"4","key":"51_CR27","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0167-9473(01)00065-2","volume":"38","author":"J Friedman","year":"2002","unstructured":"Friedman J (2002) Stochastic gradient boosting. Comput Stat Data Anal 38(4):367\u2013378","journal-title":"Comput Stat Data Anal"},{"key":"51_CR28","doi-asserted-by":"crossref","unstructured":"Furukawa J, Sako K (2001) An efficient scheme for proving a shuffle. In: Proceedings of Crypto 2001, pp 368\u2013387","DOI":"10.1007\/3-540-44647-8_22"},{"key":"51_CR29","doi-asserted-by":"crossref","unstructured":"Goldreich O (2004) Foundations of cryptography, volume II: basic applications. Cambridge University Press","DOI":"10.1017\/CBO9780511721656"},{"key":"51_CR30","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game \u2013 A completeness theorem for protocols with honest majority. In: Proceedings of the 19th ACM symposium on theory of computing, pp 218\u2013229"},{"key":"51_CR31","doi-asserted-by":"crossref","unstructured":"Iyengar V (2002) Transforming data to satisfy privacy constraints. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, pp 279\u2013288","DOI":"10.1145\/775047.775089"},{"key":"51_CR32","doi-asserted-by":"crossref","unstructured":"Kalyanasundaran B, Schnitger G (1987) The probabilistic communication of set intersection. In: Proceedings of the 2nd annual IEEE conference on structure in complexity theory, pages 41\u201347.","DOI":"10.1109\/PSCT.1987.10319253"},{"key":"51_CR33","doi-asserted-by":"crossref","unstructured":"Kantarciogl\u01d4 M, Clifton C, (2004a) Privacy-preserving distributed k-nn classifier. In: European conference on principles of data mining and knowledge discovery, pp 279\u2013290","DOI":"10.1007\/978-3-540-30116-5_27"},{"issue":"9","key":"51_CR34","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M Kantarciogl\u01d4","year":"2004","unstructured":"Kantarciogl\u01d4 M, Clifton C, (2004b) Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Transac on Knowledge Data Engi 16(9):1026\u20131037","journal-title":"IEEE Transac on Knowledge Data Engi"},{"key":"51_CR35","doi-asserted-by":"crossref","unstructured":"Kantarciogl\u01d4 M, Jin J, Clifton C (2004) When do data mining results violate privacy? In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, pp 599\u2013604","DOI":"10.1145\/1014052.1014126"},{"key":"51_CR36","unstructured":"Kantarciogl\u01d4 M, Vaidya J (2004) Privacy preserving naive bayes classifier for horizontally partitioned data. In: Proceedings of the workshop on privacy preserving data mining held in association with the third IEEE international conference on data mining"},{"key":"51_CR37","doi-asserted-by":"crossref","unstructured":"K\u00e9gl B (2003) Robust regression by boosting the median. In: Proceedings of the 16th conference on computational learning theory, pp 258\u2013272","DOI":"10.1007\/978-3-540-45167-9_20"},{"key":"51_CR38","doi-asserted-by":"crossref","unstructured":"Kissner L, Song D (2005) Privacy-preserving set operations. In: Proceedings of Crypto 2005, pp 241\u2013257","DOI":"10.21236\/ADA457144"},{"key":"51_CR39","unstructured":"Kolcz A, Xiaomei S, Kalita J (2002). Efficient handling of high-dimensional feature spaces by randomized classifier ensembles. In: Proceedings of SIGKDD\u201902, pp 307\u2013313"},{"key":"51_CR40","unstructured":"Kruger L, Jha S, McDaniel P (2005) Privacy preserving clustering. In: Proceedings of the 10th European symposium on research in computer security, pp 397\u2013417"},{"issue":"2","key":"51_CR41","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1013992203485","volume":"11","author":"A Lazarevic","year":"2002","unstructured":"Lazarevic A, Obradovic Z (2002) Boosting algorithms for parallel and distributed learning. Distrib Parallel Databases 11(2):203\u2013229","journal-title":"Distrib Parallel Databases"},{"key":"51_CR42","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y Lindell","year":"2002","unstructured":"Lindell Y, Pinkas B (2002) Privacy preserving data mining. J Cryptol 15:177\u2013206","journal-title":"J Cryptol"},{"key":"51_CR43","unstructured":"Paillier P (2000) Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of Asiacrypt\u201900, pp 573\u2013584"},{"key":"51_CR44","doi-asserted-by":"crossref","unstructured":"Neff A (2001) A verifiable secret shuffle and its application to e-voting. In: ACM CCS, pp 116\u0301b-125","DOI":"10.1145\/501983.502000"},{"issue":"1","key":"51_CR45","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/TIT.2005.860420","volume":"52","author":"JB Predd","year":"2006","unstructured":"Predd JB, Kulkarni SR, Poor HV (2006) Consistency in models distributed learning under communication constraints. IEEE Transac Information Theor 52(1):52\u201363","journal-title":"IEEE Transac Information Theor"},{"issue":"1","key":"51_CR46","first-page":"81","volume":"1","author":"J Quinlan","year":"1986","unstructured":"Quinlan J (1986) Induction of decision trees. Mach Learn 1(1):81\u2013106","journal-title":"Mach Learn"},{"key":"51_CR47","doi-asserted-by":"crossref","unstructured":"Rabin T, Ben-Or M (1989) Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the 21th ACM symposium on theory of computing, pp 73\u201385","DOI":"10.1145\/73007.73014"},{"issue":"3","key":"51_CR48","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"RE Schapire","year":"1999","unstructured":"Schapire RE, Singer Y, (1999) Improved boosting algorithms using confidence-rated predictions. Mach Learn 37(3):297\u2013336","journal-title":"Mach Learn"},{"issue":"11","key":"51_CR49","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Communications of the ACM 22(11):612\u2013613","journal-title":"Communications of the ACM"},{"issue":"5","key":"51_CR50","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) Achieving k-anonymity privacy protection using generalization and suppression. Int J Uncertainty, Fuzziness, Knowledge-based Syst 10(5):571\u2013588","journal-title":"Int J Uncertainty, Fuzziness, Knowledge-based Syst"},{"issue":"11","key":"51_CR51","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L Valiant","year":"1984","unstructured":"Valiant L (1984) A theory of the learnable. Communications of the ACM 27(11):1134\u20131142","journal-title":"Communications of the ACM"},{"issue":"1","key":"51_CR52","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/974121.974131","volume":"3","author":"VS Verykios","year":"2004","unstructured":"Verykios VS, Bertino E, Fovino IN, Provenza LP, Saygin Y, Theodoridis Y (2004) State-of-the-art in privacy preserving data mining. SIGMOD Record 3(1):50\u201357","journal-title":"SIGMOD Record"},{"key":"51_CR53","doi-asserted-by":"crossref","unstructured":"Yao AC (1986) How to generate and exchange secrets. In: Proceedings of the 27th IEEE symposium on foundations of computer science, pp 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"51_CR54","doi-asserted-by":"crossref","unstructured":"Yu H, Jiang X, Vaidya J (2006) Privacy-preserving SVM using nonlinear kernels on horizontally partitioned data. In: Proceedings of the 21st annual ACM symposium on applied computing, pp 603\u2013610","DOI":"10.1145\/1141277.1141415"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0051-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-006-0051-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0051-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T13:19:16Z","timestamp":1707571156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-006-0051-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,26]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2,24]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s10618-006-0051-9","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,26]]}}}