GRAM: An efficient (k, l) graph anonymization method

作者：

Highlights：

• A novel method to construct a (k,l)-anonymous graph is proposed.

• The method is very Efficient, using the proved propositions.

• The method is evaluated on a variety of datasets and configurations.

• The proposed technique improves the runtime, information loss, and privacy.

• The anonymized graph utility is preserved.

摘要

•A novel method to construct a (k,l)-anonymous graph is proposed.•The method is very Efficient, using the proved propositions.•The method is evaluated on a variety of datasets and configurations.•The proposed technique improves the runtime, information loss, and privacy.•The anonymized graph utility is preserved.

论文关键词：Data privacy,Graph anonymity,Data publishing,(k, l) Anonymization,Social networks

论文评审过程：Received 4 April 2019, Revised 27 January 2020, Accepted 12 April 2020, Available online 17 April 2020, Version of Record 22 April 2020.

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