{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:08:01Z","timestamp":1746245281809,"version":"3.40.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,4,23]],"date-time":"2014-04-23T00:00:00Z","timestamp":1398211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s10207-014-0237-x","type":"journal-article","created":{"date-parts":[[2014,4,22]],"date-time":"2014-04-22T11:55:50Z","timestamp":1398167750000},"page":"497-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Secure and efficient anonymization of distributed confidential databases"],"prefix":"10.1007","volume":"13","author":[{"given":"Javier","family":"Herranz","sequence":"first","affiliation":[]},{"given":"Jordi","family":"Nin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,23]]},"reference":[{"issue":"2","key":"237_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s13389-013-0057-3","volume":"3","author":"JA Akinyele","year":"2013","unstructured":"Akinyele, J.A., Garman, C., Miers, I., Pagano, M.W., Rushanan, M., Green, M., Rubin, A.D.: Charm: a framework for rapidly prototyping cryptosystems. J. Cryptogr. Eng. 3(2), 111\u2013128 (2013)","journal-title":"J. Cryptogr. Eng."},{"key":"237_CR2","doi-asserted-by":"crossref","unstructured":"Beimel, A., Nissim, K., Omri, E.: Distributed private data analysis: simultaneously solving How and What. In: CRYPTO\u201908, Volume 5157 of Lecture Notes in Computer Science, pp. 451\u2013468. Springer (2008)","DOI":"10.1007\/978-3-540-85174-5_25"},{"key":"237_CR3","doi-asserted-by":"crossref","unstructured":"Brickell, J., Shmatikov, V.: Efficient anonymity preserving data collection. In: ACM SIGKDD, pp. 334\u2013343. ACM Press (2006)","DOI":"10.1145\/1150402.1150415"},{"key":"237_CR4","doi-asserted-by":"crossref","unstructured":"Bunn, P., Ostrovsky, R.: Secure two-party $$k$$ k -means clustering. In: Proceedings of ACM Conference on Computer and Communications Security, pp. 486\u2013497. ACM Press (2007)","DOI":"10.1145\/1315245.1315306"},{"issue":"11","key":"237_CR5","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.14778\/3402707.3402744","volume":"4","author":"R Chen","year":"2011","unstructured":"Chen, R., Mohammed, N., Fung, B.C.M., Desai, B.C., Xiong, L.: Publishing set-valued data via differential privacy. Proc. VLDB Endow. (PVLDB) 4(11), 1087\u20131098 (2011)","journal-title":"Proc. VLDB Endow. (PVLDB)"},{"key":"237_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0378-3758(82)90058-1","volume":"6","author":"T Dalenius","year":"1982","unstructured":"Dalenius, T., Reiss, S.: Data-swapping: a technique for disclosure control. J. Stat. Plan. Inference 6, 73\u201385 (1982)","journal-title":"J. Stat. Plan. Inference"},{"key":"237_CR7","doi-asserted-by":"crossref","unstructured":"Damgard, I., Fitzi, M., Kiltz, E., Nielsen, J., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Theory of Cryptography Conference, Volume 3876 of Lecture Notes in Computer Science, pp. 285\u2013304. Springer (2006)","DOI":"10.1007\/11681878_15"},{"key":"237_CR8","unstructured":"Defays, D., Anwar, M.: Micro-aggregation: a generic method. In: Proceedings of the 2nd International Seminar on Statistical Confidentiality, pp. 69\u201378. (1995)"},{"issue":"15","key":"237_CR9","doi-asserted-by":"crossref","first-page":"2834","DOI":"10.1016\/j.ins.2010.04.005","volume":"180","author":"J Domingo-Ferrer","year":"2010","unstructured":"Domingo-Ferrer, J., Gonz\u00e1lez-Nicol\u00e1s, U.: Hybrid microdata using microaggregation. Inf. Sci. 180(15), 2834\u20132844 (2010)","journal-title":"Inf. Sci."},{"key":"237_CR10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00778-006-0007-0","volume":"15","author":"J Domingo-Ferrer","year":"2006","unstructured":"Domingo-Ferrer, J., Mart\u00ednez-Ballest\u00e9, A., Mateo-Sanz, J., Seb\u00e9, F.: Efficient multivariate data-oriented microaggregation. Very Large Database J. 15, 355\u2013369 (2006)","journal-title":"Very Large Database J."},{"issue":"1","key":"237_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/69.979982","volume":"14","author":"J Domingo-Ferrer","year":"2002","unstructured":"Domingo-Ferrer, J., Mateo-Sanz, J.M.: Practical data-oriented microaggregation for statistical disclosure control. IEEE Trans. Knowl. Data Eng. 14(1), 189\u2013201 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"237_CR12","unstructured":"Domingo-Ferrer, J., Torra, V.: A quantitative comparison of disclosure control methods for microdata. In: Confidentiality, Disclosure, and Data Access: Theory and Practical Applications for Statistical Agencies, pp. 111\u2013133. (2001)"},{"key":"237_CR13","unstructured":"Domingo-Ferrer, J., Torra, V.: Disclosure control methods and information loss for microdata. In: Confidentiality, Disclosure, and Data Access: Theory and Practical Applications for Statistical Agencies, pp. 91\u2013110. (2001)"},{"key":"237_CR14","unstructured":"Domingo-Ferrer, J., Torra, V., Mateo-Sanz, J.M., Seb\u00e9, F.: Systematic measures of re-identification risk based on the probabilistic links of the partially synthetic data back to the original microdata. Tech. Rep. Cornell Univ. (2005)"},{"key":"237_CR15","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\u201906, Volume 4004 of Lecture Notes in Computer Science, pp. 486\u2013503. Springer (2006)","DOI":"10.1007\/11761679_29"},{"key":"237_CR16","doi-asserted-by":"crossref","unstructured":"Dwork, C.: Differential privacy. In: ICALP\u201906 (2), Volume 4052 of Lecture Notes in Computer Science, pp. 1\u201312. Springer (2006)","DOI":"10.1007\/11787006_1"},{"issue":"1","key":"237_CR17","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/1866739.1866758","volume":"54","author":"C Dwork","year":"2011","unstructured":"Dwork, C.: A firm foundation for private data analysis. Commun. ACM 54(1), 86\u201395 (2011)","journal-title":"Commun. ACM"},{"key":"237_CR18","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31, 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"237_CR19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2007","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20, 51\u201383 (2007)","journal-title":"J. Cryptol."},{"key":"237_CR20","unstructured":"Heer, G.: A bootstrap procedure to preserve statistical confidentiality in contingency tables. In: Proceedings of the 1st International Seminar on Statistical Confidentiality, pp. 261\u201371. (1993)"},{"key":"237_CR21","doi-asserted-by":"crossref","unstructured":"Herranz, J., Nin, J., Torra, V.: Distributed privacy-preserving methods for statistical disclosure control. In: Data Privacy Management and Autonomous Spontaneous Security, Volume 5939 of Lecture Notes in Computer Science, pp. 33\u201347. Springer (2010)","DOI":"10.1007\/978-3-642-11207-2_4"},{"key":"237_CR22","unstructured":"Kim, J.: A method for limiting disclosure in microdata based on random noise and transformation. In: Proceedings of the ASA Section on Survey Research, Methodology, pp. 303\u2013308. (1986)"},{"issue":"7","key":"237_CR23","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TKDE.2005.112","volume":"17","author":"M Laszlo","year":"2005","unstructured":"Laszlo, M., Mukherjee, S.: Minimum spanning tree partitioning algorithm for microaggregation. IEEE Trans. Knowl. Data Eng. 17(7), 902\u2013911 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"237_CR24","doi-asserted-by":"crossref","unstructured":"Li, N., Qardaji, W., Su, D.: On sampling, anonymization, and differential privacy: or, $$k$$ k -anonymization meets differential privacy. In: Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security (ASIACCS), pp. 32\u201333. (2012)","DOI":"10.1145\/2414456.2414474"},{"key":"237_CR25","unstructured":"Mateo-Sanz, J.M., Domingo-Ferrer, J., Seb\u00e9, F.: Probabilistic information loss measures in confidentiality protection of continuous microdata. Data Min. Knowl. Disc. 11(2), 181\u2013193 (2005)"},{"issue":"2","key":"237_CR26","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/mnsc.1050.0503","volume":"52","author":"K Muralidhar","year":"2006","unstructured":"Muralidhar, K., Sarathy, R.: Data shuffling- a new masking approach for numerical data. Manage. Sci. 52(2), 658\u2013670 (2006)","journal-title":"Manage. Sci."},{"issue":"1","key":"237_CR27","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.datak.2007.07.006","volume":"64","author":"J Nin","year":"2008","unstructured":"Nin, J., Herranz, J., Torra, V.: Rethinking rank swapping to decrease disclosure risk. Data Knowl. Eng. 64(1), 346\u2013364 (2008)","journal-title":"Data Knowl. Eng."},{"key":"237_CR28","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of Eurocrypt\u201999, Volume 1592 of Lecture Notes in Computer Science, pp. 223\u2013238. Springer (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"237_CR29","unstructured":"Samatari, P., Sweeney, L.: Protecting privacy when disclosing information: $$k$$ k -anonymity and its enforcement through generalization and suppression. Tech. Rep. SRI Int. Tech. Rep. (1998)"},{"issue":"1","key":"237_CR30","first-page":"1","volume":"4","author":"R Sarathy","year":"2011","unstructured":"Sarathy, R., Muralidhar, K.: Evaluating Laplace noise addition to satisfy differential privacy for numeric data. Trans. Data Priv. 4(1), 1\u201317 (2011)","journal-title":"Trans. Data Priv."},{"key":"237_CR31","doi-asserted-by":"crossref","unstructured":"Soria, J., Domingo-Ferrer, J., S\u00e1nchez, D., Mart\u00ednez, S.: Improving the utility of differentially private data releases via $$k$$ k -anonymity. In Proceedings of TrustCom\/ISPA\/IUCC, pp. 372\u2013379. (2013)","DOI":"10.1109\/TrustCom.2013.47"},{"issue":"5","key":"237_CR32","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: $$k$$ 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."},{"key":"237_CR33","doi-asserted-by":"crossref","unstructured":"Willenborg, L., de Waal, T.: Elements of Statistical Diclosure Control. In: Lecture Notes in Statistics. Springer (2001)","DOI":"10.1007\/978-1-4613-0121-9"},{"issue":"17","key":"237_CR34","doi-asserted-by":"crossref","first-page":"2948","DOI":"10.1016\/j.ins.2009.05.004","volume":"179","author":"S Zhong","year":"2009","unstructured":"Zhong, S., Yang, Z., Chen, T.: $$k$$ k -Anonymous data collection. Inf. Sci. 179(17), 2948\u20132963 (2009)","journal-title":"Inf. Sci."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-014-0237-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-014-0237-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-014-0237-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T14:16:03Z","timestamp":1746195363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-014-0237-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,23]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["237"],"URL":"https:\/\/doi.org\/10.1007\/s10207-014-0237-x","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2014,4,23]]}}}