In order to protect privacy of social network participants, network graph data should be anonymised prior to its release. Most proposals in the literature aim to achieve $k$-anonymity under specific assumptions about the background information available to the attacker. Our method is based on randomizing
the location of the triangles in the graph. We show that this simple method preserves the main structural parameters of the graph to a high extent, while providing a high re-identification confusion.
Except where otherwise noted, this item's license is described as cc-by (c) Society of Mathematicians, Physicists and Astronomers of Slovenia, Institute of Mathematics, Physics, and Mechanics, University of Primorska (Slovenia) 2014