CoChat

Toward sensitive document release with privacy guarantees

Open access
Sánchez, David, Batet, Montserrat · 2017 · Engineering Applications of Artificial Intelligence
Cited by 33

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

Privacy has become a serious concern for modern Information Societies. The sensitive nature of much of the data that are daily exchanged or released to untrusted parties requires that responsible organizations undertake appropriate privacy protection measures. Nowadays, much of these data are texts (e.g., emails, messages posted in social media, healthcare outcomes, etc.) that, because of their unstructured and semantic nature, constitute a challenge for automatic data protection methods. In fact, textual documents are usually protected manually, in a process known as document redaction or sanitization. To do so, human experts identify sensitive terms (i.e., terms that may reveal identities and/or confidential information) and protect them accordingly (e.g., via removal or, preferably, generalization). To relieve experts from this burdensome task, in a previous work we introduced the theoretical basis of C-sanitization, an inherently semantic privacy model that provides the basis to the development of automatic document redaction/sanitization algorithms and offers clear and a priori privacy guarantees on data protection; even though its potential benefits C-sanitization still presents some limitations when applied to practice (mainly regarding flexibility, efficiency and accuracy). In this paper, we propose a new more flexible model, named (C, g(C))-sanitization, which enables an intuitive configuration of the trade-off between the desired level of protection (i.e., controlled information disclosure) and the preservation of the utility of the protected data (i.e., amount of semantics to be preserved). Moreover, we also present a set of technical solutions and algorithms that provide an efficient and scalable implementation of the model and improve its practical accuracy, as we also illustrate through empirical experiments. Theory and implementation of (C,g(C))-sanitization, a semantic document sanitization privacy model.An intuitive mechanism to configure the trade-off between privacy and utility.An heuristic and scalable algorithm implementing (C,g(C))-sanitization.An accurate assessment of disclosure risks based on the Web's information distribution.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.engappai.2016.12.013

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Research works printed but not linked: 29

  1. Adimoolam, M., Vasanth, I., Prabhu, D., Karthi, G., 2009. Authorship protection for textual documents. In: Proceedings of the 2009 International Conference on Advances in Computing, Control, and Telecommunication Technologies, pp. 742–745. · DOI
  2. Almishari, M., Oguz, E., Tsudik, G., 2014. Fighting authorship linkability with crowdsourcing. In: Proceedings of the Second ACM Conference on Online Social Networks. ACM, Boston, USA, pp. 69–82. · DOI
  3. Anandan, 2012, t-plausibility: generalizing words to desensitize text, Trans. Data Priv., 5, 505
  4. Bier, 2009, The rules of redaction: identify, protect, review (and repeat), IEEE Secur. Priv. Mag., 7, 46, 10.1109/MSP.2009.183 · DOI · Paper page
  5. Chakaravarthy, V.T., Gupta, H., Roy, P., Mohania, M.K., 2008. Efficient techniques for document sanitization. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management (CIKM’08). Napa Valley, California, USA, pp. 843–852. · DOI · Paper page
  6. Chow, R., Golle, P., Staddon, J., 2008. Detecting privacy leacks using corpus-based association rules. In: Proceedings of the 14th Conference on Knowledge Discovery and Data Mining. ACM, Las Vegas, NV, pp. 893–901. · DOI · Paper page
  7. Church, 1990, Word association norms, mutual information, and lexicography, Comput. Linguist., 16, 22
  8. Cilibrasi, 2006, The Google similarity distance, IEEE Trans. Knowl. Data Eng., 19, 370, 10.1109/TKDE.2007.48 · DOI · Paper page
  9. Cumby, C., Ghani, R., 2011. A machine learning based system for semiautomatically redacting documents. In: Proceedings of the Twenty-Third Conference on Innovative Applications of Artificial Intelligence. San Francisco, California, USA, pp. 1628–1635. · DOI
  10. Drechsler, J., 2011. My understanding of the differences between the CS and the statistical approach to data confidentiality. In: Research, I.f.E. (Ed.), Proceedings of the 4th IAB Workshop on Confidentiality and Disclosure.
  11. Gordon, 2013, MRA thought of the day – medical record redacting: a burdensome and problematic method for protecting patient privacy, MRA Health Inf. Serv.
  12. Jiang, J.J., Conrath, D.W., 1997. Semantic similarity based on corpus statistics and lexical taxonomy. In: Proceedings of International Conference on Research in Computational Linguistics, ROCLING X. Taipei, Taiwan, pp. 19–33.
  13. Kilgarriff, 2007, Googleology is bad science, Comput. Linguist., 33, 147, 10.1162/coli.2007.33.1.147 · DOI · Paper page
  14. Koppel, 2013, Authorship attribution: what's easy and what's hard?, SSRN Electron. J., 21
  15. Lemaire, 2006, Effects of high-order co-occurrences on word semantic similarities, Current Psychol. Lett. Behav. Brain Cogn., 18, 1
  16. Lin, 2016, A sanitization approach for hiding sensitive itemsets based on particle swarm optimization, Eng. Appl. Artif. Intell., 53, 1, 10.1016/j.engappai.2016.03.007 · DOI
  17. Lin, 2016, Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining, Eng. Appl. Artif. Intell., 55, 269, 10.1016/j.engappai.2016.07.003 · DOI
  18. Lin, D., 1998. An information-theoretic definition of similarity. In: Shavlik, J. (Ed.), Fifteenth International Conference on Machine Learning, ICML 1998. Morgan Kaufmann, Madison, Wisconsin, USA, pp. 296–304.
  19. Meystre, 2010, Automatic de-identification of textual documents in the electronic health record: a review of recent research, BMC Med. Res. Methodol., 10
  20. Resnik, P., 1995. Using information content to evalutate semantic similarity in a taxonomy. In: Mellish, C.S. (Ed.), 14th International Joint Conference on Artificial Intelligence, IJCAI 1995. Morgan Kaufmann Publishers Inc., Montreal, Quebec, Canada, pp. 448–453.
  21. Samarati, 2001, Protecting respondents' identities in microdata release, IEEE Trans. Knowl. Data Eng., 13, 1010, 10.1109/69.971193 · DOI · Paper page
  22. Sánchez, 2011, Semantic similarity estimation in the biomedical domain: an ontology-based information-theoretic perspective, J. Biomed. Inform., 44, 749, 10.1016/j.jbi.2011.03.013 · DOI
  23. Sánchez, 2012, A new model to compute the information content of concepts from taxonomic knowledge, Int. J. Semant. Web Inf. Syst., 8, 34, 10.4018/jswis.2012040102 · DOI
  24. Sánchez, 2010, Ontology-driven web-based semantic similarity, J. Intell. Inf. Syst., 35, 383, 10.1007/s10844-009-0103-x · DOI · Paper page
  25. Seco, N., Veale, T., Hayes, J., 2004. An intrinsic information content metric for semantic similarity in WordNet. In: López de Mántaras, R., Saitta, L. (Eds.), 16th European Conference on Artificial Intelligence, ECAI 2004, Including Prestigious Applicants of Intelligent Systems, PAIS 2004. IOS Press. Valencia, Spain, pp. 1089–1090.
  26. Staddon, J., Golle, P., Zimmy, B., 2007. Web-based inference detection. In: 16th USENIX Security Symposium, p. Article No. 6.
  27. Terry, N., Francis, L., 2007. Ensuring the privacy and confidentiality of electronic health records, University of Illinois Law Review, pp. 681–735.
  28. Torra, V., 2011. Towards knowledge intensive data privacy. In: Proceedings of the 5th international Workshop on data privacy management. Springer-Verlag, pp. 1–7. · doi:10.1007/978-3-642-19348-4_1
  29. Turney, P.D., 2001. Mining the web for synonyms: PMI-IR versus LSA on TOEFL. In: De Raedt, L., Flach, P. (Eds.), 12th European Conference on Machine Learning, ECML 2001. Springer-Verlag, Freiburg, Germany, pp. 491–502. · DOI · Paper page

Cited by

Metadata

Authors
Sánchez, D., & Batet, M.
Venue
Engineering Applications of Artificial Intelligence
Publisher
Elsevier BV
Published
2017-03
Volume
59
Pages
23-34
ISSN
0952-1976 (ISSN-L)
OpenAlex
W2562898622
Cited by
33
References
2
FWCI
2.21
Type
journal article
Language
en
Open access
green
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)
Funders
  • European Commission (H2020-644024, H2020-700540)
  • Spanish Government (TIN2014-57364-C2-R, TIN2015-70054-REDC, TIN2016-80250-R)
  • Government of Catalonia (2014 SGR 537)
  • Ministry of Economy and Competitiveness (FPDI-2013-16589)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.