arrow
返回

Multi-Party Sequential Data Publishing Under Differential Privacy

delete2023-09-01
delete1
PRE
AI
P
Peng Tang
R
Rui Chen *
苏
苏森 (Sen Su)
S
Shanqing Guo *
L
Lei Ju
G
Gaoyuan Liu
DOI:10.1109/TKDE.2023.3241661delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Given a set of local sequential datasets held by multiple parties, we study the problem of publishing a synthetic dataset that preserves approximate sequentiality information of the integrated dataset while satisfying differential privacy for each local dataset. The existing solutions for publishing differentially private sequential data in the centralized setting mostly adopt tree-based approaches. Such approaches rely on different tree structures that encode sequential data's statistical information. The construction of a tree structure is normally done by recursively splitting nodes whose noisy scores (e.g., entropy or count) are larger than a given threshold. However, extending similar ideas to the multi-party setting is challenging. First, the comparison between noisy scores and a given threshold needs to be done in a distributed manner without letting the parties know the noisy scores, while satisfying differential privacy for each local dataset. Second, in the multi-party setting the large number of node splitting decisions incurs prohibitive computation costs. In addressing the above challenges, we present DPST, a distributed prediction suffix tree construction solution. In DPST, we first introduce a novel node splitting decision method that calculates the comparison result under encryption with substantially improved efficiency. Then we present a novel batch-based tree construction approach to reduce computation costs. In order to achieve high parallel performance without incurring any extra communication cost, we introduce the conjunction and slide methods to ensure that each batch contains a stable number of carefully arranged decision tasks. To further reduce communication and computation costs, we propose a prefix-based pre-pruning method to reduce the number of nodes that need to be judged whether to split by an interactive protocol. Extensive experiments on real datasets demonstrate that our DPST solution offers desirable data utility with low computation and communication costs.
Keyword:
Index Terms-Data publishing
differential privacy
multiple party
sequential dataset

期刊

IEEE Transactions on Knowledge and Data Engineering 封面图
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
论文数:
6.9K
被引数:
3.2W

机构

H
Harbin Engineering University
学者数:
1.9W
论文数: 1.3W
被引数: 1.3W
S
shandong university
学者数:
9.5W
论文数: 6.4W
被引数: 94
引用论文

引用论文

Secure Two-Party Differentially Private Data Release for Vertically Partitioned Data
err2014-01-01
err50
PREAI
errMohammed, Noman; Alhadidi, Dima; Fung, Benjamin C. M.; Debbabi, Mourad
err分享
err收藏
err分享
err收藏
Immunohistochemical characterization of epithelial cells in human lacrimal glands
err1990-01-01
err0
PREAI
errNadarajah Vigneswaran; Carl Michael Wilk; Angelika Heese; Otto Paul Hornstein; Gottfried O. H. Naumann
err分享
err收藏
err分享
err收藏
Gotcha! Catching Kids During Mindless Reading
err2014-03-20
err0
PREAI
errKhanh-Vy Nguyen; Katherine S. Binder; Carolyn Nemier; Scott P. Ardoin
err分享
err收藏
学者 查看更多内容