TSRAM: A time-saving k-degree anonymization method in social network

作者：

Highlights：

• We use a tree structure to make the anonymization process interactive.

• This tree structure is very compressed.

• Two new effective criteria are proposed to select the best edges.

• The proposed technique improves the runtime, time complexity, memory usage.

• The anonymized graph utility is preserved.

摘要

•We use a tree structure to make the anonymization process interactive.•This tree structure is very compressed.•Two new effective criteria are proposed to select the best edges.•The proposed technique improves the runtime, time complexity, memory usage.•The anonymized graph utility is preserved.

论文关键词：K-degree anonymization,One-time scan,Utility,Privacy preserving,Social network

论文评审过程：Received 21 August 2018, Revised 6 January 2019, Accepted 25 January 2019, Available online 31 January 2019, Version of Record 15 February 2019.

论文官网地址：https://doi.org/10.1016/j.eswa.2019.01.059