English

A Tutorial on Computing $t$-Closeness

Cryptography and Security 2019-11-27 v1 Databases

Abstract

This paper presents a tutorial of the computation of tt-closeness. An established model in the domain of privacy preserving data publishing, tt-closeness is a measure of the earth mover's distance between two distributions of an anonymized database table. This tutorial includes three examples that showcase the full computation of tt-closeness in terms of both numerical and categorical attributes. Calculations are carried out using the definition of the earth mover's distance and weighted order distance. This paper includes detailed explanations and calculations not found elsewhere in the literature. An efficient algorithm to calculate the tt-closeness of a table is also presented.

Keywords

Cite

@article{arxiv.1911.11212,
  title  = {A Tutorial on Computing $t$-Closeness},
  author = {Richard Dosselmann and Mehdi Sadeqi and Howard J. Hamilton},
  journal= {arXiv preprint arXiv:1911.11212},
  year   = {2019}
}

Comments

8 pages, 2 figures

R2 v1 2026-06-23T12:26:58.809Z