skip to main content
10.1145/3638025.3638027acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicbctConference Proceedingsconference-collections
research-article

Traceable high-dimensional data publishing based on Alliance Chain

Published: 13 May 2024 Publication History

Abstract

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.

References

[1]
Rakesh Agrawal and Jerry Kiernan. 2002. Watermarking relational databases. In Proceedings of the 28th International Conference on Very Large Databases(VLDB ’02). VLDB Endowment, Hong Kong, China, 155–166. https://doi.org/10.1016/B978-155860869-6/50022-6
[2]
Elli Androulaki, Artem Barger, Vita Bortnikov, Christian Cachin, Konstantinos Christidis, Angelo De Caro, David Enyeart, Christopher Ferris, Gennady Laventman, Yacov Manevich, 2018. Hyperledger fabric: a distributed operating system for permissioned blockchains. In Proceedings of the 13th EuroSys Conference(EuroSys ’18). Association for Computing Machinery, New York, NY, USA, 1–15. https://doi.org/10.1145/3190508.3190538
[3]
Vincent Bindschaedler, Reza Shokri, and Carl A Gunter. 2017. Plausible deniability for privacy-preserving data synthesis. In Proceedings of the VLDB Endowment. VLDB Endowment, 481–492. https://doi.org/10.14778/3055540.3055542
[4]
Dingfan Chen, Tribhuvanesh Orekondy, and Mario Fritz. 2020. Gs-wgan: A gradient-sanitized approach for learning differentially private generators. In Proceedings of the 34th International Conference on Neural Information Processing Systems(NIPS’20). Curran Associates Inc., Vancouver, BC, Canada, 12673–12684. https://doi.org/10.48550/arXiv.2006.08265
[5]
Rui Chen, Qian Xiao, Yu Zhang, and Jianliang Xu. 2015. Differentially private high-dimensional data publication via sampling-based inference. In Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining(KDD ’15). Association for Computing Machinery, New York, NY, USA, 129–138. https://doi.org/10.1145/2783258.2783379
[6]
Xue Chen, Cheng Wang, Qing Yang, Teng Hu, and Changjun Jiang. 2022. Locally differentially private high-dimensional data synthesis. Science China Information Sciences 66, 1 (December 2022), 1–18. https://doi.org/10.1007/s11432-022-3583-x
[7]
Cynthia Dwork. 2006. Differential privacy. In Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II(ICALP ’06). Springer-Verlag, Venice, Italy, 1–12. https://doi.org/10.1007/11787006_1
[8]
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. 2006. Calibrating noise to sensitivity in private data analysis. In Proceedings of the 3rd conference on Theory of Cryptography(TCC ’06). Springer-Verlag, New York, NY, USA, 265–284. https://doi.org/10.1007/11681878_14
[9]
Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices. In Proceedings of the 41st annual ACM symposium on Theory of computing(STOC ’09). Association for Computing Machinery, New York, NY, USA, 169–178. https://doi.org/10.1145/1536414.1536440
[10]
Shiva Prasad Kasiviswanathan, Homin K Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. 2011. What can we learn privately?SIAM J. Comput. 40, 3 (June 2011), 793–826. https://doi.org/10.1137/090756090
[11]
Aditya Kunar. 2021. CTAB-GAN: Effective Tabular Data Synthesizing. (May 2021). https://doi.org/10.48550/arXiv.2102.08369
[12]
Ninghui Li, Tiancheng Li, and Suresh Venkatasubramanian. 2007. t-closeness: Privacy beyond k-anonymity and l-diversity. In Proceedings of the 23rd International Conference on Data Engineering(ICDE ’07). IEEE Computer Society, Istanbul, Turkey, 106–115. https://doi.org/10.1109/ICDE.2007.367856
[13]
Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke, and Muthuramakrishnan Venkitasubramaniam. 2007. l-diversity: Privacy beyond k-anonymity. ACM Transactions on Knowledge Discovery from Data (TKDD) 1, 1 (March 2007), 3–es. https://doi.org/10.1145/1217299.1217302
[14]
Ryan McKenna, Daniel Sheldon, and Gerome Miklau. 2019. Graphical-model based estimation and inference for differential privacy. In Proceedings of the 36th International Conference on Machine Learning(ICML ’19). PMLR, Long Beach, California, USA, 4435–4444. https://doi.org/10.1145/2783258.2783379
[15]
Mehmet Ercan Nergiz, Maurizio Atzori, and Yucel Saygin. 2008. Towards trajectory anonymization: a generalization-based approach. In Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS(SPRINGL ’08). Association for Computing Machinery, New York, NY, USA, 52–61. https://doi.org/10.1145/1503402.1503413
[16]
Vahab Pournaghshband. 2008. A new watermarking approach for relational data. In Proceedings of the 46th Annual Southeast Regional Conference on XX(ACM-SE ’46). Association for Computing Machinery, New York, NY, USA, 127–131. https://doi.org/10.1145/1593105.1593138
[17]
Sofya Raskhodnikova, Adam Smith, Homin K Lee, Kobbi Nissim, and Shiva Prasad Kasiviswanathan. 2008. What can we learn privately. In Proceedings of the 49th Annual Symposium on Foundations of Computer Science(FOCS ’08). IEEE Computer Society, Philadelphia, PA, 531–540. https://doi.org/10.1109/FOCS.2008.27
[18]
Pierangela Samarati and Latanya Sweeney. 1998. Generalizing data to provide anonymity when disclosing information. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems(PODS ’98). Association for Computing Machinery, New York, NY, USA, 10–1145. https://doi.org/10.1145/275487.275508
[19]
Radu Sion. 2004. Proving ownership over categorical data. In Proceedings of the 20th International Conference on Data Engineering(ICDE ’04). IEEE Computer Society, NW Washington, DC, USA, 584–595. https://doi.org/0.1109/ICDE.2004.1320029
[20]
Radu Sion, Mikhail Atallah, and Sunil Prabhakar. 2003. Rights protection for relational data. In Proceedings of the 2003 ACM SIGMOD international conference on Management of data(SIGMOD ’03). Association for Computing Machinery, New York, NY, USA, 98–109. https://doi.org/10.1145/872757.872772
[21]
Stanley L Warner. 1965. Randomized response: A survey technique for eliminating evasive answer bias. J. Amer. Statist. Assoc. 60, 309 (April 1965), 63–69. https://www.tandfonline.com/doi/abs/10.1080/01621459.1965.10480775
[22]
Jun Zhang, Graham Cormode, Cecilia M Procopiuc, Divesh Srivastava, and Xiaokui Xiao. 2017. Privbayes: Private data release via bayesian networks. ACM Transactions on Database Systems (TODS) 42, 4 (October 2017), 1–41. https://doi.org/10.1145/3134428
[23]
Zhikun Zhang, Tianhao Wang, Jean Honorio, Ninghui Li, Michael Backes, Shibo He, Jiming Chen, and Yang Zhang. 2021. Privsyn: Differentially private data synthesis. In Proceedings of the 30th USENIX Security Symposium(USENIX Security ’21). USENIX, Online, 1–15.
[24]
Bin Zhou and Jian Pei. 2008. Preserving privacy in social networks against neighborhood attacks. In Proceedings of the 24th International Conference on Data Engineering(ICDE ’08). IEEE Computer Society, Cancun, Mexico, 506–515. https://doi.org/10.1109/ICDE.2008.4497459

Index Terms

  1. Traceable high-dimensional data publishing based on Alliance Chain

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICBCT '23: Proceedings of the 2023 5th International Conference on Blockchain Technology
    November 2023
    72 pages
    ISBN:9798400708930
    DOI:10.1145/3638025
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 13 May 2024

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Alliance Chain
    2. data synthesis
    3. high-dimensional
    4. watermark

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Funding Sources

    • Natural Science Foundation of China

    Conference

    ICBCT 2023

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 10
      Total Downloads
    • Downloads (Last 12 months)10
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 15 Feb 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format.

    HTML Format

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media