skip to main content
10.1145/3358331.3358395acmotherconferencesArticle/Chapter ViewAbstractPublication PagesaiamConference Proceedingsconference-collections
research-article

Two-dimensional Categorical Data Collection Mechanism Satisfying Differential Privacy

Published: 17 October 2019 Publication History

Abstract

In this paper, we propose a differentially private data collection mechanism for two-dimensional categorical data that is easy to implement. The mechanism is mainly composed of coding, noise addition, integer approximation, modulo and decoding. The method of round, round toward zero, ceil and floor are adopted to convert the data into decimal integer. We use accuracy rate, the ratio of the output data which is the same as the input data in the total output, to measure the utility of the mechanism. For privacy-preserving level, the measurement is based on local differential privacy. We define the privacy-preserving level of a randomized mechanism M which satisfies ϵ-local differential privacy as the minimum ϵ. We compare and analyze the utility and privacy-preserving level of each approximation method with the addition of relative noises to improve our mechanism. We find that round is the best approximation method for our mechanism and the utility and privacy-preserving level are related to the correlation coefficient of noises.

References

[1]
C. Dwork (2006). Differential privacy. In Proceedings of the 33rd International Colloguium on Automata, Languages and Programming (ICALP).
[2]
C. Dwork, and A. Roth (2014). The algorithmic foundations of differential privacy. Foundations and Trends? in Theoretical Computer Science, 9(3--4), 211--407.
[3]
lfar Erlingsson, A. Korolova, and V. Pihur (2014). Rappor: randomized aggregatable privacy-preserving ordinal response.
[4]
Z. Yihui, T. Wenru, L. Mingshuang, and L. Laifeng, (2019). A differentially private data collection mechanism and utility-privacy analysis, (submitted).
[5]
F. McSherry and K. Talwar (2007). Mechanism design via differential privacy, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 94C103.
[6]
H. Liu, Z. Q. Wu, C. G. Peng, and X. J. Lei (2018). Genomic privacy preserving framework for single nucleotide polymorphisms linkage disequilibrium, Journal of Software.
[7]
I. Wagner and D. Eckhoff (2018). Technical privacy metrics: a systematic survey, Computer Science, 51(3).
[8]
D. Kifer and B. Lin (2012). An axiomatic view of statistical privacy and utility, Journal of Privacy and Confidentiality, 4(1), pp. 5--49.
[9]
D. Kifer and A. Machanavajjhala (2014). Pufferfish: A framework for mathematical privacy definitions.
[10]
J. Soria-Comas and J. Domingo-Ferrer (2013). Optimal data-independent noise for differential privacy. Information Sciences, 250(Complete), 200--214.
[11]
Q. Geng and P. Viswanath (2016). Optimal noise adding mechanisms for approximate differential privacy, IEEE Transactions on Information Theory, 62(2), pp. 952--969, 2016.
[12]
Q. Geng, P. Kairouz, S. Oh, and P. Viswanath (2015). The staircase mechanism in differential privacy, IEEE Journal of Selected Topics in Signal Processing, 9(7), pp. 1176--1184
[13]
Q. Geng and P. Viswanath (2016). The optimal noise-adding mechanism in differential privacy, IEEE Transactions on Information Theory, 62(2), pp. 925--951
[14]
N. Holohan, D. J. Leith, and O. Mason (2016). Extreme points of the local differential privacy polytope. Linear Algebra & Its Applications.

Index Terms

  1. Two-dimensional Categorical Data Collection Mechanism Satisfying Differential Privacy

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    AIAM 2019: Proceedings of the 2019 International Conference on Artificial Intelligence and Advanced Manufacturing
    October 2019
    418 pages
    ISBN:9781450372022
    DOI:10.1145/3358331
    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 ACM 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: 17 October 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. local differential privacy
    2. privacy preserving level
    3. two-dimensional categorical data
    4. utility

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Funding Sources

    • Central Universities
    • the Foundation of Guizhou Provincial Key Laboratory of Public Big Data

    Conference

    AIAM 2019

    Acceptance Rates

    Overall Acceptance Rate 100 of 285 submissions, 35%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 83
      Total Downloads
    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 28 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

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media