{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T12:10:04Z","timestamp":1746101404377,"version":"3.40.4"},"publisher-location":"New York, NY","reference-count":78,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461492412"},{"type":"electronic","value":"9781461492429"}],"license":[{"start":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T00:00:00Z","timestamp":1385596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T00:00:00Z","timestamp":1385596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-1-4614-9242-9_8","type":"book-chapter","created":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T09:18:53Z","timestamp":1389172733000},"page":"219-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Practical Distributed Privacy-Preserving Data Analysis at Large Scale"],"prefix":"10.1007","author":[{"given":"Yitao","family":"Duan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Canny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,28]]},"reference":[{"key":"8_CR1","volume-title":"Private similarity computation in distributed systems: from cryptography to differential privacy","author":"M. Alaggan","year":"2011","unstructured":"Alaggan, M., Gambs, S., Kermarrec, A.M.: Private similarity computation in distributed systems: from cryptography to differential privacy. In: Principles of Distributed Systems. Lecture Notes in Computer Science. Springer, Berlin\/New York (2011)"},{"key":"8_CR2","volume-title":"The Right to Privacy","author":"E. Alderman","year":"1995","unstructured":"Alderman, E., Kennedy, C.: The Right to Privacy. DIANE, Collingdale (1995)"},{"unstructured":"Beaver, D., Goldwasser, S.: Multiparty computation with faulty majority. In: CRYPTO\u201989, Santa Barbara","key":"8_CR3"},{"doi-asserted-by":"crossref","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure mpc with linear communication complexity. In: TCC 2008, New York, pp.\u00a0213\u2013230. Springer (2008)","key":"8_CR4","DOI":"10.1007\/978-3-540-78524-8_13"},{"unstructured":"Beimel, A., Nissim1, K., Omri, E.: Distributed private data analysis: simultaneously solving how and what. In: CRYPTO 2008, Santa Barbara (2008)","key":"8_CR5"},{"doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: Fairplaymp: a system for secure multi-party computation. In: CCS\u201908, Alexandria, pp.\u00a0257\u2013266 (2008)","key":"8_CR6","DOI":"10.1145\/1455770.1455804"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC\u201988, Hong Kong, Chicago, IL, USA, pp.\u00a01\u201310. ACM (1988)","key":"8_CR7","DOI":"10.1145\/62212.62213"},{"doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: the SuLQ framework. In: PODS\u201905, Baltimore, Maryland, USA, pp.\u00a0128\u2013138. ACM (2005)","key":"8_CR8","DOI":"10.1145\/1065167.1065184"},{"doi-asserted-by":"crossref","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC 08, Victoria, British Columbia, Canada (2008)","key":"8_CR9","DOI":"10.1145\/1374376.1374464"},{"doi-asserted-by":"crossref","unstructured":"Boaz\u00a0Barak, E.A.: Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In: PODS\u201907, Beijing (2007)","key":"8_CR10","DOI":"10.1145\/1265530.1265569"},{"doi-asserted-by":"crossref","unstructured":"Canny, J.: Collaborative filtering with privacy. In: IEEE Symposium on Security and Privacy, San Francisco, Oakland, Ca, USA, pp.\u00a045\u201357 (2002)","key":"8_CR11","DOI":"10.1109\/SECPRI.2002.1004361"},{"doi-asserted-by":"crossref","unstructured":"Canny, J.: Collaborative filtering with privacy via factor analysis. In: SIGIR\u201902, Tampere, Tampere, Finland, pp.\u00a0238\u2013245. ACM (2002)","key":"8_CR12","DOI":"10.1145\/564376.564419"},{"doi-asserted-by":"crossref","unstructured":"Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: CRYPTO 2006, Santa Barbara (2006)","key":"8_CR13","DOI":"10.1007\/11818175_31"},{"doi-asserted-by":"crossref","unstructured":"Chin, F., Ozsoyoglu, G.: Auditing for secure statistical databases. In: ACM 81: Proceedings of the ACM\u201981 Conference, Seattle, ACM\u2019 81 is Los Angeles, Ca, USA, pp.\u00a053\u201359 (1981)","key":"8_CR14","DOI":"10.1145\/800175.809832"},{"doi-asserted-by":"crossref","unstructured":"Chu, C.T., Kim, S.K., Lin, Y.A., Yu, Y., Bradski, G., Ng, A.Y., Olukotun, K.: Map-reduce for machine learning on multicore. In: NIPS 2006, Vancouver, B.C., Canada (2006)","key":"8_CR15","DOI":"10.7551\/mitpress\/7503.003.0040"},{"unstructured":"Cohen, W.W.: Enron email dataset. (2004) http:\/\/www-2.cs.cmu.edu\/~enron\/","key":"8_CR16"},{"doi-asserted-by":"crossref","unstructured":"Cohen\u00a0Benaloh, J.: Secret sharing homomorphisms: keeping shares of a secret secret. In: CRYPTO\u201986, Santa Barbara, pp.\u00a0251\u2013260 (1987)","key":"8_CR17","DOI":"10.1007\/3-540-47721-7_19"},{"doi-asserted-by":"crossref","unstructured":"Cormode, G.: Personal privacy vs population privacy: learning to attack anonymization. In: KDD\u201911, Chicago, pp.\u00a01253\u20131261. ACM, New York (2011)","key":"8_CR18","DOI":"10.1145\/2020408.2020598"},{"key":"8_CR19","volume-title":"Zero-knowledge proof for finite field arithmetic, or: can zero-knowledge be for free? In: CRYPTO\u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Damg\u00e5rd, I.: Zero-knowledge proof for finite field arithmetic, or: can zero-knowledge be for free? In: CRYPTO\u201998, San Diego. Springer (1998)"},{"key":"8_CR20","first-page":"429","volume":"15","author":"T. Dalenius","year":"1977","unstructured":"Dalenius, T.: Towards a methodology for statistical disclosure control. Statistik Tidskrift 15, 429\u2013444 (1977)","journal-title":"Statistik Tidskrift"},{"doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J.B., Smith, A.: Scalable multiparty computation with nearly optimal work and resilience. In: CRYPTO 2008, Santa Barbara, pp.\u00a0241\u2013261 (2008)","key":"8_CR21","DOI":"10.1007\/978-3-540-85174-5_14"},{"doi-asserted-by":"crossref","unstructured":"Das, A.S., Datar, M., Garg, A., Rajaram, S.: Google news personalization: scalable online collaborative filtering. In: WWW\u201907, Geneva, Banff, Alberta, Canada, pp.\u00a0271\u2013280. ACM (2007)","key":"8_CR22","DOI":"10.1145\/1242572.1242610"},{"unstructured":"Dhanjani, N.: Amazon\u2019s elastic compute cloud [ec2]: initial thoughts on security implications. http:\/\/www.dhanjani.com\/archives\/2008\/04\/","key":"8_CR23"},{"doi-asserted-by":"crossref","unstructured":"Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: PODS\u201903, San Diego, San Diego, California, pp.\u00a0202\u2013210 (2003)","key":"8_CR24","DOI":"10.1145\/773153.773173"},{"doi-asserted-by":"crossref","unstructured":"Du, W., Zhan, Z.: Using randomized response techniques for privacy-preserving data mining. In: KDD\u201903, Washington DC, pp.\u00a0505\u2013510. ACM, New York (2003)","key":"8_CR25","DOI":"10.1145\/956750.956810"},{"doi-asserted-by":"crossref","unstructured":"Du, W., Han, Y., Chen, S.: Privacy-preserving multivariate statistical analysis: linear regression and classification. In: SDM 04, Toronto, Lake Buena Vista, Florida, USA, pp.\u00a0222\u2013233 (2004)","key":"8_CR26","DOI":"10.1137\/1.9781611972740.21"},{"doi-asserted-by":"crossref","unstructured":"Duan, Y.: Privacy without noise. In: CIKM\u201909, Hong Kong. ACM, New York (2009)","key":"8_CR27","DOI":"10.1145\/1645953.1646160"},{"unstructured":"Duan, Y., Wang, J., Kam, M., Canny, J.: A secure online algorithm for link analysis on weighted graph. In: Proceedings of the Workshop on Link Analysis, Counterterrorism and Security, SDM 05, Newport Beach, pp.\u00a071\u201381 (2005)","key":"8_CR28"},{"unstructured":"Duan, Y., Canny, J.: Zero-knowledge test of vector equivalence and granulation of user data with privacy. In: IEEE GrC 2006, Atlanta (2006)","key":"8_CR29"},{"doi-asserted-by":"crossref","unstructured":"Duan, Y., Canny, J.: Practical private computation and zero-knowledge tools for privacy-preserving distributed data mining. In: SDM\u201908, Atlanta (2008)","key":"8_CR30","DOI":"10.1137\/1.9781611972788.24"},{"issue":"1","key":"8_CR31","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1002\/sam.10029","volume":"2","author":"Y. Duan","year":"2009","unstructured":"Duan, Y., Canny, J.: How to deal with malicious users in privacy-preserving distributed data mining. Stat. Anal. Data Min. 2(1), 18\u201333 (2009)","journal-title":"Stat. Anal. Data Min."},{"unstructured":"Duan, Y., Canny, J., Zhan, J.: P4P: Practical large-scale privacy-preserving distributed computation robust against malicious users. In: USENIX Security Symposium 2010, San Francisco, Washington, D.C, pp.\u00a0609\u2013618 (2010)","key":"8_CR32"},{"doi-asserted-by":"crossref","unstructured":"Dwork, C.: An ad omnia approach to defining and achieving private data analysis. In: PinKDD, San Jose, pp.\u00a01\u201313 (2007)","key":"8_CR33","DOI":"10.1007\/978-3-540-78478-4_1"},{"doi-asserted-by":"crossref","unstructured":"Dwork, C.: Ask a better question, get a better answer a new approach to private data analysis. In: ICDT 2007, Barcelona, Spain, pp.\u00a018\u201327. Springer (2007)","key":"8_CR34","DOI":"10.1007\/11965893_2"},{"doi-asserted-by":"crossref","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: EUROCRYPT 2006, Saint Petersburg. Springer (2006)","key":"8_CR35","DOI":"10.1007\/11761679_29"},{"doi-asserted-by":"crossref","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: TCC 2006, New York, pp.\u00a0265\u2013284. Springer (2006)","key":"8_CR36","DOI":"10.1007\/11681878_14"},{"doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Gehrke, J., Srikant, R.: Limiting privacy breaches in privacy preserving data mining. In: PODS\u201903, San Diego, pp.\u00a0211\u2013222 (2003)","key":"8_CR37","DOI":"10.1145\/773153.773174"},{"key":"8_CR38","volume-title":"Agents\u2019 privacy in distributed algorithmic mechanisms","author":"J. Feigenbaum","year":"2002","unstructured":"Feigenbaum, J., Nisan, N., Ramachandran, V., Sami, R., Shenker, S.: Agents\u2019 privacy in distributed algorithmic mechanisms. In: Workshop on Economics and Information Securit, Berkeley (2002)"},{"unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: CRYPTO 86, Santa Barbara, California, USA (1987)","key":"8_CR39"},{"doi-asserted-by":"crossref","unstructured":"Fitzi, M., Hirt, M., Maurer, U.: General adversaries in unconditional multi-party computation. In: ASIACRYPT\u201999, Singapore (1999)","key":"8_CR40","DOI":"10.1007\/978-3-540-48000-6_19"},{"doi-asserted-by":"crossref","unstructured":"Ganta, S.R., Kasiviswanathan, S.P., Smith, A.: Composition attacks and auxiliary information in data privacy. In: KDD\u201908, Las Vegas, pp.\u00a0265\u2013273. ACM, New York (2008)","key":"8_CR41","DOI":"10.1145\/1401890.1401926"},{"key":"8_CR42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Volume 2 \u2013 Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume 2 \u2013 Basic Applications. Cambridge University Press, Cambridge (2004)"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC\u201987, New York, pp.\u00a0218\u2013229 (1987)","key":"8_CR43","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"8_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7(1), 1\u201332 (1994)","journal-title":"J. Cryptol."},{"issue":"1","key":"8_CR45","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Levin, L.: Fair computation of general functions in presence of immoral majority. In: CRYPTO\u201990, Santa Barbara, pp.\u00a077\u201393. Springer (1991)","key":"8_CR46","DOI":"10.1007\/3-540-38424-3_6"},{"doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: PODC\u201997, Santa Barbara (1997)","key":"8_CR47","DOI":"10.1145\/259380.259412"},{"issue":"1","key":"8_CR48","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol. 13(1), 31\u201360 (2000)","journal-title":"J. Cryptol."},{"unstructured":"Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: ICDM\u201903, Melbourne, Florida, USA, p.\u00a099. IEEE Computer Society, Washington (2003)","key":"8_CR49"},{"doi-asserted-by":"crossref","unstructured":"Kearns, M.: Efficient noise-tolerant learning from statistical queries. In: STOC\u201993, San Diego, pp.\u00a0392\u2013401 (1993)","key":"8_CR50","DOI":"10.1145\/167088.167200"},{"doi-asserted-by":"crossref","unstructured":"Kifer, D., Machanavajjhala, A.: No free lunch in data privacy. In: SIGMOD\u201911, Athens, Greece, pp.\u00a0193\u2013204. ACM, New York (2011)","key":"8_CR51","DOI":"10.1145\/1989323.1989345"},{"doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Papadimitriou, C., Raghavan, P.: Auditing boolean attributes. In: PODS\u201900, Dallas, pp.\u00a086\u201391. ACM, New York (2000). doi:http:\/\/doi.acm.org\/10.1145\/335168.335210","key":"8_CR52","DOI":"10.1145\/335168.335210"},{"key":"8_CR53","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719628","volume-title":"ARPACK users\u2019 guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods","author":"R.B. Lehoucq","year":"1998","unstructured":"Lehoucq, R.B., Sorensen, D.C., Yang, C.: ARPACK users\u2019 guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods. SIAM, San Francisco (1998)"},{"doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: t-closeness: privacy beyond k-anonymity and l-diversity. In: Proceedings of the IEEE 23rd International Conference on Data Engineering, Istanbul, pp.\u00a0106\u2013115 (2007)","key":"8_CR54","DOI":"10.1109\/ICDE.2007.367856"},{"issue":"3","key":"8_CR55","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. J. Cryptol. 15(3), 177\u2013206 (2002)","journal-title":"J. Cryptol."},{"doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P.: Implementing two-party computation efficiently with security against malicious adversaries. In: SCN\u201908, Amalfi, Italy (2008)","key":"8_CR56","DOI":"10.1007\/978-3-540-85855-3_2"},{"doi-asserted-by":"crossref","unstructured":"Liu, W.M., Wang, L.: Privacy streamliner: a two-stage approach to improving algorithm efficiency. In: CODASPY\u201912, San Antonio, pp.\u00a0193\u2013204. ACM, New York (2012)","key":"8_CR57","DOI":"10.1145\/2133601.2133626"},{"doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.: l-diversity: privacy beyond k-anonymity. In: Proceedings of the IEEE 22rd International Conference on Data Engineering, Atlanta (2006)","key":"8_CR58","DOI":"10.1109\/ICDE.2006.1"},{"unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay\u2014a secure two-party computation system. In: SSYM\u201904: Proceedings of the 13th Conference on USENIX Security Symposium, San Diego, CA, pp.\u00a020\u201320. USENIX Association, Berkeley (2004)","key":"8_CR59"},{"issue":"9","key":"8_CR60","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/1810891.1810916","volume":"53","author":"F. McSherry","year":"2010","unstructured":"McSherry, F.: Privacy integrated queries: an extensible platform for privacy-preserving data analysis. Commun. ACM 53(9), 89\u201397 (2010)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"McSherry, F., Mironov, I.: Differentially private recommender systems: building privacy into the netflix prize contenders. In: KDD\u201909, Paris, pp.\u00a0627\u2013636 (2009)","key":"8_CR61","DOI":"10.1145\/1557019.1557090"},{"doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS\u201907 Rhode Island (2007)","key":"8_CR62","DOI":"10.1109\/FOCS.2007.66"},{"doi-asserted-by":"crossref","unstructured":"Nergiz, M.E., Atzori, M., Clifton, C.: Hiding the presence of individuals from shared databases. In: SIGMOD\u201907, Beijing, pp.\u00a0665\u2013676. ACM, New York (2007)","key":"8_CR63","DOI":"10.1145\/1247480.1247554"},{"doi-asserted-by":"crossref","unstructured":"Nissim, K., Raskhodnikova, S., Smith, A.: Smooth sensitivity and sampling in private data analysis. In: STOC\u201907, El Paso, Texas, USA, pp.\u00a075\u201384. ACM (2007)","key":"8_CR64","DOI":"10.1145\/1250790.1250803"},{"doi-asserted-by":"crossref","unstructured":"Paillier, P.: Trapdooring discrete logarithms on elliptic curves over rings. In: ASIACRYPT\u201900, Kyoto (2000)","key":"8_CR65","DOI":"10.1007\/3-540-44448-3_44"},{"unstructured":"Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: CRYPTO\u201991, Santa Barbara (1992)","key":"8_CR66"},{"doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Smart, N., Williams, S.: Secure two-party computation is practical. Cryptology ePrint Archive, Report 2009\/314 (2009)","key":"8_CR67","DOI":"10.1007\/978-3-642-10366-7_15"},{"doi-asserted-by":"crossref","unstructured":"Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information (abstract). In: Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of database systems, PODS\u201998, Seattle, p.\u00a0188. ACM, New York (1998). doi:10.1145\/275487.275508. http:\/\/doi.acm.org\/10.1145\/275487.275508","key":"8_CR68","DOI":"10.1145\/275487.275508"},{"unstructured":"Samarati, P., Sweeney, L.: Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical Report SRI-CSL-98-04, SRI International (1998)","key":"8_CR69"},{"key":"8_CR70","volume-title":"Matrix Perturbation Theory","author":"G.W. Stewart","year":"1990","unstructured":"Stewart, G.W., Sun, J.G.: Matrix Perturbation Theory. Academic, Boston New York (1990)"},{"issue":"5","key":"8_CR71","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: k-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"doi-asserted-by":"crossref","unstructured":"Trefethen, L.N., III, D.B.: Numerical Linear Algebra. SIAM, Philadelphia (1997)","key":"8_CR72","DOI":"10.1137\/1.9780898719574"},{"doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: KDD\u201903, Washington DC (2003)","key":"8_CR73","DOI":"10.1145\/775047.775142"},{"doi-asserted-by":"crossref","unstructured":"Wright, R., Yang, Z.: Privacy-preserving bayesian network structure computation on distributed heterogeneous data. In: KDD\u201904, New York, pp.\u00a0713\u2013718 (2004)","key":"8_CR74","DOI":"10.1145\/1014052.1014145"},{"doi-asserted-by":"crossref","unstructured":"Xiao, X., Tao, Y.: M-invariance: Towards privacy preserving re-publication of dynamic datasets. In: SIGMOD 2007, Beijing, pp.\u00a0689\u2013700 (2007)","key":"8_CR75","DOI":"10.1145\/1247480.1247556"},{"doi-asserted-by":"crossref","unstructured":"Yang, Z., Zhong, S., Wright, R.N.: Privacy-preserving classification of customer data without loss of accuracy. In: SDM 2005, Newport Beach (2005)","key":"8_CR76","DOI":"10.1137\/1.9781611972757.9"},{"unstructured":"Yao, A.C.C.: Protocols for secure computations. In: FOCS\u201982, Chicago, pp.\u00a0160\u2013164. IEEE (1982)","key":"8_CR77"},{"doi-asserted-by":"crossref","unstructured":"Zhang, L., Jajodia, S., Brodsky, A.: Information disclosure under realistic assumptions: privacy versus optimality. In: CCS\u201907, Alexandria, pp.\u00a0573\u2013583 (2007)","key":"8_CR78","DOI":"10.1145\/1315245.1315316"}],"container-title":["Large-Scale Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-9242-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T11:46:08Z","timestamp":1746099968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-9242-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,28]]},"ISBN":["9781461492412","9781461492429"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-9242-9_8","relation":{},"subject":[],"published":{"date-parts":[[2013,11,28]]},"assertion":[{"value":"28 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}