Traceable high-dimensional data publishing based on Alliance Chain

被引:0
作者
Dai, Shibo [1 ]
Zhu, Youwen [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Nanjing, Peoples R China
来源
2023 5TH INTERNATIONAL CONFERENCE ON BLOCKCHAIN TECHNOLOGY, ICBCT 2023 | 2023年
基金
国家重点研发计划;
关键词
high-dimensional; data synthesis; watermark; Alliance Chain;
D O I
10.1145/3638025.3638027
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
High-dimensional data publishing based on Local Differential Privacy (LDP) mainly adopts the method of synthesizing similar datasets, which only needs to rely on semi-honest centers. LDP disturbs the data locally to avoid the illegal leakage of data by the data collector. However, after the data is published, the data receiver may illegally transmit the private dataset, and the existing work cannot realize the responsibility tracing and copyright protection. Besides, the existing work cannot solve the problem of false datasets published by data collectors. In this paper, the reversible robust watermark is used to embed the identity information of the data receiver into the generated database. Once the leakage occurs, the watermark can be extracted to trace the source, which solves the problem of illegal transmitted by the data receiver. In addition, the consensus mechanism of Alliance Chain was used to make the dataset published by the data collector be approved by most members of the chain, which solved the problem of false release by data collector. Experiments show that our method has good usability and scalability. In terms of robustness, even if the attacker tampers more than 80% of the data, it can still ensure the rationality of the dataset.
引用
收藏
页码:1 / 7
页数:7
相关论文
共 24 条
[1]  
Agrawal R., 2002, Proceedings of the Twenty-eighth International Conference on Very Large Data Bases, P155
[2]   Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains [J].
Androulaki, Elli ;
Barger, Artem ;
Bortnikov, Vita ;
Cachin, Christian ;
Christidis, Konstantinos ;
De Caro, Angelo ;
Enyeart, David ;
Ferris, Christopher ;
Laventman, Gennady ;
Manevich, Yacov ;
Muralidharan, Srinivasan ;
Murthy, Chet ;
Binh Nguyen ;
Sethi, Manish ;
Singh, Gari ;
Smith, Keith ;
Sorniotti, Alessandro ;
Stathakopoulou, Chrysoula ;
Vukolic, Marko ;
Cocco, Sharon Weed ;
Yellick, Jason .
EUROSYS '18: PROCEEDINGS OF THE THIRTEENTH EUROSYS CONFERENCE, 2018,
[3]  
[Anonymous], 2008, P INT WORKSH SEC PRI, DOI [10.1145/1503402.1503413, DOI 10.1145/1503402.1503413]
[4]   Plausible Deniability for Privacy-Preserving Data Synthesis [J].
Bindschaedler, Vincent ;
Shokri, Reza ;
Gunter, Carl A. .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2017, 10 (05) :481-492
[5]  
Chen Dingfan, 2020, Advances in Neural Information Processing Systems, V33
[6]   Differentially Private High-Dimensional Data Publication via Sampling-Based Inference [J].
Chen, Rui ;
Xiao, Qian ;
Zhang, Yu ;
Xu, Jianliang .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :129-138
[7]   Locally differentially private high-dimensional data synthesis [J].
Chen, Xue ;
Wang, Cheng ;
Yang, Qing ;
Hu, Teng ;
Jiang, Changjun .
SCIENCE CHINA-INFORMATION SCIENCES, 2023, 66 (01)
[8]  
Dwork C, 2006, LECT NOTES COMPUT SC, V4052, P1
[9]   Calibrating noise to sensitivity in private data analysis [J].
Dwork, Cynthia ;
McSherry, Frank ;
Nissim, Kobbi ;
Smith, Adam .
THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2006, 3876 :265-284
[10]   Fully Homomorphic Encryption Using Ideal Lattices [J].
Gentry, Craig .
STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, :169-178