Personal data privacy protection method based onvertical partitioning

In distributed environments, vertical partitioning had been an effective method to protect user privacy. However, current vertical partitioning strategies assumed that there was no collusion among the CSPs (Cloud Service Providers) involved in data storage. This study explored how to protect user da...

Full description

Saved in:
Bibliographic Details
Main Authors: RUAN Huafeng, LI Rui, LUO Kailun
Format: Article
Language:English
Published: POSTS&TELECOM PRESS Co., LTD 2024-10-01
Series:网络与信息安全学报
Subjects:
Online Access:http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2024076
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1841529502351491072
author RUAN Huafeng
LI Rui
LUO Kailun
author_facet RUAN Huafeng
LI Rui
LUO Kailun
author_sort RUAN Huafeng
collection DOAJ
description In distributed environments, vertical partitioning had been an effective method to protect user privacy. However, current vertical partitioning strategies assumed that there was no collusion among the CSPs (Cloud Service Providers) involved in data storage. This study explored how to protect user data privacy when collusion might exist between CSP. Assuming <italic>n</italic> CSP participated in data storage, with no more than <italic>k</italic> of these potentially colluding, this paper defined a (<italic>k</italic>, <italic>n</italic>)-security for vertical partitioning and introduced an automated computation scheme for vertical partitioning based on machine learning—the MLVP scheme. This MLVP scheme utilized machine learning algorithms to analyze the correlation between attributes, optimized all correlations, and transformed the vertical partitioning problem into a satisfiability problem, which was then solved using a satisfiability solver. Moreover, the security of the MLVP scheme was theoretically analyzed. To validate the effectiveness of the MLVP scheme, experiments were conducted on real datasets to compare the impact of different machine learning algorithms and levels of privacy protection on the effectiveness and performance of the vertical partitioning. The experiments also compared the MLVP scheme with two other schemes that did not consider collusion among CSP, Oriol’s and Ciriani’s schemes, in terms of computation and query speeds. The results showed that the MLVP scheme was slightly slower in computation speed to ensure security against partial CSP collusion. However, it improved the query speed by 32.6% and 8.8% compared to the aforementioned schemes, respectively.
format Article
id doaj-art-2aecc8e71e7e41a6ac1f5cba6540e0fd
institution Kabale University
issn 2096-109X
language English
publishDate 2024-10-01
publisher POSTS&TELECOM PRESS Co., LTD
record_format Article
series 网络与信息安全学报
spelling doaj-art-2aecc8e71e7e41a6ac1f5cba6540e0fd2025-01-15T03:17:25ZengPOSTS&TELECOM PRESS Co., LTD网络与信息安全学报2096-109X2024-10-011017518777772599Personal data privacy protection method based onvertical partitioningRUAN HuafengLI RuiLUO KailunIn distributed environments, vertical partitioning had been an effective method to protect user privacy. However, current vertical partitioning strategies assumed that there was no collusion among the CSPs (Cloud Service Providers) involved in data storage. This study explored how to protect user data privacy when collusion might exist between CSP. Assuming <italic>n</italic> CSP participated in data storage, with no more than <italic>k</italic> of these potentially colluding, this paper defined a (<italic>k</italic>, <italic>n</italic>)-security for vertical partitioning and introduced an automated computation scheme for vertical partitioning based on machine learning—the MLVP scheme. This MLVP scheme utilized machine learning algorithms to analyze the correlation between attributes, optimized all correlations, and transformed the vertical partitioning problem into a satisfiability problem, which was then solved using a satisfiability solver. Moreover, the security of the MLVP scheme was theoretically analyzed. To validate the effectiveness of the MLVP scheme, experiments were conducted on real datasets to compare the impact of different machine learning algorithms and levels of privacy protection on the effectiveness and performance of the vertical partitioning. The experiments also compared the MLVP scheme with two other schemes that did not consider collusion among CSP, Oriol’s and Ciriani’s schemes, in terms of computation and query speeds. The results showed that the MLVP scheme was slightly slower in computation speed to ensure security against partial CSP collusion. However, it improved the query speed by 32.6% and 8.8% compared to the aforementioned schemes, respectively.http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2024076vertical partitioningprivacy protection<italic>k</italic>-anonymitymachine learningsatisfiability problem
spellingShingle RUAN Huafeng
LI Rui
LUO Kailun
Personal data privacy protection method based onvertical partitioning
网络与信息安全学报
vertical partitioning
privacy protection
<italic>k</italic>-anonymity
machine learning
satisfiability problem
title Personal data privacy protection method based onvertical partitioning
title_full Personal data privacy protection method based onvertical partitioning
title_fullStr Personal data privacy protection method based onvertical partitioning
title_full_unstemmed Personal data privacy protection method based onvertical partitioning
title_short Personal data privacy protection method based onvertical partitioning
title_sort personal data privacy protection method based onvertical partitioning
topic vertical partitioning
privacy protection
<italic>k</italic>-anonymity
machine learning
satisfiability problem
url http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2024076
work_keys_str_mv AT ruanhuafeng personaldataprivacyprotectionmethodbasedonverticalpartitioning
AT lirui personaldataprivacyprotectionmethodbasedonverticalpartitioning
AT luokailun personaldataprivacyprotectionmethodbasedonverticalpartitioning