{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:42:35Z","timestamp":1743140555516,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":56,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811536533"},{"type":"electronic","value":"9789811536540"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this chapter, we introduce data anonymization techniques for several types of datasets. Data anonymity of anonymized datasets is an index for estimating the (maximum) reidentification risk from anonymized datasets and is generally defined as a quantitative index based on adversary models. The adversary models are implicitly defined according to the attributes in the datasets, use cases, and anonymization techniques. We first review existing anonymization techniques and the adversary models behind the data anonymity definitions for anonymization techniques; then, we propose a common anonymity definition and its adversary model, which is applicable to several types of anonymization techniques. Furthermore, some extensions of the definition, which is optimized for specific types of datasets, are presented in the chapter.<\/jats:p>","DOI":"10.1007\/978-981-15-3654-0_4","type":"book-chapter","created":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T12:02:40Z","timestamp":1587643360000},"page":"65-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Secure Data Management Technology"],"prefix":"10.1007","author":[{"given":"Tomoaki","family":"Mimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinsaku","family":"Kiyomoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuko","family":"Miyaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,24]]},"reference":[{"key":"4_CR1","first-page":"87","volume-title":"Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems","author":"S Kiyomoto","year":"2012","unstructured":"S. Kiyomoto, K. Fukushima, Y. Miyake, Privacy preservation of user history graph, in Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems, ed. by I. Askoxylakis, H.C. P\u00f6hls, J. Posegga (Springer, Berlin, 2012), pp. 87\u201396"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"T. Mimoto, S. Kiyomoto, K. Tanaka, A. Miyaji, (p, n)-identifiability: anonymity under practical adversaries, in 2017 IEEE Trustcom\/BigDataSE\/ICESS (IEEE, 2017), pp. 996\u20131003","DOI":"10.1109\/Trustcom\/BigDataSE\/ICESS.2017.343"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"T. Mimoto, S. Kiyomoto, S. Hidano, A. Basu, A. Miyaji, The possibility of matrix decomposition as anonymization and evaluation for time-sequence data, in 2018 16th Annual Conference on Privacy, Security and Trust (PST) (IEEE, 2018), pp. 1\u20137","DOI":"10.1109\/PST.2018.8514189"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"P.\u00a0Samarati, L.\u00a0Sweeney, Generalizing data to provide anonymity when disclosing information, in Proceedings of PODS 1998 (1998), p. 188","DOI":"10.1145\/275487.275508"},{"issue":"6","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P Samarati","year":"2001","unstructured":"P. Samarati, Protecting respondents\u2019 identities in microdata release. IEEE Trans. Knowl. Data Eng. 13(6), 1010\u20131027 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"L.\u00a0Sweeney, Achieving $$k$$-anonymity privacy protection using generalization and suppression. J. Uncert. Fuzziness Knowl.-Base Syst. 10(5), 571\u2013588 (2002)","DOI":"10.1142\/S021848850200165X"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"S.\u00a0Kiyomoto, K.M. Martin, Towards a common notion of privacy leakage on public database, in 2010 International Conference on Broadband, Wireless Computing, Communication and Applications (2010), pp. 186\u2013191","DOI":"10.1109\/BWCCA.2010.69"},{"key":"4_CR8","first-page":"49","volume":"2005","author":"K LeFevre","year":"2005","unstructured":"K. LeFevre, D.J. DeWitt, R. Ramakrishnan, Incognito: efficient full-domain $$k$$-anonymity. Proceedings of SIGMOD 2005, 49\u201360 (2005)","journal-title":"Proceedings of SIGMOD"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"K.\u00a0LeFevre, D.J. DeWitt, R.\u00a0Ramakrishnan, Mondrian multidimensional k-anonymity, in Proceedings of the 22nd International Conference on Data Engineering (ICDE \u201906) (IEEE, 2006), pp. 25\u201335","DOI":"10.1109\/ICDE.2006.101"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"J.-W. Byun, A. Kamra, E. Bertino, N. Li, Efficient k-anonymization using clustering techniques, in International Conference on Database Systems for Advanced Applications (Springer, 2007), pp. 188\u2013200","DOI":"10.1007\/978-3-540-71703-4_18"},{"key":"4_CR11","unstructured":"K. Mivule, Utilizing noise addition for data privacy, an overview (2013). arXiv:1309.3958"},{"key":"4_CR12","unstructured":"J.J. Kim, A method for limiting disclosure in microdata based on random noise and transformation, in Proceedings of the Section on Survey Research Methods (American Statistical Association, 1986), pp. 303\u2013308"},{"key":"4_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-27696-0","volume-title":"Secure Data Management in Decentralized Systems","author":"T Yu","year":"2007","unstructured":"T. Yu, S. Jajodia, Secure Data Management in Decentralized Systems, vol. 33 (Springer Science & Business Media, Berlin, 2007)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-27189-2_3","volume-title":"Security Technology","author":"S Kiyomoto","year":"2011","unstructured":"S. Kiyomoto, K. Fukushima, Y. Miyake, Data anonymity in multi-party service model, in Security Technology, ed. by T.-H. Kim, H. Adeli, W.-C. Fang, J.G. Villalba, K.P. Arnett, M.K. Khan (Springer, Berlin, 2011), pp. 21\u201330"},{"issue":"1","key":"4_CR15","first-page":"5","volume":"5","author":"Y Zheng","year":"2011","unstructured":"Y. Zheng, L. Zhang, Z. Ma, X. Xie, W.-Y. Ma, Recommending friends and locations based on individual location history. ACM Trans. Web (TWEB) 5(1), 5 (2011)","journal-title":"ACM Trans. Web (TWEB)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Zheng, L. Zhang, X. Xie, W.-Y. Ma, Mining interesting locations and travel sequences from gps trajectories, in Proceedings of the 18th International Conference on World Wide Web (ACM, 2009), pp. 791\u2013800","DOI":"10.1145\/1526709.1526816"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"V.W. Zheng, Y.\u00a0Zheng, X. Xie, Q. Yang, Collaborative location and activity recommendations with gps history data, in Proceedings of the 19th International Conference on World Wide Web (ACM, 2010), pp. 1029\u20131038","DOI":"10.1145\/1772690.1772795"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"S. Chawla, Y.\u00a0Zheng, J. Hu, Inferring the root cause in road traffic anomalies, in 2012 IEEE 12th International Conference on Data Mining (ICDM) (IEEE, 2012), pp. 141\u2013150","DOI":"10.1109\/ICDM.2012.104"},{"issue":"3","key":"4_CR19","first-page":"29","volume":"6","author":"Y Zheng","year":"2015","unstructured":"Y. Zheng, Trajectory data mining: an overview. ACM Trans. Intell. Syst. Technol. (TIST) 6(3), 29 (2015)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"C.\u00a0Dwork, Differential privacy, in Proceedings of ICALP 2006. LNCS, vol. 4052 (2006), pp. 1\u201312","DOI":"10.1007\/11787006_1"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"C.\u00a0Dwork, Differential privacy: a survey of results, in Proceedings of TAMC 2008. LNCS, vol. 4978 (2008), pp. 1\u201319","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"C.\u00a0Dwork, K.\u00a0Kenthapadi, F.\u00a0McSherry, I.\u00a0Mironov, M.\u00a0Naor, Our data, ourselves: privacy via distributed noise generation, in Proceedings of Eurocrypt 2006. LNCS, vol. 4004 (2006), pp. 486\u2013503","DOI":"10.1007\/11761679_29"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"C.\u00a0Dwork, F.\u00a0McSherry, K.\u00a0Nissim, A.\u00a0Smith, Calibrating noise to sensitivity in private data analysis, in Proceedings of TCC 2006. LNCS, vol. 3876 (2006), pp. 265\u2013284","DOI":"10.1007\/11681878_14"},{"key":"4_CR24","first-page":"51","volume":"2010","author":"C Dwork","year":"2010","unstructured":"C. Dwork, G.N. Rothblum, S. Vadhan, Boosting and differential privacy. Proceedings of IEEE FOCS 2010, 51\u201360 (2010)","journal-title":"Proceedings of IEEE FOCS"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"P.\u00a0Kodeswaran, E.\u00a0Viegas, Applying differential privacy to search queries in a policy based interactive framework, in Proceedings of PAVLAD \u201909 (ACM, 2009), pp. 25\u201332","DOI":"10.1145\/1651449.1651455"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"C.\u00a0Li, M.\u00a0Hay, V.\u00a0Rastogi, G.\u00a0Miklau, A.\u00a0McGregor, Optimizing linear counting queries under differential privacy, in Proceedings of PODS \u201910 (ACM, 2010), pp. 123\u2013134","DOI":"10.1145\/1807085.1807104"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"I.\u00a0Mironov, O.\u00a0Pandey, O.\u00a0Reingold, S.\u00a0Vadhan, Computational differential privacy, in Proceedings of CRYPTO 2009, LNCS, vol. 5677 (2009), pp. 126\u2013142","DOI":"10.1007\/978-3-642-03356-8_8"},{"key":"4_CR28","first-page":"81","volume":"2010","author":"A McGregor","year":"2010","unstructured":"A. McGregor, I. Mironov, T. Pitassi, O. Reingold, K. Talwar, S. Vadhan, The limits of two-party differential privacy. Proceedings of IEEE FOCS 2010, 81\u201390 (2010)","journal-title":"Proceedings of IEEE FOCS"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"A.\u00a0Groce, J.\u00a0Katz, A.\u00a0Yerukhimovich, Limits of computational differential privacy in the client\/server setting, in Proceedings of TCC 2011, to appear. LNCS (2011)","DOI":"10.1007\/978-3-642-19571-6_25"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"M.R. Clarkson, F.B. Schneider, Quantification of integrity, in Proceedings of 23rd IEEE Computer Security Foundations Symposium (IEEE, 2010), pp. 28\u201343","DOI":"10.1109\/CSF.2010.10"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"T.-S. Hsu, C.-J. Liau, D.-W. Wang, J.K.-P. Chen, Quantifying privacy leakage through answering database queries, in Proceedings of ISC \u201902. LNCS, vol. 2433 (2002), pp. 162\u2013176","DOI":"10.1007\/3-540-45811-5_12"},{"key":"4_CR32","unstructured":"Y.C. Chiang, T.-S. Hsu, S.\u00a0Kuo, D.-W. Wang, Preserving confidentially when sharing medical data, in Proceedings of Asia Pacific Medical Information Conference (2000)"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Y.T. Chiang, Y.C. Chiang, T.-S. Hsu, C.-J. Liau, D.-W. Wang, How much privacy? - a system to safe guard personal privacy while releasing database, in Proceedings of 3rd International Conference on Rough Sets and Current Trends in Computing, LNCS, vol. 2475 (2002), pp. 226\u2013233","DOI":"10.1007\/3-540-45813-1_29"},{"key":"4_CR34","unstructured":"A.\u00a0Krause, E.\u00a0Horvitz, A utility-theoretic approach to privacy and personalization, in Proceedings of AAAI\u201908, vol.\u00a02 (2008), pp. 1181\u20131188"},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1613\/jair.3089","volume":"39","author":"A Krause","year":"2010","unstructured":"A. Krause, E. Horvitz, A utility-theoretic approach to privacy in online services. J. Artif. Intell. Res. 39, 633\u2013662 (2010)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"4_CR36","first-page":"253","volume":"23","author":"L Zayatz","year":"2007","unstructured":"L. Zayatz, Disclosure avoidance practices and research at the us census bureau: an update. J. Offic. Stat. 23(2), 253 (2007)","journal-title":"J. Offic. Stat."},{"key":"4_CR37","unstructured":"M. Freiman, J. Lucero, L. Singh, J. You, M. DePersio, L. Zayatz, The microdata analysis system at the us census bureau, in Proceedings of the Joint Statistical Meetings, American Statistical Association Section on Survey Research Methods (2011)"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"K. Chaudhuri, N. Mishra, When random sampling preserves privacy, in Annual International Cryptology Conference (Springer, 2006), pp. 198\u2013213","DOI":"10.1007\/11818175_12"},{"issue":"3\u20134","key":"4_CR39","first-page":"211","volume":"9","author":"C Dwork","year":"2014","unstructured":"C. Dwork, A. Roth et al., The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"5","key":"4_CR40","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s00778-014-0351-4","volume":"23","author":"J Soria-Comas","year":"2014","unstructured":"J. Soria-Comas, J. Domingo-Ferrer, D. S\u00e1nchez, S. Mart\u00ednez, Enhancing data utility in differential privacy via microaggregation-based k-anonymity. The VLDB J. 23(5), 771\u2013794 (2014)","journal-title":"The VLDB J."},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"L. Sweeney, k-anonymity: a model for protecting privacy. Int. J. Uncert. Fuzziness Knowl.-Based Syst. 10(5), 557\u2013570 (2002)","DOI":"10.1142\/S0218488502001648"},{"key":"4_CR42","unstructured":"A. Narayanan, V. Shmatikov, How to break anonymity of the netflix prize dataset (2006), arXiv:cs\/0610105"},{"key":"4_CR43","unstructured":"A.\u00a0Machanavajjhala, J.\u00a0Gehrke, D.\u00a0Kifer, $$t$$-closeness: privacy beyond $$k$$-anonymity and $$l$$-diversity, in Proceedings of ICDE\u201907 (2007), pp. 106\u2013115"},{"issue":"2008","key":"4_CR44","first-page":"1","volume":"4978","author":"C Dwork","year":"2008","unstructured":"C. Dwork, Differential privacy: a survey of results. Proceedings of TAMC 4978(2008), 1\u201319 (2008)","journal-title":"Proceedings of TAMC"},{"issue":"2","key":"4_CR45","first-page":"223","volume":"51","author":"Y Omori","year":"2003","unstructured":"Y. Omori, Posterior probability of population uniqueness in microdata. Proc. Inst. Stat. Math. 51(2), 223\u2013239 (2003)","journal-title":"Proc. Inst. Stat. Math."},{"issue":"2","key":"4_CR46","first-page":"407","volume":"9","author":"RJA Little","year":"1993","unstructured":"R.J.A. Little, Statistical analysis of masked data. J. Offic. Stat. 9(2), 407 (1993)","journal-title":"J. Offic. Stat."},{"issue":"1\u20132","key":"4_CR47","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"H.W. Kuhn, The hungarian method for the assignment problem. Naval Res. Logist. (NRL) 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"2","key":"4_CR48","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1233321.1233324","volume":"8","author":"J Xu","year":"2006","unstructured":"J. Xu, W. Wang, J. Pei, X. Wang, B. Shi, A.W.-C. Fu, Utility-based anonymization for privacy preservation with less information loss. SIGKDD Explor. Newsl. 8(2), 21\u201330 (2006)","journal-title":"SIGKDD Explor. Newsl."},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"J.-W. Byun, A.\u00a0Kamra, E.\u00a0Bertino, N.\u00a0Li, Efficient k-anonymity using clustering technique, in Proceedings of the International Conference on Database Systems for Advanced Applications (2007), pp. 188\u2013200","DOI":"10.1007\/978-3-540-71703-4_18"},{"key":"4_CR50","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"J. Nocedal, S. Wright, Numerical Optimization (Springer Science & Business Media, Berlin, 2006)"},{"key":"4_CR51","unstructured":"G. Dror, N. Koenigstein, Y. Koren, M. Weimer, The yahoo! music dataset and kdd-cup\u201911, in Proceedings of the 2011 International Conference on KDD Cup 2011, vol. 18 (JMLR.org, 2011), pp. 3\u201318"},{"issue":"2","key":"4_CR52","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/1345448.1345465","volume":"9","author":"RM Bell","year":"2007","unstructured":"R.M. Bell, Y. Koren, Lessons from the netflix prize challenge. SiGKDD Explor. 9(2), 75\u201379 (2007)","journal-title":"SiGKDD Explor."},{"key":"4_CR53","unstructured":"B. Recht, C. Re, S. Wright, F. Niu, Hogwild: a lock-free approach to parallelizing stochastic gradient descent, in Advances in Neural Information Processing Systems (2011), pp. 693\u2013701"},{"key":"4_CR54","doi-asserted-by":"crossref","unstructured":"R. Gemulla, E. Nijkamp, P.J. Haas, Y. Sismanis, Large-scale matrix factorization with distributed stochastic gradient descent, in Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, 2011), pp. 69\u201377","DOI":"10.1145\/2020408.2020426"},{"key":"4_CR55","doi-asserted-by":"crossref","unstructured":"Y. Zhuang, W.-S. Chin, Y.-C. Juan, C.-J. Lin, A fast parallel sgd for matrix factorization in shared memory systems, in Proceedings of the 7th ACM Conference on Recommender Systems (ACM, 2013), pp. 249\u2013256","DOI":"10.1145\/2507157.2507164"},{"key":"4_CR56","doi-asserted-by":"crossref","unstructured":"J. Oh, W.-S. Han, H. Yu, X. Jiang, Fast and robust parallel sgd matrix factorization, in Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, 2015), pp. 865\u2013874","DOI":"10.1145\/2783258.2783322"}],"container-title":["Security Infrastructure Technology for Integrated Utilization of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3654-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T12:38:15Z","timestamp":1721738295000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-15-3654-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811536533","9789811536540"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3654-0_4","relation":{},"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}