{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:44:40Z","timestamp":1775054680591,"version":"3.50.1"},"reference-count":135,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"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":["Program Comput Soft"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1134\/s0361768823040047","type":"journal-article","created":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T09:02:21Z","timestamp":1690534941000},"page":"232-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Application of Computer Simulation to the Anonymization of Personal Data: State-of-the-Art and Key Points"],"prefix":"10.1134","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3124-2147","authenticated-orcid":false,"given":"A. V.","family":"Borisov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7163-341X","authenticated-orcid":false,"given":"A. V.","family":"Bosov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7811-7645","authenticated-orcid":false,"given":"A. V.","family":"Ivanov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"3739_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C. and Yu, P.S., A general survey of privacy-preserving data mining models and algorithms, Privacy-Preserving Data Mining, Aggarwal, C.C. and Yu, P.S., Eds., Advances in Database Systems, vol. 34, Boston: Springer, 2008.","DOI":"10.1007\/978-0-387-70992-5"},{"key":"3739_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.comcom.2019.04.011","volume":"140\u2013141","author":"J. Domingo-Ferrer","year":"2019","unstructured":"Domingo-Ferrer, J., Farras, O., Ribes-Gonzalez, J., and Sanchez, D., Privacy-preserving cloud computing on sensitive data: A survey of methods, products and challenges, Comput. Commun., 2019, vols. 140\u2013141, pp.\u00a038\u201360.","journal-title":"Comput. Commun."},{"key":"3739_CR3","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1109\/ACCESS.2017.2767561","volume":"6","author":"M.A. Sahi","year":"2018","unstructured":"Sahi, M.A., et al., Privacy preservation in e-healthcare environments: State of the art and future directions, IEEE Access, 2018, vol. 6, pp. 464\u2013478.","journal-title":"IEEE Access"},{"key":"3739_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/TSE.2008.88","volume":"35","author":"S. Spiekermann","year":"2009","unstructured":"Spiekermann, S. and Cranor, L.F., Engineering privacy, IEEE Trans. Software Eng., 2009, vol. 35, no. 1, pp.\u00a067\u201382.","journal-title":"IEEE Trans. Software Eng."},{"key":"3739_CR5","doi-asserted-by":"crossref","unstructured":"Verykios, V.S., Bertino, E., Fovino, I.N., Provenza, L.P., Saygin, Y., and Theodoridis, Y., State-of-the-art in privacy preserving data mining, ACM SIGMOD Record., 2004, vol. 33, no. 1.","DOI":"10.1145\/974121.974131"},{"key":"3739_CR6","unstructured":"Guide to Basic Data Anonymization Technique. \n               Personal Data Protection Commission, Singapore, 2018."},{"key":"3739_CR7","doi-asserted-by":"crossref","unstructured":"Newton, E., Sweeney, L., and Malin, B., Preserving privacy by de-identifying facial images, IEEE Trans. Knowl. Data Eng., 2005.","DOI":"10.1109\/TKDE.2005.32"},{"key":"3739_CR8","unstructured":"Sweeney, L., Privacy-preserving bio-terrorism surveillance, AAAI Spring Symposium, AI Technologies for Homeland Security, 2005."},{"key":"3739_CR9","unstructured":"Sweeney, L., AI technologies to defeat identity theft vulnerabilities, AAAI Spring Symposium, AI Technologies for Homeland Security, 2005."},{"key":"3739_CR10","unstructured":"Sweeney, L. and Gross, R., Mining images in publicly-available cameras for homeland security, AAAI Spring Symposium, AI Technologies for Homeland Security, 2005."},{"key":"3739_CR11","doi-asserted-by":"crossref","unstructured":"Agrawal, R. and Srikant, R., Privacy-preserving data mining, Proc. of the ACM SIGMOD Conference, 2000.","DOI":"10.1145\/342009.335438"},{"key":"3739_CR12","doi-asserted-by":"crossref","unstructured":"Agrawal, D. and Aggarwal, C.C., On the design and quantification of privacy-preserving data mining algorithms, ACM PODS Conf., 2002.","DOI":"10.1145\/375551.375602"},{"key":"3739_CR13","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., and Zhu, A., Approximation algorithms for K-anonymity, J. Privacy Technol., 2005, no. 20051120001."},{"key":"3739_CR14","volume-title":"On K-anonymity and the curse of dimensionality","author":"C.C. Aggarwal","year":"2005","unstructured":"Aggarwal, C.C., On K-anonymity and the curse of dimensionality, VLDB Confeence, 2005."},{"key":"3739_CR15","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D., and Ramakrishnan, R., Incognito: Full domain K-anonymity, ACM SIGMOD Conference, 2005.","DOI":"10.1145\/1066157.1066164"},{"key":"3739_CR16","doi-asserted-by":"crossref","unstructured":"Meyerson, A. and Williams, R., On the complexity of optimal K-anonymity, ACM PODS Conference, 2004.","DOI":"10.1145\/1055558.1055591"},{"key":"3739_CR17","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., and Venkitasubramaniam, M., L-diversity: Privacy beyond K-anonymity, ICDE Conference, 2006.","DOI":"10.1109\/ICDE.2006.1"},{"key":"3739_CR18","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., and Venkatasubramanian, S., T-closeness: Privacy beyond K-anonymity and L-diversity, ICDE Conference, 2007.","DOI":"10.1109\/ICDE.2007.367856"},{"key":"3739_CR19","volume-title":"Privacy-preserving data mining on vertically partitioned databases","author":"C. Dwork","year":"2004","unstructured":"Dwork, C. and Nissim, K., Privacy-preserving data mining on vertically partitioned databases, CRYPTO, 2004."},{"key":"3739_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/11535706_11","volume-title":"Privacy-preserving decision trees over vertically partitioned data","author":"J. Vaidya","year":"2005","unstructured":"Vaidya, J. and Clifton, C., Privacy-preserving decision trees over vertically partitioned data, Lect. Notes Comp. Sci., 2005, vol. 3654."},{"key":"3739_CR21","doi-asserted-by":"crossref","unstructured":"Yu, H., Vaidya, J., and Jiang, X., Privacy-preserving SVM classification on vertically partitioned data, PAKDD Conference, 2006.","DOI":"10.1007\/11731139_74"},{"key":"3739_CR22","doi-asserted-by":"crossref","unstructured":"Verykios, V.S., Elmagarmid, A., Bertino, E., Saygin, Y., and Dasseni, E., Association rule hiding, IEEE Trans. Knowl. Data Eng., 2004, vol. 16, no. 4.","DOI":"10.1109\/TKDE.2004.1269668"},{"key":"3739_CR23","unstructured":"Moskowitz, I. and Chang, L., A decision theoretic system for information downgrading, Joint Conference on Information Sciences, 2000."},{"key":"3739_CR24","doi-asserted-by":"crossref","unstructured":"Adam, N. and Wortmann, J.C., Security-control methods for statistical databases: A comparison study, ACM Comput. Surveys, 1989, vol. 21, no. 4.","DOI":"10.1145\/76894.76895"},{"key":"3739_CR25","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/3979.4017","volume":"10","author":"C.K. Liew","year":"1985","unstructured":"Liew, C.K., Choi, U.J., and Liew, C.J., A data distortion by probability distribution, ACM TODS, 1985, vol.\u00a010, no. 3, pp. 395\u2013411.","journal-title":"ACM TODS"},{"key":"3739_CR26","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","volume":"60","author":"S.L. Warner","year":"1965","unstructured":"Warner, S.L., Randomized response: A survey technique for eliminating evasive answer bias, J. Am. Stat. Assoc., 1965, vol. 60, no. 309, pp. 63\u201369.","journal-title":"J. Am. Stat. Assoc."},{"key":"3739_CR27","volume-title":"Density Estimation for Statistics and Data Analysis","author":"B.W. Silverman","year":"1986","unstructured":"Silverman, B.W., Density Estimation for Statistics and Data Analysis, Chapman and Hall, 1986."},{"key":"3739_CR28","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., On randomization, public information and the curse of dimensionality, ICDE Conference, 2007.","DOI":"10.1109\/ICDE.2007.367859"},{"key":"3739_CR29","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10618-006-0051-9","volume":"14","author":"S. Gambs","year":"2007","unstructured":"Gambs, S., Kegl, B., and Aimeur, E., Privacy-preserving boosting, Knowl. Discovery Data Mining J., 2007, vol. 14, no. 1, pp. 131\u2013170.","journal-title":"Knowl. Discovery Data Mining J."},{"key":"3739_CR30","volume-title":"Privacy-preserving naive Bayes classifier","author":"P. Zhang","year":"2005","unstructured":"Zhang, P., Tong, Y., Tang, S., and Yang, D., Privacy-preserving naive Bayes classifier, Lect. Notes Comp. Sci., 2005, vol. 3584."},{"key":"3739_CR31","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., and Gehrke, J., Privacy-preserving mining of association rules, ACM KDD Conference, 2002.","DOI":"10.1145\/775079.775080"},{"key":"3739_CR32","doi-asserted-by":"crossref","unstructured":"Rizvi, S. and Haritsa, J., Maintaining data privacy in association rule mining, VLDB Conference, 2002.","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"3739_CR33","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R., and Thomas, D., Privacy-preserving OLAP, Proc. of the ACM SIGMOD Conference, 2005.","DOI":"10.1145\/1066157.1066187"},{"key":"3739_CR34","doi-asserted-by":"crossref","unstructured":"Polat, H. and Du, W., SVD-based collaborative filtering with privacy, ACM SAC Symp., 2005.","DOI":"10.1145\/1066677.1066860"},{"key":"3739_CR35","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10618-005-0006-6","volume":"11","author":"E. Bertino","year":"2005","unstructured":"Bertino, E., Fovino, I., and Provenza, L., A framework for evaluating privacy-preserving data mining algorithms, Data Mining Knowl. Discovery J., 2005, vol. 11, pp. 121\u2013154.","journal-title":"Data Mining Knowl. Discovery J."},{"key":"3739_CR36","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Gehrke, J., and Srikant, R., Limiting privacy breaches in privacy preserving data mining, ACM PODS Conference, 2003.","DOI":"10.1145\/773153.773174"},{"key":"3739_CR37","doi-asserted-by":"crossref","unstructured":"Huang, Z., Du, W., and Chen, B., Deriving private information from randomized data, ACM SIGMOD Conference, 2005, pp. 37\u201348.","DOI":"10.1145\/1066157.1066163"},{"key":"3739_CR38","doi-asserted-by":"crossref","unstructured":"Kargupta, H., Datta, S., Wang, Q., and Sivakumar, K., On the privacy preserving properties of random data perturbation techniques, ICDM Conference, 2003, pp.\u00a099\u2013106.","DOI":"10.1109\/ICDM.2003.1250908"},{"key":"3739_CR39","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"W. Johnson","year":"1984","unstructured":"Johnson, W. and Lindenstrauss, J., Extensions of Lipschitz mapping into Hilbert space, Contemp. Math., 1984, vol. 26, pp. 189\u2013206.","journal-title":"Contemp. Math."},{"key":"3739_CR40","unstructured":"Oliveira, S.R.M. and Zaiane, O., Privacy preserving clustering by data transformation, Proc. 18th Brazilian Symp. on Databases, 2003, pp. 304\u2013318."},{"key":"3739_CR41","unstructured":"Oliveira, S.R.M. and Zaiane, O., Data perturbation by rotation for privacy-preserving clustering, Technical Report no. TR04-17, Department of Computing Science, University of Alberta, Edmonton, AB, Canada, 2004"},{"key":"3739_CR42","unstructured":"Chen, K. and Liu, L., Privacy-preserving data classification with rotation perturbation, ICDM Conference, 2005."},{"key":"3739_CR43","doi-asserted-by":"crossref","unstructured":"Liu, K., Kargupta, H., and Ryan, J., Random projection based multiplicative data perturbation for privacy preserving distributed data mining, IEEE Trans. Knowl. Data Eng., 2006, vol. 18, no. 1.","DOI":"10.1109\/TKDE.2006.14"},{"key":"3739_CR44","volume-title":"Multiplicative noise for masking continuous data, Technical Report Statistics, no.\u00a02003-01","author":"J. Kim","year":"2003","unstructured":"Kim, J. and Winkler, W., Multiplicative noise for masking continuous data, Technical Report Statistics, no.\u00a02003-01, Statistical Research Division, US Bureau of the Census, Washington D.C., 2003."},{"key":"3739_CR45","doi-asserted-by":"crossref","unstructured":"Mukherjee, S., Chen, Z., and Gangopadhyay, S., A\u00a0privacy-preserving technique for Euclidean distance-based mining algorithms using Fourier based transforms, VLDB J., 2006.","DOI":"10.1007\/s00778-006-0010-5"},{"key":"3739_CR46","doi-asserted-by":"crossref","unstructured":"Liu, K., Giannella, C., and Kargupta, H., An attacker\u2019s view of distance preserving maps for privacy-preserving data mining, PKDD Conference, 2006.","DOI":"10.1007\/11871637_30"},{"key":"3739_CR47","volume-title":"Data swapping: variations on a theme by Dalenius and Reiss, Technical Report","author":"S. Fienberg","year":"2003","unstructured":"Fienberg, S. and McIntyre, J., Data swapping: variations on a theme by Dalenius and Reiss, Technical Report, National Institute of Statistical Sciences, 2003."},{"key":"3739_CR48","doi-asserted-by":"crossref","unstructured":"Samarati, P., Protecting respondents' identities in Microdata release, IEEE Trans. Knowl. Data Eng., vol. 13, no. 6, pp. 1010\u20131027.","DOI":"10.1109\/69.971193"},{"key":"3739_CR49","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J. and Agrawal, R., Data privacy through optimal K-anonymization, Proc. of the ICDE Conference, 2005, pp. 217\u2013228.","DOI":"10.1109\/ICDE.2005.42"},{"key":"3739_CR50","unstructured":"Fung, B., Wang, K., and Yu, P., Top-down specialization for information and privacy preservation, ICDE Conference, 2005."},{"key":"3739_CR51","unstructured":"Wang, K., Yu, P., and Chakraborty, S., Bottom-up generalization: A data mining solution to privacy protection, ICDM Conference, 2004."},{"key":"3739_CR52","doi-asserted-by":"crossref","unstructured":"Domingo-Ferrer, J. and Mateo-Sanz, J., Practical data-oriented micro-aggregation for statistical disclosure control, IEEE TKDE, 2002, vol. 14, no. 1.","DOI":"10.1109\/69.979982"},{"key":"3739_CR53","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Motwani, R., Panigrahy, R., Thomas, D., and Zhu, A., Achieving anonymity via clustering, ACM PODS Conference, 2006.","DOI":"10.1145\/1142351.1142374"},{"key":"3739_CR54","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C. and Yu, P.S., A condensation approach to privacy preserving data mining, EDBT Conference, 2004.","DOI":"10.1007\/978-3-540-24741-8_12"},{"key":"3739_CR55","volume-title":"Using simulated annealing for K-anonymity, Technical Report, no. 7","author":"W. Winkler","year":"2002","unstructured":"Winkler, W., Using simulated annealing for K-anonymity, Technical Report, no. 7, US Census Bureau, Washington D.C. 20233, 2002."},{"key":"3739_CR56","doi-asserted-by":"crossref","unstructured":"Iyengar, V.S., Transforming data to satisfy privacy constraints, KDD Conference, 2002.","DOI":"10.1145\/775088.775089"},{"key":"3739_CR57","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L., Ng, R., and Ramesh, G., To do or not to do: The dilemma of disclosing anonymized data, ACM SIGMOD Conference, 2005.","DOI":"10.1145\/1066157.1066165"},{"key":"3739_CR58","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C. and Yu, P.S., On variable constraints in privacy-preserving data mining, SIAM Conference, 2005.","DOI":"10.1137\/1.9781611972757.11"},{"key":"3739_CR59","doi-asserted-by":"crossref","unstructured":"Xiao, X. and Tao, Y., Personalized privacy preservation, ACM SIGMOD Conference, 2006.","DOI":"10.1145\/1142473.1142500"},{"key":"3739_CR60","doi-asserted-by":"crossref","unstructured":"Wang, K. and Fung, B.C.M., Anonymization for sequential releases, ACM KDD Conference, 2006.","DOI":"10.1145\/1150402.1150449"},{"key":"3739_CR61","doi-asserted-by":"crossref","unstructured":"Pei, J., Xu, J., Wang, Z., Wang, W., and Wang, K., Maintaining K-anonymity against incremental updates, Symposium on Scientific and Statistical Database Management, 2007.","DOI":"10.1109\/SSDBM.2007.16"},{"key":"3739_CR62","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C. and Yu, P.S., On privacy-preservation of text and sparse binary data with sketches, SIAM Conference on Data Mining, 2007.","DOI":"10.1137\/1.9781611972771.6"},{"key":"3739_CR63","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C. and Yu, P.S., On anonymization of string data, SIAM Conference Data Mining, 2007.","DOI":"10.1137\/1.9781611972771.38"},{"key":"3739_CR64","unstructured":"Martin, D., Kifer, D., Machanavajjhala, A., Gehrke, J., and Halpern, J., Worst-case background knowledge, ICDE Conference, 2007."},{"key":"3739_CR65","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Cryptographic techniques for privacy-preserving data mining, ACM SIGKDD Explorations, 2002, vol. 4, no. 2.","DOI":"10.1145\/772862.772865"},{"key":"3739_CR66","doi-asserted-by":"crossref","unstructured":"Even, S., Goldreich, O., and Lempel, A., A randomized protocol for signing contracts, Commun. ACM, 1985, vol. 28.","DOI":"10.1145\/3812.3818"},{"key":"3739_CR67","volume-title":"How to exchange secrets by oblivious transfer, 20233TR-81","author":"M.O. Rabin","year":"1981","unstructured":"Rabin, M.O., How to exchange secrets by oblivious transfer, 20233TR-81, Aiken Corporation Laboratory, Washington, 1981."},{"key":"3739_CR68","doi-asserted-by":"crossref","unstructured":"Naor, M. and Pinkas, B., Efficient oblivious transfer protocols, SODA Conference, 2001.","DOI":"10.1007\/3-540-44448-3_16"},{"key":"3739_CR69","doi-asserted-by":"crossref","unstructured":"Yao, A.C., How to generate and exchange secrets, FOCS Conference, 1986.","DOI":"10.1109\/SFCS.1986.25"},{"key":"3739_CR70","doi-asserted-by":"crossref","unstructured":"Chaum, D., Crepeau, C., and Damgard, I., Multiparty unconditionally secure protocols, ACM STOC Conf., 1988.","DOI":"10.1145\/62212.62214"},{"key":"3739_CR71","unstructured":"Ioannidis, I., Grama, A., and Atallah, M., A secure protocol for computing dot-products in clustered and distributed environments, Int. Conference on Parallel Processing, 2002."},{"key":"3739_CR72","volume-title":"Secure multi-party computation: A review and open problems, CERIAS Technical Report, no. 2001-51","author":"W. Du","year":"2001","unstructured":"Du, W. and Atallah, M., Secure multi-party computation: A review and open problems, CERIAS Technical Report, no. 2001-51, Purdue University, 2001."},{"key":"3739_CR73","doi-asserted-by":"crossref","unstructured":"Clifton, C., Kantarcioglou, M., Lin, X., and Zhu, M., Tools for privacy preserving distributed data mining, ACM SIGKDD Explorations, 2002, vol. 4, no. 2.","DOI":"10.1145\/772862.772867"},{"key":"3739_CR74","volume-title":"Privacy-preserving data mining","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y. and Pinkas, B., Privacy-preserving data mining, CRYPTO, 2000."},{"key":"3739_CR75","unstructured":"Kantarcioglu, M. and Vaidya, J., Privacy-preserving naive Bayes classifier for horizontally partitioned data, IEEE Workshop on Privacy-Preserving Data Mining, 2003."},{"key":"3739_CR76","doi-asserted-by":"crossref","unstructured":"Yu, H., Jiang, X., and Vaidya, J., Privacy-preserving SVM using nonlinear kernels on horizontally partitioned data, SAC Conference, 2006.","DOI":"10.1145\/1141277.1141415"},{"key":"3739_CR77","doi-asserted-by":"crossref","unstructured":"Yang, Z., Zhong, S., and Wright, R., Privacy-preserving classification of customer data without loss of accuracy, SDM Conference, 2006.","DOI":"10.1137\/1.9781611972757.9"},{"key":"3739_CR78","doi-asserted-by":"crossref","unstructured":"Kantarcioglu, M. and Clifton, C., Privacy-preserving distributed mining of association rules on horizontally partitioned data, IEEE TKDE J., 2004, vol. 16, no. 9.","DOI":"10.1109\/TKDE.2004.45"},{"key":"3739_CR79","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2006.115","volume-title":"Privacy-preserving clustering on horizontally partitioned data","author":"A. Inan","year":"2006","unstructured":"Inan, A., Saygin, Y., Savas, E., Hintoglu, A., and Levi, A., Privacy-preserving clustering on horizontally partitioned data, Data Engineering Workshops, 2006."},{"key":"3739_CR80","doi-asserted-by":"crossref","unstructured":"Jagannathan, G. and Wright, R., Privacy-preserving distributed k-means clustering over arbitrarily partitioned data, ACM KDD Conference, 2005.","DOI":"10.1145\/1081870.1081942"},{"key":"3739_CR81","doi-asserted-by":"crossref","unstructured":"Jagannathan, G., Pillaipakkamnatt, K., and Wright, R., A\u00a0new privacy-preserving distributed k-clustering algorithm, SIAM Conference on Data Mining, 2006.","DOI":"10.1137\/1.9781611972764.47"},{"key":"3739_CR82","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2005.117","volume-title":"Privacy-preserving top-N recommendations on horizontally partitioned data","author":"H. Polat","year":"2005","unstructured":"Polat, H. and Du, W., Privacy-preserving top-N recommendations on horizontally partitioned data, Web Intelligence, 2005."},{"key":"3739_CR83","doi-asserted-by":"crossref","unstructured":"Bawa, M., Bayardo, R.J., and Agrawal, R., Privacy-preserving indexing of documents on the network, VLDB Conference, 2003.","DOI":"10.1016\/B978-012722442-8\/50086-0"},{"key":"3739_CR84","doi-asserted-by":"crossref","unstructured":"Vaidya, J. and Clifton, C., Privacy-preserving association rule mining in vertically partitioned databases, ACM KDD Conference, 2002.","DOI":"10.1145\/775107.775142"},{"key":"3739_CR85","doi-asserted-by":"crossref","unstructured":"Vaidya, J. and Clifton, C., Privacy-preserving naive Bayes classifier over vertically partitioned data, SIAM Conference, 2004.","DOI":"10.1137\/1.9781611972740.59"},{"key":"3739_CR86","doi-asserted-by":"crossref","unstructured":"Vaidya, J. and Clifton, C., Privacy-preserving k-means clustering over vertically partitioned data, ACM KDD Conference, 2003.","DOI":"10.1145\/775107.775142"},{"key":"3739_CR87","doi-asserted-by":"crossref","unstructured":"Jiang, W. and Clifton, C., Privacy-preserving distributed k-anonymity, Proc. of the IFIP, 11.3 Working Conference on Data and Applications Security, 2005.","DOI":"10.1007\/11535706_13"},{"key":"3739_CR88","doi-asserted-by":"publisher","DOI":"10.1007\/11427995_14","volume-title":"Integrating private databases for data analysis","author":"K. Wang","year":"2005","unstructured":"Wang, K., Fung, B.C.M., and Dong, G., Integrating private databases for data analysis, Lect. Notes Comp. Sci., 2005, vol. 3495."},{"key":"3739_CR89","unstructured":"Zhong, S., Yang, Z., and Wright, R., Privacy-enhancing K-anonymization of customer data, Proc. of the ACM SIGMOD-SIGACT-SIGART Principles of Database Systems, Baltimore, MD, 2005."},{"key":"3739_CR90","doi-asserted-by":"crossref","unstructured":"Bettini, C., Wang, X.S., and Jajodia, S., Protecting privacy against location based personal identification, Proc. of Secure Data Management Workshop, Trondheim, Norway, 2005.","DOI":"10.1007\/11552338_13"},{"key":"3739_CR91","unstructured":"Gedik, B. and Liu, L., A customizable K-anonymity model for protecting location privacy, ICDCS Conference, 2005."},{"key":"3739_CR92","series-title":"Secure data management technology","volume-title":"Security Infrastructure Technology for Integrated Utilization of Big Data, vol.","author":"T. Mimoto","year":"2020","unstructured":"Mimoto, T., Kiyomoto, Sh., and Miyaji, A., Secure data management technology, In Security Infrastructure Technology for Integrated Utilization of Big Data, vol. Mimoto, T. and Miyaji, A., Eds., Singapore: Springer Open, 2020."},{"key":"3739_CR93","doi-asserted-by":"crossref","unstructured":"Oliveira, S.R.M., Zaiane, O., and Saygin, Y., Secure association-rule sharing, PAKDD Conference, 2004.","DOI":"10.1007\/978-3-540-24775-3_10"},{"key":"3739_CR94","doi-asserted-by":"crossref","unstructured":"Saygin, Y., Verykios, V., and Clifton, C., Using unknowns to prevent discovery of association rules, ACM SIGMOD Record, 2001, vol. 30, no. 4.","DOI":"10.1145\/604264.604271"},{"key":"3739_CR95","unstructured":"Atallah, M., Elmagarmid, A., Ibrahim, M., Bertino, E., and Verykios, V., Disclosure limitation of sensitive rules, Workshop on Knowl. and Data Engineering Exchange, 1999."},{"key":"3739_CR96","doi-asserted-by":"crossref","unstructured":"Dasseni, E., Verykios, V., Elmagarmid, A., and Bertino, E., Hiding association rules using confidence and support, 4th Information Hiding Workshop, 2001.","DOI":"10.1007\/3-540-45496-9_27"},{"key":"3739_CR97","series-title":"An integrated framework for database inference and privacy protection","volume-title":"Data and Applications Security","author":"L. Chang","year":"2000","unstructured":"Chang, L. and Moskowitz, I., An integrated framework for database inference and privacy protection, in Data and Applications Security, Kluwer, 2000."},{"key":"3739_CR98","unstructured":"Saygin, Y., Verykios, V., and Elmagarmid, A., Privacy-preserving association rule mining, 12th Int. Workshop on Research Issues in Data Engineering, 2002."},{"key":"3739_CR99","doi-asserted-by":"crossref","unstructured":"Wu, Y.-H., Chiang, C.-M., and Chen, A.L.P., Hiding sensitive association rules with limited side effects, IEEE Trans. Knowl. Data Eng., 2007, vol. 19, no. 1.","DOI":"10.1109\/TKDE.2007.250583"},{"key":"3739_CR100","doi-asserted-by":"crossref","unstructured":"Aggarwal, C., Pei, J., and Zhang, B., A framework for privacy preservation against adversarial data mining, ACM KDD Conference, 2006.","DOI":"10.1145\/1150402.1150460"},{"key":"3739_CR101","doi-asserted-by":"crossref","unstructured":"Chang, L. and Moskowitz, I., Parsimonious downgrading and decision trees applied to the inference problem, New Security Paradigms Workshop, 1998.","DOI":"10.1145\/310889.310921"},{"key":"3739_CR102","unstructured":"Natwichai, J., Li, X., and Orlowska, M., A reconstruction-based algorithm for classification rules hiding, Australasian Database Conference, 2006."},{"key":"3739_CR103","doi-asserted-by":"crossref","unstructured":"Kenthapadi, K., Mishra, N., and Nissim, K., Simulatable auditing, ACM PODS Conference, 2005.","DOI":"10.1145\/1065167.1065183"},{"key":"3739_CR104","unstructured":"Nabar, S., Marthi, B., Kenthapadi, K., Mishra, N., and Motwani, R., Towards robustness in query auditing, VLDB Conference, 2006."},{"key":"3739_CR105","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_20","volume-title":"Towards privacy in public databases","author":"S. Chawla","year":"2005","unstructured":"Chawla, S., Dwork, C., McSherry, F., Smith, A., and Wee, H., Towards privacy in public databases, TCC, 2005."},{"key":"3739_CR106","doi-asserted-by":"crossref","unstructured":"Mishra, N. and Sandler, M., Privacy vs pseudorandom sketches, ACM PODS Conference, 2006.","DOI":"10.1145\/1142351.1142373"},{"key":"3739_CR107","doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., and Nissim, K., Practical privacy: the SuLQ framework, ACM PODS Conference, 2005.","DOI":"10.1145\/1065167.1065184"},{"key":"3739_CR108","doi-asserted-by":"crossref","unstructured":"Dinur, I. and Nissim, K., Revealing information while preserving privacy, ACM PODS Conference, 2003.","DOI":"10.1145\/773153.773173"},{"key":"3739_CR109","volume-title":"Our data, ourselves: Privacy via distributed noise generation","author":"C. Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., and Naor, M., Our data, ourselves: Privacy via distributed noise generation, EUROCRYPT, 2006."},{"key":"3739_CR110","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14","volume-title":"Calibrating noise to sensitivity in private data analysis","author":"C. Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., and Smith, A., Calibrating noise to sensitivity in private data analysis, TCC, 2006."},{"key":"3739_CR111","unstructured":"Wang, K., Fung, B.C.M., and Yu, P., Template based privacy-preservation in classification problems, ICDM Conference, 2005."},{"key":"3739_CR112","doi-asserted-by":"crossref","unstructured":"Kifer, D. and Gehrke, J., Injecting utility into anonymized datasets, SIGMOD Conference, 2006, pp. 217\u2013228.","DOI":"10.1145\/1142473.1142499"},{"key":"3739_CR113","doi-asserted-by":"crossref","unstructured":"Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., and Fu, A.W.C., Utility based anonymization using local recoding, ACM KDD Conference, 2006.","DOI":"10.1145\/1150402.1150504"},{"key":"3739_CR114","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D., and Ramakrishnan, R., Workload aware anonymization, KDD Conference, 2006.","DOI":"10.1145\/1150402.1150435"},{"key":"3739_CR115","unstructured":"Koudas, N., Srivastava, D., Yu, T., and Zhang, Q., Aggregate query answering on anonymized tables, ICDE Conference, 2007."},{"key":"3739_CR116","unstructured":"Malin, B. and Sweeney, L., Re-identification of DNA through an automated linkage process, Proc. AMIA Symp., pp. 423\u2013427."},{"key":"3739_CR117","unstructured":"Malin, B., Why methods for genomic data privacy fail and what we can do to fix it, AAAS Annual Meeting, Seattle, WA, 2004."},{"key":"3739_CR118","unstructured":"ARTICLE 29 DATA PROTECTION WORKING PARTY. Opinion 05\/2014 on Anonymisation Techniques. Adopted on 10 April 2014."},{"key":"3739_CR119","unstructured":"Sweeney, L., Replacing personally identifiable information in medical records, the Scrub system, Proc. AMIA Annual Fall Symp., 1996, pp. 333\u2013337."},{"key":"3739_CR120","unstructured":"Sweeney, L., Guaranteeing anonymity while sharing data, the Datafly system, Proc. AMIA Annual Fall Symp., 1997, pp. 51\u201355."},{"key":"3739_CR121","unstructured":"Sweeney, L., Privacy technologies for homeland security, Testimony before the Privacy and Integrity Advisory Committee of the Department of Homeland Security, Boston, MA, June, 2005, p. 15."},{"key":"3739_CR122","unstructured":"Malin, B. and Sweeney, L., Determining the identifiability of DNA database entries, Proc. AMIA Symp., 2000, pp.\u00a0537\u2013541."},{"key":"3739_CR123","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1055\/s-0038-1634025","volume":"44","author":"B. Malin","year":"2005","unstructured":"Malin, B., Protecting DNA sequence anonymity with generalization lattices, Meth. Inf. Medicine, 2005, vol.\u00a044, no. 5, pp. 687\u2013692.","journal-title":"Meth. Inf. Medicine"},{"key":"3739_CR124","unstructured":"Hodson, H., Revealed: Google AI has access to huge haul of NHS patient data, New Scientist, April 29, 2016."},{"key":"3739_CR125","unstructured":"Cadwalladr, C. and Graham-Harrison, E., Revealed: 50 million Facebook profiles harvested for Cambridge Analytica in major data breach, The Guardian, March 17, 2018."},{"key":"3739_CR126","unstructured":"Harmon, A., \u201cIndian tribe wins fight to limit research of its DNA,\u201d New York Times, April 22, 2010."},{"key":"3739_CR127","volume-title":"Law, ethics & science of re-identification demonstrations, Bill of Health: Examining the Intersection of Health Law, Biotechnology and Bioethics","author":"M. Meyer","year":"2021","unstructured":"Meyer, M., Law, ethics & science of re-identification demonstrations, Bill of Health: Examining the Intersection of Health Law, Biotechnology and Bioethics, Petrie Flom Center at Harvard University, 2021."},{"key":"3739_CR128","first-page":"1700","volume":"57","author":"P. Ohm","year":"2010","unstructured":"Ohm, P., Broken promises of privacy: Responding to the surprising failure of anonymization, UCLA Law Review, 2010, vol. 57, pp. 1700\u20131777.","journal-title":"UCLA Law Review"},{"key":"3739_CR129","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1126\/science.1256297","volume":"347","author":"Y.-A. de Montjoye","year":"2015","unstructured":"de Montjoye, Y.-A., Radaelli, L., Singh, V.K., and Pentland, A., Unique in the shopping mall: On the reidentifiability of credit card metadata, Science, 2015, vol. 347, pp. 536\u2013539.","journal-title":"Science"},{"key":"3739_CR130","doi-asserted-by":"crossref","unstructured":"Golle, P., Revisiting the uniqueness of simple demographics in the U.S. population, Workshop on privacy in the electronic society, 2006, New York: Association for Computing Machinery.","DOI":"10.1145\/1179601.1179615"},{"key":"3739_CR131","doi-asserted-by":"crossref","unstructured":"Rocher, L., Hendrickx, J.M., and de Montjoye, Y.-A., Estimating the success of re-identifications in incomplete datasets using generative models, Nat. Commun., 2019, vol. 10, no. 1 (3069).","DOI":"10.1038\/s41467-019-10933-3"},{"key":"3739_CR132","unstructured":"Culnane C., Rubinstein B.I.P., and Teague V., Health data in an open world, Preprint. https:\/\/arxiv.org\/abs\/1712.05627. 2017."},{"key":"3739_CR133","unstructured":"Siddle, J., I know where you were last summer: London\u2019s public bike data is telling everyone where you\u2019ve been, 2014. vartree.blogspot.com."},{"key":"3739_CR134","doi-asserted-by":"crossref","unstructured":"Lavrenovs, A. and Podins, K., Privacy violations in Riga open data public transport system, IEEE 4th Workshop on Advances in Information, Electronic and Electrical Engineering (AIEEE), Vilnius, Lithuania, 2016, pp. 1\u20136.","DOI":"10.1109\/AIEEE.2016.7821808"},{"key":"3739_CR135","doi-asserted-by":"crossref","unstructured":"Narayanan, A. and Shmatikov, V., Robust de-anonymization of large sparse datasets, IEEE Symp. on Security and Privacy, 2008, pp. 111\u2013125.","DOI":"10.1109\/SP.2008.33"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823040047.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768823040047","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823040047.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:56:17Z","timestamp":1775012177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768823040047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,28]]},"references-count":135,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["3739"],"URL":"https:\/\/doi.org\/10.1134\/s0361768823040047","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,28]]},"assertion":[{"value":"20 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}