Search Results for author:
Found 8 papers, 1 papers with code
Degree-Preserving Randomized Response for Graph Neural Networks under Local Differential Privacy
Technically, our DPRR uses Warner's RR (Randomized Response) and strategic edge sampling, where each user's sampling probability is automatically tuned using the Laplacian mechanism to preserve the degree information under edge LDP.
TransMIA: Membership Inference Attacks Using Transfer Shadow Training
Transfer learning has been widely studied and gained increasing popularity to improve the accuracy of machine learning models by transferring some knowledge acquired in different training.
Locality Sensitive Hashing with Extended Differential Privacy
Then we show that our mechanisms enable friend matching with high utility and rigorous privacy guarantees based on extended DP.
Privacy-Preserving Multiple Tensor Factorization for Synthesizing Large-Scale Location Traces with Cluster-Specific Features
We model various statistical features of the original traces by a transition-count tensor and a visit-count tensor.
Local Distribution Obfuscation via Probability Coupling
We introduce a general model for the local obfuscation of probability distributions by probabilistic perturbation, e. g., by adding differentially private noise, and investigate its theoretical properties.
Local Obfuscation Mechanisms for Hiding Probability Distributions
To improve the tradeoff between distribution privacy and utility, we introduce a local obfuscation mechanism, called a tupling mechanism, that adds random dummy data to the output.
Cryptography and Security Databases Information Theory Information Theory
On the Anonymization of Differentially Private Location Obfuscation
Obfuscation techniques in location-based services (LBSs) have been shown useful to hide the concrete locations of service users, whereas they do not necessarily provide the anonymity.
Cryptography and Security Databases Information Theory Information Theory
Cancelable Indexing Based on Low-rank Approximation of Correlation-invariant Random Filtering for Fast and Secure Biometric Identification
Furthermore, existing biometric indexing schemes cannot be used in conjunction with template protection schemes to speed up biometric identification, since a biometric index leaks some information about the original feature.
