RT journal article
T1 On the (k,l)-anonymity of networks via their k-metric antidimension
A1 Fernández Areizaga, Elena
A1 Kuziak, Dorota
A1 Muñoz Márquez, Manuel
A1 González Yero, Ismael
A2 Estadística e Investigación Operativa
A2 Matemáticas
K1 anonimity of networks
K1 k-metric antidimension
AB This work focuses on the (k,l)-anonymity of some networks as a measure of their privacy against active attacks. Two different types of networks are considered. The first one consists of graphs with a predetermined structure, namely cylinders, toruses, and 2-dimensional Hamming graphs, whereas the second one is formed by randomly generated graphs. In order to evaluate the (k,l)-anonymity of the considered graphs, we have computed their k-metric antidimension. To this end, we have taken a combinatorial approach for the graphs with a predetermined structure, whereas for randomly generated graphs we have developed an integer programming formulation and computationally tested its implementation. The results of the combinatorial approach, as well as those from the implementations indicate that, according to the (k,l)-anonymity measure, only the 2-dimensional Hamming graphs and some general random dense graphs are achieving some higher privacy properties.
PB NATURE PORTFOLIO
SN 2045-2322
YR 2023
FD 2023-11-04
LK http://hdl.handle.net/10498/29984
UL http://hdl.handle.net/10498/29984
LA eng
NO MINECOUniversidad de Cádiz
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026