{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T13:28:11Z","timestamp":1773754091029,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,29]],"date-time":"2013-09-29T00:00:00Z","timestamp":1380412800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10115-013-0692-0","type":"journal-article","created":{"date-parts":[[2013,9,28]],"date-time":"2013-09-28T02:38:19Z","timestamp":1380335899000},"page":"579-597","source":"Crossref","is-referenced-by-count":20,"title":["Privacy-preserving LOF outlier detection"],"prefix":"10.1007","volume":"42","author":[{"given":"Lu","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liusheng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,29]]},"reference":[{"key":"692_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD international conference on Management of data (SIGMOD\u201900), pp 439\u2013450","DOI":"10.1145\/342009.335438"},{"key":"692_CR2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10115-009-0233-z","volume":"21","author":"A Amirbekyan","year":"2009","unstructured":"Amirbekyan A, Estivill-Castro V (2009) Practical protocol for Yao\u2019s millionaires problem enables secure multi-party computation of metrics and efficient privacy-preserving k-nn for large data sets. Knowl Inf Syst 21:327\u2013363","journal-title":"Knowl Inf Syst"},{"key":"692_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D Beaver","year":"1991","unstructured":"Beaver D (1991) Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. J Cryptol 4:75\u2013122","journal-title":"J Cryptol"},{"key":"692_CR4","doi-asserted-by":"crossref","unstructured":"Bellare M, Hoang VT, Rogaway P (2012) Foundations of garbled circuits. In: Proceedings of the 2012 ACM conference on computer and communications, security (CCS\u201912), pp 784\u2013796","DOI":"10.1145\/2382196.2382279"},{"key":"692_CR5","doi-asserted-by":"crossref","unstructured":"Ben-David A, Nisan N, Pinkas B (2008) Fariplaymp: a system for secure multi-party computation. In: Proceedings of the 15th ACM conference on Computer and communications, security (CCS\u201908), pp 257\u2013266","DOI":"10.1145\/1455770.1455804"},{"key":"692_CR6","doi-asserted-by":"crossref","unstructured":"Bogdanov D, Laur S, Willemson J (2008) Sharemind: a framework for fast privacy-preserving computations. In: Proceedings of 13th European symposium on research in computer, security (ESORICS\u201908), pp 192\u2013206","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"692_CR7","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10207-012-0177-2","volume":"11","author":"D Bogdanov","year":"2012","unstructured":"Bogdanov D, Niitsoo M, Toft T, Willemson J (2012) High-performance secure multi-party computation for data mining applications. Int J Inf Secur 11:403\u2013418","journal-title":"Int J Inf Secur"},{"key":"692_CR8","doi-asserted-by":"crossref","unstructured":"Breunig M, Kriegel H, Ng R et al (2000) LOF: identifying density-based local outliers. In: Proceedings of the 2000 ACM SIGMOD international conference on Management of data (SIGMOD\u201900), pp 93\u2013104","DOI":"10.1145\/342009.335388"},{"key":"692_CR9","doi-asserted-by":"crossref","unstructured":"Canetti R (2001) Universally composable security: A new paradigm for cryptographic protocols. In: Proceedings of the 42nd IEEE symposium on foundations of Computer Science (FOCS\u201901), pp 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"692_CR10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton C, Kantarcioglu M, Vaidya J et al (2002) Tools for privacy preserving distributed data mining. ACM SIGKDD Explor Newsl 4:28\u201334","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"692_CR11","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT press, Cambridge"},{"key":"692_CR12","unstructured":"Directive E (1995) Directive 95\/46\/EC of the european parliament and of the council of 24 october 1995 on the protection of individuals with regard to the processing of personal data and on the free movement of such data. Official Journal of the European Communities of 23 November 1995, p 31"},{"key":"692_CR13","unstructured":"Du W, Atallah M (2001) Privacy-preserving cooperative statistical analysis. In: Proceedings of the 17th annual computer security applications conference (ACSAC\u201901), pp 102\u2013110"},{"key":"692_CR14","unstructured":"Goethals B, Laur S, Lipmaa H et al (2004) On private scalar product computation for privacy-preserving data mining. In: Proceedings of the 7th international conference on Information Security and Cryptology (ICISC\u201904), pp 104\u2013120"},{"key":"692_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of cryptography: vol 2, Basic Applications","author":"O Goldrich","year":"2004","unstructured":"Goldrich O (2004) Foundations of cryptography: vol 2, Basic Applications. Cambridge university press, Cambridge"},{"key":"692_CR16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/293411.293443","volume":"42","author":"D Goldschlag","year":"1999","unstructured":"Goldschlag D, Reed M, Syverson P (1999) Onion routing. Commun ACM 42:39\u201341","journal-title":"Commun ACM"},{"key":"692_CR17","doi-asserted-by":"crossref","unstructured":"Henecka W, Sadeghi A, Schneider T et al (2010) Tasty: tool for automating secure two-party computations. In: Proceedings of the 17th ACM conference on Computer and communications, security (CCS\u201910), pp 451\u2013462","DOI":"10.1145\/1866307.1866358"},{"key":"692_CR18","doi-asserted-by":"crossref","unstructured":"Huang Y, Evans D, Katz J et al (2011) Faster secure two-party computation using garbled circuits. In: 20th USENIX Security Symposium","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"692_CR19","doi-asserted-by":"crossref","unstructured":"Jagannathan G, Wright R (2005) Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proceedings of the 11th ACM SIGKDD international conference on knowledge discovery in data mining (KDD\u201905), pp 593\u2013599","DOI":"10.1145\/1081870.1081942"},{"key":"692_CR20","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M Kantarcioglu","year":"2004","unstructured":"Kantarcioglu M, Clifton C (2004) Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans Knowl Data Eng 16:1026\u20131037","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"692_CR21","unstructured":"Knorr E, Ng R (1998) Algorithms for mining distance-based outliers in large datasets. In: Proceedings of the 24th international conference on very large data, bases (VLDB\u201998), pp 392\u2013403"},{"key":"692_CR22","doi-asserted-by":"crossref","unstructured":"Kolesnikov V, Sadeghi A, Schneider T (2009) Improved garbled circuit building blocks and applications to auctions and computing minima. In: Proceedings of the 8th international conference on cryptology and, network security (CANS\u201909), pp 1\u201320","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"692_CR23","unstructured":"Kreuter B, Shelat A, Shen C (2012) Billion-gate secure computation with malicious adversaries. In: Proceedings of the 21st USENIX conference on security symposium"},{"key":"692_CR24","doi-asserted-by":"crossref","unstructured":"Laur S, Willemson J, Zhang B (2011) Round-efficient oblivious database manipulation. In: Proceedings of the 14th international conference on information, security (ISC\u201911), pp 262\u2013277","DOI":"10.1007\/978-3-642-24861-0_18"},{"key":"692_CR25","doi-asserted-by":"crossref","unstructured":"Lindell Y, Pinkas B (2000) Privacy preserving data mining. In: Proceedings of the 20th annual international cryptology conference (CRYPTO\u201900), pp 36\u201354","DOI":"10.1007\/3-540-44598-6_3"},{"key":"692_CR26","unstructured":"Lindell Y, Pinkas B (2004) A proof of Yao\u2019s protocol for secure two-party computation. In: Electronic Colloquium on Computational Complexity\u2014ECCC, No. 063"},{"key":"692_CR27","doi-asserted-by":"crossref","unstructured":"Lindell Y, Pinkas B, Smart N (2008) Implementing two-party computation efficiently with security against malicious adversaries. In: Proceedings of the 6th international conference on Security and Cryptography for Networks (SCN\u201908), pp 2\u201320","DOI":"10.1007\/978-3-540-85855-3_2"},{"key":"692_CR28","unstructured":"Malkhi D, Nisan N, Pinkas B (2004) Fairplay-secure two-party computation systems. In: Proceedings of the 14th USENIX conference on Security symposium, pp 287\u2013302"},{"key":"692_CR29","doi-asserted-by":"crossref","unstructured":"McLachlan J, Tran A, Hopper N et al (2009) Scalable onion routing with torsk. In: Proceedings of the 16th ACM conference on Computer and communications security (CCS\u201909), pp 590\u2013599","DOI":"10.1145\/1653662.1653733"},{"key":"692_CR30","doi-asserted-by":"crossref","unstructured":"Merugu S, Ghosh J (2003) Privacy-preserving distributed clustering using generative models. In: Proceedings of the 3rd IEEE international conference on data mining (ICDM\u201903), pp 211\u2013218","DOI":"10.1109\/ICDM.2003.1250922"},{"key":"692_CR31","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of the 17th international conference on theory and application of cryptographic, techniques (EUROCRYPT\u201999), pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"692_CR32","doi-asserted-by":"crossref","unstructured":"Pinkas B, Schneider T, Smart N (2009) Secure two-party computation is practical. In; Proceedings of the 15th International Conference on the theory and application of cryptology and information, Security (ASIACRYPT\u201909), pp 250\u2013267","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"692_CR33","doi-asserted-by":"crossref","unstructured":"Qi Y, Atallah M (2008) Efficient privacy-preserving k-nearest neighbor search. In: Proceedings of the 28th International Conference on Distributed Computing Systems (ICDCS\u201908), pp 311\u2013319","DOI":"10.1109\/ICDCS.2008.79"},{"key":"692_CR34","doi-asserted-by":"crossref","unstructured":"Ramaswame S, Rastogi R, Shim K (2000) Efficient algorithms for mining outliers from large data sets. In: Proceedings of the 2000 ACM SIGMOD international conference on Management of data (SIGMOD\u201900), pp 427\u2013438","DOI":"10.1145\/342009.335437"},{"key":"692_CR35","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C (2002) Privacy preserving association rule mining in vertically partitioned data. In: Proceedings of the 8th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD\u201902), pp 639\u2013644","DOI":"10.1145\/775047.775142"},{"key":"692_CR36","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C (2003) Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the 9th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD\u201903), pp 206\u2013215","DOI":"10.1145\/956750.956776"},{"key":"692_CR37","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C (2004) Privacy preserving naive bayes classifier for vertically partitioned data. In: Proceedings of the 2004 SIAM international conference on data mining (SDM\u201904), pp 522\u2013526","DOI":"10.1137\/1.9781611972740.59"},{"key":"692_CR38","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C (2004) Privacy-preserving outlier detection. In: Proceedings of the 4th IEEE international conference on data mining (ICDM\u201904), pp 233\u2013240","DOI":"10.1109\/ICDM.2004.10081"},{"key":"692_CR39","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1109\/TKDE.2008.167","volume":"21","author":"J Vaidya","year":"2009","unstructured":"Vaidya J, Clifton C (2009) Privacy-preserving kth element score over vertically partitioned data. IEEE Trans Knowl Data Eng 21:253\u2013258","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"692_CR40","doi-asserted-by":"crossref","unstructured":"Wikstrom D (2004) A universally composable mix-net. In: Proceedings of the 1st theory of cryptography conference (TCC\u201904), pp 317\u2013335","DOI":"10.1007\/978-3-540-24638-1_18"},{"key":"692_CR41","doi-asserted-by":"crossref","unstructured":"Yao A (1986) How to generate and exchange secrets. In: Proceedings of the 27th annual symposium on foundations of computer science (FOCS\u201986), pp 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"692_CR42","doi-asserted-by":"crossref","unstructured":"Zhang N, Wang S, Zhao W (2005) A new scheme on privacy-preserving data classification. Proceedings of the 11th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD\u201905), pp 374\u2013383","DOI":"10.1145\/1081870.1081913"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0692-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0692-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0692-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T15:03:21Z","timestamp":1564153401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0692-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,29]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["692"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0692-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,29]]}}}