Extremal mechanisms for local differential privacy
The DOI matches its OpenAlex record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Local differential privacy has recently surfaced as a strong measure of privacy in contexts where personal information remains private even from data analysts. Working in a setting where both the d...
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835
Privacy in electronic commerce and the economics of immediate gratification
Acquisti, A. (2004) · Proceedings of the 5th ACM conference on Electronic commerce · doi:10.1145/988772.988777 · Cited by 561
The composition theorem for differential privacy
Kairouz, P., Oh, S., & Viswanath, P. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2685505 · Cited by 408
Self-citation
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., McMahan, H. B., Avent, B., Bellet, A., Bennis, M., Bhagoji, A. N., Bonawitz, K., Charles, Z., Cormode, G., Cummings, R., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.04977 · Cited by 7,857
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“While LDP protocols are effective at enforcing privacy and have theoretical justifications [156, 135, 136], a number of results have shown that achieving local differential privacy while preserving utility is challenging particularly, especially in high-dimensional data settings [229, 388, 219, 51, 220, 424, 142, 111].”
BackgroundSelf-citationLocal Differential Privacy-Based Federated Learning for Internet of Things
Zhao, Y., Zhao, J., Yang, M., Wang, T., Wang, N., Lyu, L., Niyato, D., & Lam, K.-Y. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3037194 · Cited by 456
“Although [12] handles categorical data, its results can provide the following insight even for continuous numeric data: for very small , a mechanism generating a binary output should be optimal; for very large , the optimal mechanism’s output should have infinite possibilities.”
BackgroundInfluentialDifferential Privacy for Deep and Federated Learning: A Survey
Ouadrhiri, A. E., & Abdelhadi, A. (2022) · IEEE Access · doi:10.1109/access.2022.3151670 · Cited by 445
Socially Responsible AI Algorithms: Issues, Purposes, and Challenges
Cheng, L., Varshney, K. R., & Liu, H. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12814 · Cited by 261
A Trustworthy Privacy Preserving Framework for Machine Learning in Industrial IoT Systems
Arachchige, P. C. M., Bertok, P., Khalil, I., Liu, D., Camtepe, S., & Atiquzzaman, M. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.2974555 · Cited by 236
sharma (2018) · doi:10.1109/mic.2018.112102519 · Cited by 220
Optimal schemes for discrete distribution estimation under locally differential privacy
Ye, M., & Barg, A. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2809790 · Cited by 158
Context-Aware Generative Adversarial Privacy
Huang, C., Kairouz, P., Chen, X., Sankar, L., & Rajagopal, R. (2017) · Entropy · doi:10.3390/e19120656 · Cited by 156
An efficient data aggregation scheme with local differential privacy in smart grid
Gai, N., Xue, K., Zhu, B., Yang, J., Liu, J., & He, D. (2022) · Digital Communications and Networks · doi:10.1016/j.dcan.2022.01.004 · Cited by 78
A survey of local differential privacy for securing internet of vehicles
Zhao, P., Zhang, G., Wan, S., Liu, G., & Umer, T. (2020) · The Journal of Supercomputing · doi:10.1007/s11227-019-03104-0 · Cited by 66
“To this end, the gradient response technique k -RR was proposed [53], which randomly responds to queries between multiple values of the variable.”
MethodNeera, J., Chen, X., Aslam, N., Wang, K., & Shu, Z. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3126577 · Cited by 42
“Local Differential Privacy (LDP) [32] has attracted much attention as it can provide a strong privacy guarantee in a setting where SPs are untrustworthy.”
AirGapAgent: Protecting Privacy-Conscious Conversational Agents
Bagdasarian, E., Yi, R., Ghalebikesabi, S., Kairouz, P., Gruteser, M., Oh, S., Balle, B., & Ramage, D. (2024) · Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3658644.3690350 · Cited by 28
“Other methods that protect data, like local differential privacy (DP) [23, 24, 33, 61], are not context-aware and therefore reduce the agent’s utility by always introducing noise on user data [17, 22, 32].”
Self-citationDifferentially-Private "Draw and Discard" Machine Learning
Pihur, V., Korolova, A., Liu, F., Sankuratripati, S., Yung, M., Huang, D., & Zeng, R. (2018) · arXiv · doi:10.48550/arxiv.1807.04369 · Cited by 25
Differential Privacy Defenses and Sampling Attacks for Membership Inference
Rahimian, S., Orekondy, T., & Fritz, M. (2021) · Proceedings of the 14th ACM Workshop on Artificial Intelligence and Security · doi:10.1145/3474369.3486876 · Cited by 24
“It offers flexible techniques which can be applied locally on the data [17, 31], or during the training on training parameters such as gradients [1] or the objective function [44] or it can be applied on the output of the function [24, 33].”
MethodThe power of the hybrid model for mean estimation
Avent, B., Dubey, Y., & Korolova, A. (2020) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2020-0062 · Cited by 9
Minimax Rates of Estimating Approximate Differential Privacy
Liu, X., & Oh, S. (2019) · arXiv · doi:10.48550/arxiv.1905.10335 · Cited by 4
Generating Fair Universal Representations using Adversarial Models
Kairouz, P., Liao, J., Huang, C., Vyas, M., Welfert, M., & Sankar, L. (2019) · arXiv · doi:10.48550/arxiv.1910.00411 · Cited by 19
Self-citation
Metadata
- Authors
- KairouzPeter, OhSewoong, & ViswanathPramod
- Venue
- Journal of Machine Learning Research
- Publisher
- The MIT Press
- Published
- 2016-01-01
- ISSN
- 1532-4435 (ISSN-L)
- DOI
- 10.5555/2946645.2946662
- OpenAlex
- W3009468551
- Cited by
- 92
- References
- 4
- FWCI
- 3.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.