{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T10:59:14Z","timestamp":1777805954152,"version":"3.51.4"},"reference-count":31,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2015,3,15]],"date-time":"2015-03-15T00:00:00Z","timestamp":1426377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Security"],"published-print":{"date-parts":[[2015,3,15]]},"abstract":"<jats:p>Data fragmentation has been proposed as a solution for protecting the confidentiality of sensitive associations when releasing data for publishing or external storage. To enrich the utility of data fragments, a recent approach has put forward the idea of complementing a pair of fragments with some (non-precise, hence loose) information on the association between them. Starting from the observation that in presence of multiple fragments the publication of several independent associations between pairs of fragments can cause improper leakage of sensitive information, in this paper we extend loose associations to operate over an arbitrary number of fragments.<\/jats:p>\n                  <jats:p>We first illustrate how the publication of multiple loose associations between different pairs of fragments can potentially expose sensitive associations, and describe an approach for defining loose associations among an arbitrary set of fragments. We investigate how tuples in fragments can be grouped for producing loose associations so to increase the utility of queries executed over fragments. We then provide a heuristics for performing such a grouping and producing loose associations satisfying a given level of protection for sensitive associations, while achieving utility for queries over different fragments. We also illustrate the result of an extensive experimental effort over both synthetic and real datasets, which shows the efficiency and the enhanced utility provided by our proposal.<\/jats:p>","DOI":"10.3233\/jcs-140513","type":"journal-article","created":{"date-parts":[[2016,5,18]],"date-time":"2016-05-18T03:46:57Z","timestamp":1463543217000},"page":"59-88","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":13,"title":["Loose associations to increase utility in data publishing"],"prefix":"10.1177","volume":"23","author":[{"given":"Sabrina","family":"De Capitani di Vimercati","sequence":"first","affiliation":[{"name":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Milano, Crema, Italy. E-mails:\u00a0,\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sara","family":"Foresti","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Milano, Crema, Italy. E-mails:\u00a0,\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushil","family":"Jajodia","sequence":"additional","affiliation":[{"name":"Center for Secure Information Systems, George Mason University, Fairfax, VA, USA. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Livraga","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Milano, Crema, Italy. E-mails:\u00a0,\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Paraboschi","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria, Universit\u00e0 degli Studi di Bergamo, Dalmine, Italy. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierangela","family":"Samarati","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Milano, Crema, Italy. E-mails:\u00a0,\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2015,3,15]]},"reference":[{"key":"ref001","unstructured":"G.\u00a0Aggarwalet al., Two can keep a secret: a distributed architecture for secure database services, in: Proc. CIDR 2005, Asilomar, CA, USA, 2005."},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2012-0450"},{"key":"ref003","doi-asserted-by":"crossref","unstructured":"J.\u00a0Biskup and M.\u00a0Preu\u00df, Database fragmentation with encryption: under which semantic constraints and a priori knowledge can two keep a secret? in: Proc. DBSec 2013, Newark, NJ, USA, 2013.","DOI":"10.1007\/978-3-642-39256-6_2"},{"key":"ref004","doi-asserted-by":"crossref","unstructured":"J.\u00a0Biskup, M.\u00a0Preu\u00df and L.\u00a0Wiese, On the inference-proofness of database fragmentation satisfying confidentiality constraints, in: Proc. ISC 2011, Xi\u2019an, China, 2011.","DOI":"10.1007\/978-3-642-24861-0_17"},{"key":"ref005","doi-asserted-by":"publisher","DOI":"10.1145\/1053283.1053289"},{"key":"ref006","doi-asserted-by":"crossref","unstructured":"C.C.\u00a0Chang, B.\u00a0Thompson, H.W.\u00a0Wang and D.\u00a0Yao, Towards publishing recommendation data with predictive anonymization, in: Proc. ASIACCS 2010, Beijing, China, April2010.","DOI":"10.1145\/1755688.1755693"},{"key":"ref007","doi-asserted-by":"crossref","unstructured":"V.\u00a0Ciriani, S.\u00a0De Capitani di Vimercati, S.\u00a0Foresti, S.\u00a0Jajodia, S.\u00a0Paraboschi and P.\u00a0Samarati, Fragmentation and encryption to enforce privacy in data storage, in: Proc. ESORICS 2007, Dresden, Germany, September2007.","DOI":"10.1007\/978-3-540-74835-9_12"},{"key":"ref008","doi-asserted-by":"publisher","DOI":"10.1145\/1805974.1805978"},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2011-0422"},{"key":"ref010","doi-asserted-by":"crossref","unstructured":"V.\u00a0Ciriani, S.\u00a0De Capitani di Vimercati, S.\u00a0Foresti and P.\u00a0Samarati,\n                      k\n                      -anonymous data mining: a survey, in: Privacy-Preserving Data Mining: Models and Algorithms, C.C.\u00a0Aggarwal and P.S.\u00a0Yu, eds, Springer-Verlag, 2008.","DOI":"10.1007\/978-0-387-70992-5_5"},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0167-9"},{"key":"ref012","doi-asserted-by":"crossref","unstructured":"S.\u00a0De Capitani di Vimercati, S.\u00a0Foresti, S.\u00a0Jajodia, G.\u00a0Livraga, S.\u00a0Paraboschi and P.\u00a0Samarati, Extending loose associations to multiple fragments, in: Proc. DBSec 2013, Newark, NJ, USA, July2013.","DOI":"10.1007\/978-3-642-39256-6_1"},{"key":"ref013","doi-asserted-by":"crossref","unstructured":"S.\u00a0De Capitani di Vimercati, S.\u00a0Foresti, S.\u00a0Jajodia, G.\u00a0Livraga, S.\u00a0Paraboschi and P.\u00a0Samarati, Fragmentation in presence of data dependencies, in: IEEE TDSC, 2014, Preprint.","DOI":"10.1109\/TDSC.2013.2295798"},{"issue":"1","key":"ref014","first-page":"1370","volume":"3","author":"De Capitani di Vimercati S.","year":"2010","journal-title":"PVLDB"},{"key":"ref015","doi-asserted-by":"crossref","unstructured":"S.\u00a0De Capitani di Vimercati, S.\u00a0Foresti, G.\u00a0Livraga and P.\u00a0Samarati, Protecting privacy in data release, in: Foundations of Security Analysis and Design VI, A.\u00a0Aldini and R.\u00a0Gorrieri, eds, Springer, 2011.","DOI":"10.1007\/978-3-642-23082-0_1"},{"key":"ref016","doi-asserted-by":"crossref","unstructured":"C.\u00a0Dwork, Differential privacy, in: Proc. ICALP 2006, Venice, Italy, July2006.","DOI":"10.1007\/11787006_1"},{"key":"ref017","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry and S.\u00a0Halevi, Implementing Gentry\u2019s fully-homomorphic encryption scheme, in: Proc. EUROCRYPT 2011, Tallinn, Estonia, May2011.","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"ref018","doi-asserted-by":"crossref","unstructured":"R.\u00a0Jhawar, V.\u00a0Piuri and P.\u00a0Samarati, Supporting security requirements for resource management in cloud computing, in: Proc. CSE 2012, Paphos, Cyprus, December2012.","DOI":"10.1109\/ICCSE.2012.32"},{"key":"ref019","doi-asserted-by":"crossref","unstructured":"D.\u00a0Kifer and J.\u00a0Gehrke, Injecting utility into anonymized datasets, in: Proc. SIGMOD 2006, Chicago, IL, USA, June2006.","DOI":"10.1145\/1142473.1142499"},{"key":"ref020","doi-asserted-by":"crossref","unstructured":"N.\u00a0Li, T.\u00a0Li and S.\u00a0Venkatasubramanian,\n                      t\n                      -closeness: privacy beyond\n                      k\n                      -anonymity and \u2113-diversity, in: Proc. ICDE 2007, Istanbul, Turkey, April2007.","DOI":"10.1109\/ICDE.2007.367856"},{"key":"ref021","first-page":"1","volume":"3","author":"Machanavajjhala A.","year":"2007","journal-title":"ACM TKDD"},{"key":"ref022","unstructured":"Minnesota Population Center, IPMUS-USA (Integrated Public Use Microdata Series), http:\/\/www.ipums.org."},{"key":"ref023","doi-asserted-by":"crossref","unstructured":"T.\u00a0Raeder, M.\u00a0Blanton, N.V.\u00a0Chawla and K.\u00a0Frikken, Privacy-preserving network aggregation, in: Proc. PAKDD 2010, Hyderabad, India, June2010.","DOI":"10.1007\/978-3-642-13657-3_23"},{"issue":"6","key":"ref024","first-page":"1010","volume":"13","author":"Samarati P.","year":"2001","journal-title":"IEEE TKDE"},{"key":"ref025","doi-asserted-by":"crossref","unstructured":"P.\u00a0Samarati, Data security and privacy in the cloud, in: Proc. ISPEC 2014, Fuzhou, China, May2014.","DOI":"10.1007\/978-3-319-06320-1_4"},{"key":"ref026","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Tao, J.\u00a0Pei, J.\u00a0Li, X.\u00a0Xiao, K.\u00a0Yi and Z.\u00a0Xing, Correlation hiding by independence masking, in: Proc. ICDE 2010, Long Beach, CA, USA, March2010.","DOI":"10.1109\/ICDE.2010.5447849"},{"key":"ref027","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336668"},{"key":"ref028","unstructured":"Ubuntu: Intel Q6600 one core \u2013 computer language benchmarks game, http:\/\/benchmarksgame.alioth.debian.org\/u32\/performance.php?test=nbody."},{"key":"ref029","doi-asserted-by":"crossref","unstructured":"J.\u00a0Vaidya, A survey of privacy-preserving methods across vertically partitioned data, in: Privacy-Preserving Data Mining: Models and Algorithms, C.C.\u00a0Aggarwal and P.S.\u00a0Yu, eds, Springer-Verlag, 2008.","DOI":"10.1007\/978-0-387-70992-5_14"},{"key":"ref030","doi-asserted-by":"crossref","unstructured":"K.\u00a0Wang and B.C.M.\u00a0Fung, Anonymizing sequential releases, in: Proc. KDD 2006, Philadelphia, PA, USA, August2006.","DOI":"10.1145\/1150402.1150449"},{"key":"ref031","unstructured":"X.\u00a0Xiao and Y.\u00a0Tao, Anatomy: simple and effective privacy preservation, in: Proc. VLDB 2006, Seoul, Korea, September2006."}],"container-title":["Journal of Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-140513","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JCS-140513","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-140513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:44:50Z","timestamp":1777495490000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCS-140513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,15]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3,15]]}},"alternative-id":["10.3233\/JCS-140513"],"URL":"https:\/\/doi.org\/10.3233\/jcs-140513","relation":{},"ISSN":["0926-227X","1875-8924"],"issn-type":[{"value":"0926-227X","type":"print"},{"value":"1875-8924","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,15]]}}}