{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:32:58Z","timestamp":1648747978945},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015dap0030","type":"journal-article","created":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T18:19:30Z","timestamp":1459448370000},"page":"1000-1009","source":"Crossref","is-referenced-by-count":0,"title":["A Scheme for Fast &lt;i&gt;k&lt;\/i&gt;-Concealment Anonymization"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Ryosuke","family":"KOYANAGI","sequence":"first","affiliation":[{"name":"Department of Computer Science, Graduate School of Systems and Information Enginnering, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"FURUKAWA","sequence":"additional","affiliation":[{"name":"Cloud System Research Laboratories, NEC Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsubasa","family":"TAKAHASHI","sequence":"additional","affiliation":[{"name":"Cloud System Research Laboratories, NEC Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takuya","family":"MORI","sequence":"additional","affiliation":[{"name":"Cloud System Research Laboratories, NEC Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyuki","family":"AMAGASA","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Information and Systems, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"KITAGAWA","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Information and Systems, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] B.C.M. Fung, K. Wang, R. Chen, and P.S. Yu, \u201cPrivacy-preserving data publishing: A survey of recent developments,\u201d ACM Comput. Surv., vol.42, no.4, pp.14:1-14:53, June 2010.","DOI":"10.1145\/1749603.1749605"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] L. Sweeney, \u201cK-anonymity: A model for protecting privacy,\u201d Int. J. Uncertain. Fuzziness Knowl.-Based Syst., vol.10, no.5, pp.557-570, Oct. 2002.","DOI":"10.1142\/S0218488502001648"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, \u201cL-diversity: Privacy beyond <i>k<\/i>-anonymity,\u201d ACM Trans. Knowl. Discov. Data, vol.1, no.1, March 2007.","DOI":"10.1145\/1217299.1217302"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] N. Li, T. Li, and S. Venkatasubramanian, \u201ct-closeness: Privacy beyond k-anonymity and l-diversity,\u201d ICDE, pp.106-115, 2007.","DOI":"10.1109\/ICDE.2007.367856"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] K. Stokes and V. Torra, \u201cN-confusion: A generalization of k-anonymity,\u201d Proceedings of the 2012 Joint EDBT\/ICDT Workshops, EDBT-ICDT &apos;12, New York, NY, USA, pp.211-215, ACM, 2012.","DOI":"10.1145\/2320765.2320824"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] A. Gkoulalas-Divanis, P. Kalnis, and V.S. Verykios, \u201cProviding k-anonymity in location based services,\u201d SIGKDD Explor. Newsl., vol.12, no.1, pp.3-10, Nov. 2010.","DOI":"10.1145\/1882471.1882473"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] V.K. Sihag, \u201cA clustering approach for structural k-anonymity in social networks using genetic algorithm,\u201d Proceedings of the CUBE International Information Technology Conference, CUBE &apos;12, New York, NY, USA, pp.701-706, ACM, 2012.","DOI":"10.1145\/2381716.2381850"},{"key":"8","unstructured":"[8] T. Tassa, A. Mazza, and A. Gionis, \u201ck-concealment: An alternative model of k-type anonymity,\u201d Transactions on Data Privacy, vol.5, no.1, pp.189-222, 2012."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] K. LeFevre, D.J. DeWitt, and R. Ramakrishnan, \u201cMondrian multidimensional k-anonymity,\u201d Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, 3-8 April 2006, Atlanta, GA, USA, p.25, 2006.","DOI":"10.1109\/ICDE.2006.101"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J.L. Bentley, \u201cMultidimensional binary search trees in database applications,\u201d IEEE Trans. Softw. Eng., vol.5, no.4, pp.333-340, July 1979.","DOI":"10.1109\/TSE.1979.234200"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] V.S. Iyengar, \u201cTransforming data to satisfy privacy constraints,\u201d Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD &apos;02, New York, NY, USA, pp.279-288, ACM, 2002.","DOI":"10.1145\/775088.775089"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] M. Nergiz and C. Clifton, \u201cThoughts on k-anonymization,\u201d Data Engineering Workshops, 2006. Proceedings. 22nd International Conference on, p.96, 2006.","DOI":"10.1109\/ICDEW.2006.147"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] R. Tarjan, \u201cDepth first search and linear graph algorithms,\u201d SIAM Journal on Computing, vol.1, no.2, pp.146-160, 1972.","DOI":"10.1137\/0201010"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] J. Cheriyan and K. Mehlhorn, \u201cAlgorithms for dense graphs and networks on the random access computer,\u201d Algorithmica, vol.15, no.6, pp.521-549, 1996.","DOI":"10.1007\/BF01940880"},{"key":"15","unstructured":"[15] D.N.A. Asuncion, \u201cUCI machine learning repository,\u201d 2007."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/4\/E99.D_2015DAP0030\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T00:44:51Z","timestamp":1567730691000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/4\/E99.D_2015DAP0030\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015dap0030","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}