Building Security Mechanisms for Cross-Border Business Customer Data Analysis Based on Smart Computing
Author(s) -
Yicai Li,
Lin Shi
Publication year - 2022
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2022/9017267
Subject(s) - anonymity , graph , node (physics) , computer science , computer security , theoretical computer science , engineering , structural engineering
Dynamic social networks also suffer from privacy violation due to the continuous release of data. In order to defend against enemy attacks, a new dynamic privacy-preserving method is innovated, called Dynamic k w Re-Structured Diversity Anonymity ( k w -SDA). This method limits the probability of disclosure of node/community identities to 1 / k when data are continuously published by protecting individuals in groups. The graph based on the previous w − 1 is released, missing some graph alterations. The advantage of the proposed method is to save many features of the network while protecting privacy efficiently and effectively.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom