{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T01:59:53Z","timestamp":1781056793968,"version":"3.54.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,8,5]],"date-time":"2006-08-05T00:00:00Z","timestamp":1154736000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2006,11]]},"DOI":"10.1007\/s00778-006-0008-z","type":"journal-article","created":{"date-parts":[[2006,8,5]],"date-time":"2006-08-05T00:31:58Z","timestamp":1154737918000},"page":"316-333","source":"Crossref","is-referenced-by-count":119,"title":["A secure distributed framework for achieving k-anonymity"],"prefix":"10.1007","volume":"15","author":[{"given":"Wei","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Clifton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,8,5]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of ACM SIGMOD international conference on Management of Data. San Diego, California, 9\u201312 June 2003. http:\/\/doi.acm.org\/10.1145\/872757.872771","DOI":"10.1145\/872769.872771"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD Conference on Management of Data. pp. 439\u2013450. ACM Dallas, TX, 14\u201319 May 2000, http:\/\/doi.acm.org\/10.1145\/342009.335438","DOI":"10.1145\/335191.335438"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R.: Data privacy through optimal k-anonymization. In: Proceedings of the IEEE International Conference on Data Engineering. Tokyo, Japan, 5\u20138 2005 April","DOI":"10.1109\/ICDE.2005.42"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: Keeping shares of a secret. In: Advances in Cryptography, CRYPTO86: Proceedings, Odlyzko, A. (ed.) vol. 263. pp. 251\u2013260. Springer-Verlag, Lecture Notes in Computer Science, 1986, http:\/\/springerlink.metapress.com\/openurl.asp?genre=article&issn=0302-9743&volume=263&spage=251","DOI":"10.1007\/3-540-47721-7_19"},{"key":"8_CR5","unstructured":"Blake, C., Merz, C.: UCI repository of machine learning databases. 1998. http:\/\/www.ics.uci.edu\/~mlearn\/ MLRepository.html"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Boudot, F., Schoenmakers, B., Traore, J.: \u201cA fair and efficient solution to the socialist millionaires\u2019 problem. Discrete Appl. Math. 111 (1-2), 23\u201336 2001. http:\/\/www.win.tue.nl\/ ~berry\/papers\/dam.pdf","DOI":"10.1016\/S0166-218X(00)00342-5"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Dobkin, D., Jones, A.K., Lipton, R.J.: Secure databases: Protection against user influence. ACM Trans. Database Syst 4(1), 97\u2013106 1979. http:\/\/doi.acm.org\/10.1145\/320064.320068","DOI":"10.1145\/320064.320068"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fischlin, M.: A cost-effective pay-per-multiplication comparison method for millionaires. RSA Secu 2001 Cryptographer\u2019s Track 2020(1\u20132), 457\u2013471, 2001.http:\/\/www.mi.informatik. uni-frankfurt.de\/research\/papers\/fischlin.millionaire.2001.pdf","DOI":"10.1007\/3-540-45353-9_33"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Eurocrypt 2004. International Association for Cryptologic Research (IACR), Interlaken, Switzerland: 2\u20136 2004 May","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"8_CR10","unstructured":"Goethals, B., Laur, S., Lipmaa, H., Mielikainen, T.: On secure scalar product computation for privacy-preserving data mining. In: Park, C., Chee, S., (eds.), The 7th Annual International Conference in Information Security and Cryptology (ICISC 2004), Seoul, Korea, 2\u20133 2004 December"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: 19th ACM Symposium on the Theory of Computing, 1987, pp. 218\u2013229. http:\/\/doi.acm.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"8_CR12","unstructured":"Goldreich, O.: The Foundations of Cryptography.Cambridge University Press, 2004, vol. 2, ch. General Cryptographic Protocols. http:\/\/www.wisdom.weizmann.ac.il\/~oded\/ PSBookFrag\/prot.ps"},{"issue":"2","key":"8_CR13","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser S., Micali S. (1984) Probabilistic encryption. J. Comput. Syst. Sci. 28(2): 270\u2013299","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC\u201985), pp. 291\u2013304 Providence, Rhode Island, USA, 6\u20138 1985 May","DOI":"10.1145\/22145.22178"},{"key":"8_CR15","unstructured":"Hundepool, A., Willenborg, L.:\u00a0\u03bc- and \u03c4-argus: software for statistical disclosure control. In: Third International Seminar on Statistical Confidentiality (1996)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A.: An efficient protocol for yao\u2019s millionaires\u2019 problem. In: Hawaii International Conference on System Sciences (HICSS-36), pp. 205\u2013210. 2003 Waikoloa Village, Hawaii, 6\u20139 2003 January","DOI":"10.1109\/HICSS.2003.1174464"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Iyengar, V.S.: Transforming data to satisfy privacy constraints, In: Proceedings of the 2002 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 23\u201326 Edmonton, Alberta, Canada, 2002","DOI":"10.1145\/775047.775089"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Jiang, W., Clifton, C.: Privacy-preserving distributed k-anonymity. In: Proceedings of the 19th Annual IFIP WG 11.3 Working Conference on Database and Applications Security, Storrs, Connecticut, 7\u201310 2005 August","DOI":"10.1007\/11535706_13"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D., Ramakrishnan, R.: Incognito: Efficient full-domain k-anonymity. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, Baltimore, MD, 13\u201316 2005 June","DOI":"10.1145\/1066157.1066164"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: Proceedings of the 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2004).: ACM Press, Paris, France 14\u201316 2004 June","DOI":"10.1145\/1055558.1055591"},{"key":"8_CR21","unstructured":"Moore, R.A., Jr., Controlled data-swapping techniques for masking public use microdata sets. U.S. Bureau of the Census, Washington, DC., Statistical Research Division Report Series RR 96-04, 1996. http:\/\/www.census.gov\/srd\/papers\/pdf\/rr96-4.pdf"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: Proceedings of the 5th ACM conference on Computer and communications security. pp. 59\u201366. ACM Press, San Francisco, California, United States (1998)","DOI":"10.1145\/288090.288106"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation In: Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing. pp. 245\u2013254. ACM Press, Atlanta, Georgia, United States: (1999)","DOI":"10.1145\/301250.301312"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In:Advances in Cryptology - Eurocrypt\u201998, LNCS 1403. pp. 308\u2013318. Springer, Berlin Heidelberg Newyork(1998)","DOI":"10.1007\/BFb0054135"},{"key":"8_CR25","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Aiken Computation Laboratory, Harvard University, Tech. Rep. TR-81, 1981"},{"issue":"6","key":"8_CR26","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati P. (2001) Protecting respondent\u2019s privacy in microdata release. IEEE Trans. Knowl. Data. Eng. 13(6): 1010\u20131027","journal-title":"IEEE Trans. Knowl. Data. Eng."},{"key":"8_CR27","unstructured":"Schadow, G., Grannis, S.J., McDonald, C.J.: Privacy- preserving distributed queries for a clinical case research network. In: Clifton, C., Estivill-Castro, V.: (eds), IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, vol. 14. pp. 55\u201365. Australian Computer Society, Maebashi City, Japan: 9 2002 December, http:\/\/crpit.com\/Vol14.html"},{"key":"8_CR28","unstructured":"Sweeney, L.: Guaranteeing anonymity when sharing medical data, the datafly system. Proc. J. Am. Med. Inform. Assoc. (1997)"},{"key":"8_CR29","unstructured":"Sweeney, L.: Computational disclosure control: A primer on data privacy protection. Ph.D. dissertation, Massachusetts Institute of Technology, (2001)"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Sweeney, L.: Achieving k-anonymity privacy protection using generalization and suppression. Int J Uncertainty, Fuzziness and Knowledge-based Syst 10(5), 571\u2013588, 2002. http:\/\/privacy.cs.cmu.edu\/dataprivacy\/ projects\/kanonymity\/ kanonymity2.html","DOI":"10.1142\/S021848850200165X"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Sweeney, L.: k-anonymity: a model for protecting privacy. Int. J. Uncertainty, Fuzziness and Knowledge-based Syst. 10(5), 557\u2013570 2002. http:\/\/privacy.cs.cmu. edu\/dataprivacy\/projects\/kanonymity\/kanonymity.html","DOI":"10.1142\/S0218488502001648"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Vaidya, J.: Privacy preserving data mining over vertically partitioned data. Ph.D. dissertation, Purdue University, West Lafayette, Indiana, 2004. http:\/\/www.cs. purdue.edu\/homes\/jsvaidya\/thesis.pdf","DOI":"10.1137\/1.9781611972740.59"},{"issue":"4","key":"8_CR33","doi-asserted-by":"crossref","first-page":"593","DOI":"10.3233\/JCS-2005-13401","volume":"13","author":"J. Vaidya","year":"2005","unstructured":"Vaidya J., Clifton C. (2005) Secure set intersection cardinality with application to association rule mining. J. Comput. Sec. 13(4): 593\u2013622","journal-title":"J. Comput. Sec."},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Wright, R.N., Yang, Z.: Privacy-preserving bayesian network structure computation on distributed heterogeneous data. In: Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, WA, 22\u201325 2004 August","DOI":"10.1145\/1014052.1014145"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computation. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science. pp. 160\u2013164. IEEE, 1982","DOI":"10.1109\/SFCS.1982.38"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science. pp. 162\u2013167. IEEE, 1986","DOI":"10.1109\/SFCS.1986.25"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Zhong, S., Yang, Z., Wright, R.N.: Privacy-enhancing k-anonymization of customer data. In: Proceedings of the 24rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2005). ACM Press, Baltimore, Maryland, 13\u201316 2005 June","DOI":"10.1145\/1065167.1065185"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-006-0008-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-006-0008-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-006-0008-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T15:05:00Z","timestamp":1559142300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-006-0008-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,5]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["8"],"URL":"https:\/\/doi.org\/10.1007\/s00778-006-0008-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,5]]}}}