Generalized Piecewise Mechanism (GPM) and Privacy-Optimized GPM for Collecting Multidimensional Data
In "Theoretical Comparison" folder, we compared our GPM with the existing methods in terms of the variance of collected private values.
"Privacy Guarantees" folder contains the codes for evaluating the achieved privacy guarantees for the entire (multidimensinal) data, when the privacy level regarding each attribute information was respectively given.
"Accuracy" folder provides the codes for evaluating the utility of our method using simulaton data and real data (from IPUMS International), when the privacy budget for the entire data was given. (Our method allows more of the privacy budget to be distributed for each
In "RunTime.ipynb", we measured the run time to solve the minimization problem for obtaining the optimized
・ Developing specialized methods for each analysis purpose (e.g., mean estimation and classification) while considering a hybrid mechanism with reference to existing studies [Wang et al., 2019, Zhao et al., 2021].
(Note: The discussion of PM-OPT in Zhao et al.'s paper focused only on worst-case variance and proposed an "optimal" PM. However, that was not enough; for example, a smaller best-case variance is achieved by the original PM than the PM-SUB when
・ When the number of dimensions exceeds about
・ Developing a method that allows random sampling or dimensionality reduction while setting the privacy level of each attribute information.
For details of our methods and discussion, please see our paper entitled "Generalization and Enhancement of Piecewise Mechanism for Collecting Multidimensional Data" presented at IEEE SpaCCS 2024.
Akito Yamamoto
Division of Medical Data Informatics, Human Genome Center,
the Institute of Medical Science, the University of Tokyo