The DOI matches its Crossref record; 43 of the 50 references it cites were found in a registry or an index.
Prochlo: Strong Privacy for Analytics in the Crowd
Open accessAbstract
The large-scale monitoring of computer users' software activities has become commonplace, e.g., for application telemetry, error reporting, or demographic profiling. This paper describes a principled systems architecture---Encode, Shuffle, Analyze (ESA)---for performing such monitoring with high utility while also protecting user privacy. The ESA design, and its Prochlo implementation, are informed by our practical experiences with an existing, large deployment of privacy-preserving software monitoring.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Hamer et al. [219] proposed a communication-efficient federated algorithm for learning mixture weights on an ensemble of pre-trained models, based on communicating only a subset of the models to any one device;”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [219]
Experimental — accuracy not yet measured
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“First, recall the basic idea behind Shamir secret sharing [68]: t-secret sharing splits a secret s in a field F into arbitrary shares s1, s2, .”
BackgroundCalibrating 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
Deep Learning with Differential Privacy
Abadi, M., Chu, A., Goodfellow, I., McMahan, H. B., Mironov, I., Talwar, K., & Zhang, L. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978318 · Cited by 6,578 · cited 2×
“These settings are at least as strong as in recent industrial deployments and in literature [4, 28, 70].”
BackgroundSelf-citationThe Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000042 · Cited by 5,557 · cited 5×
“The analyzer, which has the most complete view of the reported data, may choose from a wide variety of differentially private mechanisms and data processing systems [27,31,38, 53, 63].”
BackgroundMethodInfluentialDouceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Practical Secure Aggregation for Privacy-Preserving Machine Learning
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133982 · Cited by 3,956 · cited 1×
“Other cryptography-based privacy-protection systems, such as PDDP, Prio, and Secure Aggregation [11, 15, 18], mostly share ESA’s goals but differ greatly in their approach.”
BackgroundL -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617 · cited 3×
“iduals [65,66]. However, since k-anonymity does not limit statistical inferences drawn indirectly, from subgroup intersections or differences, it cannot offer mathematically-strong privacy guarantees [32,48]. In the last decade, the definitions of differential privacy have become the accepted standard for strong privac…”
BackgroundMethodInfluentialSorting networks and their applications
Batcher, K. E. (1968) · doi:10.1145/1468075.1468121 · Cited by 2,442 · cited 1×
“Batcher’s sort is one such algorithm [8].”
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372 · cited 1×
“Famously, Narayanan and Shmatikov [54] managed to deanonymize users in the challenge’s large corpus of training data by exploiting auxiliary data and the linkability of users’ movie preferences.”
BackgroundProtecting respondents identities in microdata release
Samarati, P. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.971193 · Cited by 2,339 · cited 1×
“For example, the well-known property of k-anonymity prevents direct release of information about subgroups with fewer than k individuals [65, 66].”
Background
Flagged first, then by citations
7 of the 50 references couldn’t be matched to a known paper.
Research works printed but not linked: 34
- Abadi , M. , Barham , P. , Chen , J. , Chen , Z. , Davis , A. , Dean , J. , Devin , M. , Ghemawat , S. , Irving , G. , Isard , M. , Kudlur , M. , Levenberg , J. , Monga , R. , Moore , S. , Murray , D. G. , Steiner , B. , Tucker , P. , Vasudevan , V. , Warden , P. , Wicke , M. , Yu , Y. , and Zheng , X . Tensorflow: A system for large-scale machine learning . In Proc. of 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI) ( 2016 ), pp. 265 -- 283 . Abadi, M., Barham, P., Chen, J., Chen, Z., Davis, A., Dean, J., Devin, M., Ghemawat, S., Irving, G., Isard, M., Kudlur, M., Levenberg, J., Monga, R., Moore, S., Murray, D. G., Steiner, B., Tucker, P., Vasudevan, V., Warden, P., Wicke, M., Yu, Y., and Zheng, X. Tensorflow: A system for large-scale machine learning. In Proc. of 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI) (2016), pp. 265--283.
- Abadi , M. , Boneh , D. , Mironov , I. , Raghunathan , A. , and Segev , G . Message-Locked Encryption for Lock-Dependent Messages. In Advances in Cryptology--CRYPTO ( 2013 ), pp. 374 -- 391 . Abadi, M., Boneh, D., Mironov, I., Raghunathan, A., and Segev, G. Message-Locked Encryption for Lock-Dependent Messages. In Advances in Cryptology--CRYPTO (2013), pp. 374--391.
- Abadi , M. , Erlingsson , Ú., Goodfellow , I. , McMahan , H. B. , Papernot , N. , Mironov , I. , Talwar , K. , and Zhang , L . On the Protection of Private Information in Machine Learning Systems: Two Recent Approaches. In Proc. of IEEE 30th Computer Security Foundations Symposium (CSF) ( 2017 ), pp. 1 -- 6 . Abadi, M., Erlingsson, Ú., Goodfellow, I., McMahan, H. B., Papernot, N., Mironov, I., Talwar, K., and Zhang, L. On the Protection of Private Information in Machine Learning Systems: Two Recent Approaches. In Proc. of IEEE 30th Computer Security Foundations Symposium (CSF) (2017), pp. 1--6.
- Avent , B. , Korolova , A. , Zeber , D. , Hovden , T. , and Livshits , B . BLENDER: Enabling Local Search with a Hybrid Differential Privacy Model . In Proc. of the 26th USENIX Security Symposium ( 2017 ), pp. 747 -- 764 . Avent, B., Korolova, A., Zeber, D., Hovden, T., and Livshits, B. BLENDER: Enabling Local Search with a Hybrid Differential Privacy Model. In Proc. of the 26th USENIX Security Symposium (2017), pp. 747--764.
- Bassily , R. , Nissim , K. , Stemmer , U. , and Thakurta , A . Practical Locally Private Heavy Hitters. CoRR abs/1707.0498 ( 2017 ). http://arxiv.org/abs/1707.04982. Bassily, R., Nissim, K., Stemmer, U., and Thakurta, A. Practical Locally Private Heavy Hitters. CoRR abs/1707.0498 (2017). http://arxiv.org/abs/1707.04982. · arXiv
- Bellare , M. , Keelveedhi , S. , and Ristenpart , T . Message-Locked Encryption and Secure Deduplication. In Advances in Cryptology---EUROCRYPT ( 2013 ), pp. 296 -- 312 . Bellare, M., Keelveedhi, S., and Ristenpart, T. Message-Locked Encryption and Secure Deduplication. In Advances in Cryptology---EUROCRYPT (2013), pp. 296--312.
- Bulck , J. V. , Weichbrodt , N. , Kapitza , R. , Piessens , F. , and Strackx , R . Telling Your Secrets without Page Faults: Stealthy Page Table-Based Attacks on Enclaved Execution . In Proc. of 26th USENIX Security Symposium ( 2017 ), pp. 1041 -- 1056 . Bulck, J. V., Weichbrodt, N., Kapitza, R., Piessens, F., and Strackx, R. Telling Your Secrets without Page Faults: Stealthy Page Table-Based Attacks on Enclaved Execution. In Proc. of 26th USENIX Security Symposium (2017), pp. 1041--1056.
- Buse , R. P. L. , and Zimmermann , T . Information Needs for Software Development Analytics. In Proc. of the 34th International Conference on Software Engineering (ICSE) ( 2012 ), pp. 987 -- 996 . Buse, R. P. L., and Zimmermann, T. Information Needs for Software Development Analytics. In Proc. of the 34th International Conference on Software Engineering (ICSE) (2012), pp. 987--996.
- Chen , R. , Reznichenko , A. , Francis , P. , and Gehrke , J . Towards Statistical Queries over Distributed Private User Data . In Proc. of the 9th USENIX Conference on Networked Systems Design and Implementation (NSDI) ( 2012 ), pp. 169 -- 182 . Chen, R., Reznichenko, A., Francis, P., and Gehrke, J. Towards Statistical Queries over Distributed Private User Data. In Proc. of the 9th USENIX Conference on Networked Systems Design and Implementation (NSDI) (2012), pp. 169--182.
- Chromium Projects . RAPPOR (Randomized Aggregatable Privacy Preserving Ordinal Responses). https://www.chromium.org/developers/design-documents/rappor , 2017 . Chromium Projects. RAPPOR (Randomized Aggregatable Privacy Preserving Ordinal Responses). https://www.chromium.org/developers/design-documents/rappor, 2017.
- Corrigan-Gibbs , H. , and Boneh , D . Prio: Private, Robust, and Scalable Computation of Aggregate Statistics . In Proc. of the 14th USENIX Symposium on Networked Systems Design and Implementation (NDSI) ( 2017 ), pp. 259 -- 282 . Corrigan-Gibbs, H., and Boneh, D. Prio: Private, Robust, and Scalable Computation of Aggregate Statistics. In Proc. of the 14th USENIX Symposium on Networked Systems Design and Implementation (NDSI) (2017), pp. 259--282.
- Dang , H. , Dinh , T. T. A. , Chang , E.-C. , and Ooi , B. C. Privacy-Preserving Computation with Trusted Computing via Scramble-then-Compute. Proceedings on Privacy Enhancing Technologies , 3 ( 2017 ), 18 -- 35 . Dang, H., Dinh, T. T. A., Chang, E.-C., and Ooi, B. C. Privacy-Preserving Computation with Trusted Computing via Scramble-then-Compute. Proceedings on Privacy Enhancing Technologies, 3 (2017), 18--35.
- Denning , D. E. R. Cryptography and Data Security . Addison-Wesley , Boston, MA, USA , 1982 . Denning, D. E. R. Cryptography and Data Security. Addison-Wesley, Boston, MA, USA, 1982.
- Dinh , T. T. A. , Saxena , P. , Chang , E.-C. , Ooi , B. C. , and Zhang , C . M2R: Enabling Stronger Privacy in MapReduce Computation . In Proc. of the 24th USENIX Security Symposium ( 2015 ), pp. 447 -- 462 . Dinh, T. T. A., Saxena, P., Chang, E.-C., Ooi, B. C., and Zhang, C. M2R: Enabling Stronger Privacy in MapReduce Computation. In Proc. of the 24th USENIX Security Symposium (2015), pp. 447--462.
- 10.5555/646334.687813 · DOI
- Dwork , C. Differential Privacy: A Survey of Results. In International Conference on Theory and Applications of Models of Computation (TAMC) ( 2008 ), pp. 1 -- 19 . Dwork, C. Differential Privacy: A Survey of Results. In International Conference on Theory and Applications of Models of Computation (TAMC) (2008), pp. 1--19.
- Gaboardi , M. , Honaker , J. , King , G. , Nissim , K. , Ullman , J. , and Vadhan , S. P . PSI (Ψ): A Private data Sharing Interface. CoRR abs/1609.04340 ( 2016 ). http://arxiv.org/abs/1609.04340. Gaboardi, M., Honaker, J., King, G., Nissim, K., Ullman, J., and Vadhan, S. P. PSI (Ψ): A Private data Sharing Interface. CoRR abs/1609.04340 (2016). http://arxiv.org/abs/1609.04340. · arXiv
- Intel® Software Guard Extensions Programming Reference. https://software.intel.com/sites/default/files/managed/48/88/329298-002.pdf , Oct. 2014 . Intel® Software Guard Extensions Programming Reference. https://software.intel.com/sites/default/files/managed/48/88/329298-002.pdf, Oct. 2014.
- Intel® Software Guard Extensions (Intel® SGX) SDK . https://software.intel.com/en-us/sgx-sdk , 2017 . Intel® Software Guard Extensions (Intel® SGX) SDK. https://software.intel.com/en-us/sgx-sdk, 2017.
- Johnson , N. , Near , J. P. , and Song , D . Towards Practical Differential Privacy for SQL Queries. CoRR abs/1706.09479 ( 2017 ). https://arxiv.org/abs/1706.09479. Johnson, N., Near, J. P., and Song, D. Towards Practical Differential Privacy for SQL Queries. CoRR abs/1706.09479 (2017). https://arxiv.org/abs/1706.09479. · arXiv
- Lee , S. , Shih , M.-W. , Gera , P. , Kim , T. , Kim , H. , and Peinado , M . Inferring Fine-grained Control Flow Inside SGX Enclaves with Branch Shadowing. In Proc. of the 26th USENIX Security Symposium ( 2017 ), pp. 557 -- 574 . Lee, S., Shih, M.-W., Gera, P., Kim, T., Kim, H., and Peinado, M. Inferring Fine-grained Control Flow Inside SGX Enclaves with Branch Shadowing. In Proc. of the 26th USENIX Security Symposium (2017), pp. 557--574.
- Maniatis , P. , and Baker , M . Secure History Preservation Through Timeline Entanglement. In Proc. of the 11th USENIX Security Symposium ( 2002 ), pp. 297 -- 312 . Maniatis, P., and Baker, M. Secure History Preservation Through Timeline Entanglement. In Proc. of the 11th USENIX Security Symposium (2002), pp. 297--312.
- Maniatis , P. , Mironov , I. , and Talwar , K . Oblivious Stash Shuffle. CoRR abs/1709.07553 ( 2017 ). https://arxiv.org/abs/1709.07553. Maniatis, P., Mironov, I., and Talwar, K. Oblivious Stash Shuffle. CoRR abs/1709.07553 (2017). https://arxiv.org/abs/1709.07553. · arXiv
- Ohrimenko , O. , Goodrich , M. T. , Tamassia , R. , and Upfal , E . The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. In Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014 , Part II ( 2014 ), pp. 556 -- 567 . Ohrimenko, O., Goodrich, M. T., Tamassia, R., and Upfal, E. The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. In Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Part II (2014), pp. 556--567.
- Ravindranath , L. , Padhye , J. , Agarwal , S. , Mahajan , R. , Obermiller , I. , and Shayandeh , S . AppInsight: Mobile App Performance Monitoring in the Wild. In Proc. of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI) ( 2012 ), pp. 107 -- 120 . Ravindranath, L., Padhye, J., Agarwal, S., Mahajan, R., Obermiller, I., and Shayandeh, S. AppInsight: Mobile App Performance Monitoring in the Wild. In Proc. of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI) (2012), pp. 107--120.
- Roy , I. , Setty , S. T. V. , Kilzer , A. , Shmatikov , V. , and Witchel , E . Airavat: Security and Privacy for MapReduce. In Proc. of the 7th USENIX Symposium on Networked Systems Design and Implementation (NSDI) ( 2010 ), pp. 297 -- 312 . Roy, I., Setty, S. T. V., Kilzer, A., Shmatikov, V., and Witchel, E. Airavat: Security and Privacy for MapReduce. In Proc. of the 7th USENIX Symposium on Networked Systems Design and Implementation (NSDI) (2010), pp. 297--312.
- Saltzer , J. H. , and Schroeder , M. D. The Protection of Information in Computer Systems. Proc. of the IEEE 63 , 9 ( 1975 ), 1278--1308. Saltzer, J. H., and Schroeder, M. D. The Protection of Information in Computer Systems. Proc. of the IEEE 63, 9 (1975), 1278--1308.
- Tang , J. , Korolova , A. , Bai , X. , Wang , X. , and Wang , X . Privacy Loss in Apple's Implementation of Differential Privacy on macOS 10.12. arXiv:1709.02753 ( 2017 ). https://arxiv.org/abs/1709.02753. Tang, J., Korolova, A., Bai, X., Wang, X., and Wang, X. Privacy Loss in Apple's Implementation of Differential Privacy on macOS 10.12. arXiv:1709.02753 (2017). https://arxiv.org/abs/1709.02753. · arXiv
- Vallina-Rodriguez , N. , Sundaresan , S. , Razaghpanah , A. , Nithyanand , R. , Allman , M. , Kreibich , C. , and Gill , P . Tracking the Trackers: Towards Understanding the Mobile Advertising and Tracking Ecosystem. CoRR abs/1609.07190 ( 2016 ). http://arxiv.org/abs/1609.07190. Vallina-Rodriguez, N., Sundaresan, S., Razaghpanah, A., Nithyanand, R., Allman, M., Kreibich, C., and Gill, P. Tracking the Trackers: Towards Understanding the Mobile Advertising and Tracking Ecosystem. CoRR abs/1609.07190 (2016). http://arxiv.org/abs/1609.07190. · arXiv
- Viega , J. , Chandra , P. , and Messier , M . Network Security with OpenSSL , 1 st ed. O'Reilly & Associates, Inc. , Sebastopol, CA, USA , 2002 . Viega, J., Chandra, P., and Messier, M. Network Security with OpenSSL, 1st ed. O'Reilly & Associates, Inc., Sebastopol, CA, USA, 2002.
- Wang , T. , Blocki , J. , Li , N. , and Jha , S . Locally Differentially Private Protocols for Frequency Estimation. In Proc. of the 26th USENIX Security Symposium ( 2017 ), pp. 729 -- 745 . Wang, T., Blocki, J., Li, N., and Jha, S. Locally Differentially Private Protocols for Frequency Estimation. In Proc. of the 26th USENIX Security Symposium (2017), pp. 729--745.
- Warner , S. L. Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias. J. of the American Statistical Association 60 , 309 ( 1965 ), 63--69. Warner, S. L. Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias. J. of the American Statistical Association 60, 309 (1965), 63--69.
- 10.5555/2555692.2555725 · DOI
- Zheng , W. , Dave , A. , Beekman , J. G. , Popa , R. A. , Gonzalez , J. E. , and Stoica , I . Opaque: An Oblivious and Encrypted Distributed Analytics Platform. In Proc. of the 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI) ( 2017 ), pp. 283 -- 298 . Zheng, W., Dave, A., Beekman, J. G., Popa, R. A., Gonzalez, J. E., and Stoica, I. Opaque: An Oblivious and Encrypted Distributed Analytics Platform. In Proc. of the 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI) (2017), pp. 283--298.
Cited by
Sorted by citations
Items 101–200 of 368
Survey on Federated Learning Towards Privacy Preserving AI
Kurupathi, S. R., & Maaß, W. (2020) · doi:10.5121/csit.2020.101120 · Cited by 20
“Secure shufflers have been studied in the context of secure multi-party computation [81, 82] and also in trusted computing [83].”
BackgroundUnderstanding Unintended Memorization in Federated LearningPreprint
Thakkar, O. D., Ramaswamy, S., Mathews, R., & Beaufays, F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.07490 · Cited by 19
On Distributed Differential Privacy and Counting Distinct ElementsPreprint
Chen, L., Ghazi, B., Kumar, R., & Manurangsi, P. (2020) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2021.56 · Cited by 18
“We briefly review the shuffle model of DP [8, 24, 12].”
BackgroundMethodBeck, G., Len, J., Miers, I., & Green, M. (2021) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3460120.3484545 · Cited by 17
Löbner, S., Tronnier, F., Pape, S., & Rannenberg, K. (2021) · ACM Computer Science in Cars Symposium (CSCS) · doi:10.1145/3488904.3493380 · Cited by 17
ObliDB: Oblivious Query Processing for Secure DatabasesPreprint
Eskandarian, S., & Zaharia, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.00458 · Cited by 47
Fast Fully Oblivious Compaction and Shuffling
Sasy, S., Johnson, A., & Goldberg, I. (2022) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3548606.3560603 · Cited by 19
Exponential Separations in Local Differential Privacy
Joseph, M., Mao, J., & Roth, A. (2019) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975994.31 · Cited by 16
“Differential privacy’s mathematical and practical appeal has driven the creation of a large body of work (see Dwork and Roth [16] and Vadhan [27] for surveys) and increasing industrial and governmental adoption [1, 3, 6, 13, 18].”
BackgroundSecure Sublinear Time Differentially Private Median Computation
Böhler, J., & Kerschbaum, F. (2020) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2020.24150 · Cited by 16
Layer-wise Characterization of Latent Information Leakage in Federated LearningPreprint
Mo, F., Borovykh, A., Malekzadeh, M., Haddadi, H., & Demetriou, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.08762 · Cited by 31
Davidson, A., Snyder, P., Quirk, E. B., Genereux, J., Livshits, B., & Haddadi, H. (2022) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3548606.3560631 · Cited by 15
Liu, Y., Zhao, S., Xiong, L., Liu, Y., & Chen, H. (2023) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v37i10.26400 · Cited by 17
Integrating Differential Privacy and Contextual Integrity
Benthall, S., & Cummings, R. (2024) · ACM Symposium on Computer Science and Law (CSLAW) · doi:10.1145/3614407.3643702 · Cited by 15
“The shuffle model [Bittau et al. 2017] can be viewed an intermediate model, where users apply DP locally to their own data, and a cryptographically secure “shuffler” permutes all users’ data.”
BackgroundDordis: Efficient Federated Learning with Dropout-Resilient Differential Privacy
Jiang, Z., Wang, W., & Chen, R. (2024) · European Conference on Computer Systems · doi:10.1145/3627703.3629559 · Cited by 21
DeTA: Minimizing Data Leaks in Federated Learning via Decentralized and Trustworthy Aggregation
Cheng, P.-C., Eykholt, K., Gu, Z., Jamjoom, H. T., Jayaram, K. R., Valdez, E., & Verma, A. (2024) · European Conference on Computer Systems · doi:10.1145/3627703.3650082 · Cited by 16
Unknown Worker Recruitment With Long-Term Incentive in Mobile Crowdsensing
Zhou, Q., Zhang, X., & Yang, Z. (2024) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2024.3471569 · Cited by 14
Distributed Differential Privacy via Shuffling Versus Aggregation: A Curious Study
Wei, Y. X., Jia, J., Wu, Y., Hu, C., Dong, C., Liu, Z., Chen, X., Peng, Y., & Wang, S. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3351474 · Cited by 18
“This motivated the recent research of distributed DP with enhanced utility [5], [6], [7].”
BackgroundMethodInfluentialGroup Oblivious Message Retrieval
Liu, Z., Tromer, E., & Wang, Y. (2024) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp54263.2024.00115 · Cited by 14
Hierarchical Federated Learning with Privacy
Chandrasekaran, V., Banerjee, S., Perino, D., & Kourtellis, N. (2024) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata62323.2024.10826023 · Cited by 14
Orchard: Differentially Private Analytics at Scale
Roth, E., Zhang, H., Haeberlen, A., & Pierce, B. C. (2020) · Operating Systems Design and Implementation · Cited by 14
Distributed Differential Privacy via Mixnets.Preprint
Cheu, A., Smith, A., Ullman, J., Zeber, D., & Zhilyaev, M. (2018) · arXiv (Cornell University) · Cited by 14
Making Machine Learning Forget
Shintre, S., Roundy, K. A., & Dhaliwal, J. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-21752-5_6 · Cited by 13
“Due to such strict privacy control, local differential privacy tends to severely limit the utility provided by the dataset, and truly massive collections of data may be required to perform even simple analysis, such as frequent itemset mining [5].”
BackgroundPrivacy Amplification via Shuffling: Unified, Simplified, and Tightened
Wang, S., Peng, Y., Li, J., Wen, Z. A., Li, Z., Yu, S., Wang, D., & Yang, W. (2024) · Proceedings of the VLDB Endowment · doi:10.14778/3659437.3659444 · Cited by 14
Triangle Counting With Local Edge Differential Privacy
Eden, T., Liu, Q. C., Raskhodnikova, S., & Smith, A. (2025) · Random Structures and Algorithms · doi:10.1002/rsa.70002 · Cited by 13
An Algorithmic Framework For Differentially Private Data Analysis on Trusted ProcessorsPreprint
Allen, J., Ding, B., Kulkarni, J., Nori, H., Ohrimenko, O., & Yekhanin, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.00736 · Cited by 13
Lossless Compression of Efficient Private Local RandomizersPreprint
Feldman, V., & Talwar, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.12099 · Cited by 13
Scott, M., Cormode, G., & Maple, C. R. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3147643 · Cited by 12
Privacy Enhancement Via Dummy Points in the Shuffle Model
Li, X., Liu, W., Feng, H., Huang, K., Hu, Y., Liu, J., Ren, K., & Qin, Z. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2023.3263162 · Cited by 12
On the Round Complexity of the Shuffle Model
Beimel, A., Haitner, I., Kobbi Nissim, B., & Stemmer, U. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64378-2_24 · Cited by 12
“The shuffle collects messages from the participating parties and presents them to the analyzer in a random order, hence potentially disassociating between messages and their senders [11, 20, 15].”
BackgroundNon-Interactive Anonymous Router
Shi, E., & Wu, K. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77883-5_17 · Cited by 12
Network Shuffling: Privacy Amplification via Random Walks
Liew, S. P., Takahashi, T., Takagi, S., Kato, F., Cao, Y., & Yoshikawa, M. (2022) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3514221.3526162 · Cited by 12
“More recently, the shuffle model [7] has attracted attention.”
BackgroundInfluentialPrivate Convex Optimization via Exponential Mechanism
Gopi, S., Lee, Y. T., & Liu, D. (2024) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.869 · Cited by 12
The limits of pan privacy and shuffle privacy for learning and estimation
Cheu, A., & Ullman, J. (2021) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3406325.3450995 · Cited by 12
“These works were both inspired by Google’s prochlo system [9], which implements a more general algorithmic paradigm called encode, shuffle, and analyze.”
BackgroundMethodInfluentialImproved Summation from ShufflingPreprint
Balle, B., Bell, J., Gascón, A., & Kobbi Nissim, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.11225 · Cited by 12
On the Sample Complexity of Privately Learning Unbounded High-Dimensional GaussiansPreprint
Aden-Ali, I., Ashtiani, H., & Kamath, G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.09929 · Cited by 12
Differentially Private Numerical Vector Analyses in the Local and Shuffle Model
Wang, S., Yu, S., Ren, X., Li, J., Li, Y., Yang, W., Yan, H., & Li, J. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2023.3340178 · Cited by 11
AdaSTopk: Adaptive federated shuffle model based on differential privacy
Yang, Q., Du, X., Liu, A., Wang, N., Wang, W., & Wu, X. (2023) · Information Sciences · doi:10.1016/j.ins.2023.119186 · Cited by 11
ARA: Aggregated RAPPOR and Analysis for Centralized Differential Privacy
Paul, S., & Mishra, S. (2019) · SN Computer Science · doi:10.1007/s42979-019-0023-y · Cited by 11
Differentially Oblivious Data Analysis With Intel SGX: Design, Optimization, and Evaluation
Wu, P., Li, Q. L., Ning, J., Huang, X., & Wu, W. (2021) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3106317 · Cited by 11
ObliDB: Oblivious Query Processing using Hardware EnclavesPreprint
Eskandarian, S., & Zaharia, M. (2017) · arXiv (Cornell University) · Cited by 11
Locally Private k-Means in One RoundPreprint
Chang, A., Ghazi, B., Kumar, R., & Manurangsi, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.09734 · Cited by 14
Differentially Private Multi-Armed Bandits in the Shuffle ModelPreprint
Tenenbaum, J., Kaplan, H. Y., Mansour, Y., & Stemmer, U. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.02900 · Cited by 11
Covariance-Aware Private Mean Estimation Without Private Covariance EstimationPreprint
Brown, G., Gaboardi, M., Smith, A., Ullman, J., & Zakynthinou, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.13329 · Cited by 12
Differential Privacy Configurations in the Real World: A Comparative Analysis
Khavkin, M., & Toch, E. (2025) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2025.3603731 · Cited by 11
Multi-Message Shuffled Privacy in Federated Learning
Girgis, A. M., & Diggavi, S. N. (2024) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2024.3366225 · Cited by 11
Unifying Privacy Measures via Maximal (α, β)-Leakage (MαbeL)
Gilani, A., Kurri, G. R., Kosut, O., & Sankar, L. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3384922 · Cited by 10
Samplable Anonymous Aggregation for Private Federated Data Analysis
Talwar, K., Wang, S., McMillan, A., Feldman, V., Bansal, P., Basile, B., Cahill, Á., Chan, Y. S., Chatzidakis, M., Chen, J., et al. (2024) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3658644.3690224 · Cited by 21
Humphries, T., Mahdavi, R. A., Veitch, S., & Kerschbaum, F. (2022) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3548606.3560559 · Cited by 10
Simple Binary Hypothesis Testing Under Local Differential Privacy and Communication Constraints
Pensia, A., Asadi, A. R., Jog, V., & Loh, P. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3461361 · Cited by 10
Privacy-Preserving Boosting in the Local Setting
Wang, S., & Chang, J. M. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3097822 · Cited by 10
“Lately, a Encode, Shuffle, Analysis (ESA) system architecture [42] is proposed to support a wide range of analysis tasks privately and is used in the software monitoring implementation.”
BackgroundDPGen: Automated Program Synthesis for Differential Privacy
Wang, Y., Ding, Z., Xiao, Y., Kifer, D., & Zhang, D. (2021) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3460120.3484781 · Cited by 10
“It has been increasingly adopted in industry [14, 19, 25, 34, 45] and the public sector [1, 15, 32, 37].”
BackgroundFree gap information from the differentially private sparse vector and noisy max mechanisms
Ding, Z., Wang, Y., Zhang, D., & Kifer, D. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3368289.3368295 · Cited by 10
Privacy-Preserving BanditsPreprint
Malekzadeh, M., Athanasakis, D., Haddadi, H., & Livshits, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.04421 · Cited by 12
“Techniques for privacy-preserving data analysis such as the Encode-Shuffle-Analyze (ESA) scheme implemented in PROCHLO (Bittau et al., 2017; Erlingsson et al., 2020) promise to safeguard user’s privacy, while preserving the quality of resulting recommendations, through a combination of cryptographic, trusted hardware,…”
BackgroundMethodInfluentialShuffle Private Stochastic Convex OptimizationPreprint
Cheu, A., Joseph, M., Mao, J., & Peng, B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.09805 · Cited by 10
“The shuffle model (Bittau et al., 2017; Cheu et al., 2019; Erlingsson et al., 2019) does not require users to trust the operator of A.”
BackgroundMethodThe 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
“However, it is well understood theoretically and empirically that utility outcomes are far worse in the LM than in the TCM [11, 16, 22, 27, 38].”
BackgroundComputationally Secure Aggregation and Private Information Retrieval in the Shuffle Model
Gascón, A., Ishai, Y., Kelkar, M., Li, B., Ma, Y., & Raykova, M. (2024) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3658644.3670391 · Cited by 9
Local Differential Privacy for Sampling
Husain, H., Balle, B., Cranko, Z., & Nock, R. (2020) · International Conference on Artificial Intelligence and Statistics · Cited by 9
Collecting and analyzing key-value data under shuffled differential privacy
Wang, N., Zheng, W., Wang, Z., Wei, Z., Gu, Y., Tang, P., & Yu, G. (2022) · Frontiers of Computer Science · doi:10.1007/s11704-022-1572-0 · Cited by 9
Mazmudar, M., Humphries, T., Liu, J., Rafuse, M., & He, X. Q. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3574245.3574246 · Cited by 9
Locally Differentially Private Data Collection and AnalysisPreprint
Wang, T., Zhao, J., Yang, X., & Ren, X. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.01777 · Cited by 9
“Since the introduction of differential privacy (DP), a large number of DP-based mechanisms [27, 25, 57] have been proposed and applied to numerous scenarios, such as data statistics [54, 61, 11], learning models [1, 40, 59, 38], and systems [29, 6].”
BackgroundShredder: Learning Noise Distributions to Protect Inference PrivacyPreprint
Mireshghallah, F., Taram, M., Ramrakhyani, P., Tullsen, D. M., & Esmaeilzadeh, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.11814 · Cited by 9
“In a more practical model, called local differential privacy, the system does not require users to even trust the curator to inspect their data, even for the purpose of preserving privacy [65, 15, 66, 14].”
BackgroundSeparating Local & Shuffled Differential Privacy via HistogramsPreprint
Balcer, V., & Cheu, A. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.itc.2020.1 · Cited by 50
“Because the local and central models lie at the extremes of trust, recent work has focused on the intermediate shuffled model [6, 8].”
InfluentialAn Uncertainty Principle is a Price of Privacy-Preserving MicrodataPreprint
Abowd, J. M., Ashmead, R., Cumings-Menon, R., Garfinkel, S., Kifer, D., Leclerc, P., Sexton, W., Simpson, A. E., Task, C., & Викторович, Ж. П. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.13239 · Cited by 9
“Its state-of-the-art guarantees have resulted in adoption by data collectors such as the U.S. Census Bureau [31, 10, 23, 1], Google [19, 6], Apple [37], Microsoft [13], Uber [26], and Facebook [33].”
BackgroundPRECAD: Privacy-Preserving and Robust Federated Learning via Crypto-Aided Differential PrivacyPreprint
Gu, X., Li, M., & Xiong, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.11578 · Cited by 17
Angelopoulos, A. N., Bates, S., Zrnic, T., & Jordan, M. I. (2022) · Harvard Data Science Review · doi:10.1162/99608f92.16c71dad · Cited by 8
Frequency Estimation in the Shuffle Model with Almost a Single Message
Luo, Q., Wang, Y., & Yi, K. (2022) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3548606.3560608 · Cited by 8
Securely Sampling Discrete Gaussian Noise for Multi-Party Differential Privacy
Wei, C., Yu, R., Fan, Y., Chen, W., & Wang, T. (2023) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3576915.3616641 · Cited by 12
Precio: Private Aggregate Measurement via Oblivious Shuffling
Anderson, E., Chase, M., Durak, F. B., Laine, K., & Weng, C. (2024) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3658644.3670280 · Cited by 8
Waks-On/Waks-Off: Fast Oblivious Offline/Online Shuffling and Sorting with Waksman Networks
Sasy, S., Johnson, A., & Goldberg, I. (2023) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3576915.3623133 · Cited by 8
Private Analytics via Streaming, Sketching, and Silently Verifiable Proofs
Rathee, M., Zhang, Y., Corrigan-Gibbs, H., & Popa, R. A. (2024) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp54263.2024.00245 · Cited by 11
Privacy-preserving Data Mining in Industry
Kenthapadi, K., Mironov, I., & Thakurta, A. (2019) · International World Wide Web Conference (WWW) · doi:10.1145/3308560.3320085 · Cited by 8
Self-citationResearch Challenges in Designing Differentially Private Text Generation Mechanisms
Feyisetan, O., Aggarwal, A., Xu, Z., & Teissier, N. (2021) · Proceedings of the ... International Florida Artificial Intelligence Research Society Conference · doi:10.32473/flairs.v34i1.128461 · Cited by 8
“, sub-sampling, shuffling, k-aggregation have all been proposed in the literature (Li, Qardaji, and Su 2012; Bittau et al. 2017));”
BackgroundMethodInfluentialMasquerade: Verifiable Multi-Party Aggregation with Secure Multiplicative Commitments
Mouris, D., & Tsoutsos, N. G. (2024) · ACM Transactions on Internet Technology · doi:10.1145/3705315 · Cited by 8
Investigation and Application of Differential Privacy in Bitcoin
Khalilov, M. C. K., & Levi, A. W. (2022) · IEEE Access · doi:10.1109/access.2022.3151784 · Cited by 9
“utilized by Apple for collecting data from devices [12] and by Google for collecting data from Chrome web browsers [13].”
MethodZhao, J., Yang, M., Zhang, R., Song, W., Zheng, J., Feng, J., & Matwin, S. (2022) · Electronics · doi:10.3390/electronics11234007 · Cited by 10
Differential privacy in the shuffle model
Cheu, A. (2021) · doi:10.17760/d20409473 · Cited by 9
Differential Privacy in the Shuffle Model: A Survey of SeparationsPreprint
Cheu, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.11839 · Cited by 8
Top-k Shuffled Differential Privacy Federated Learning for Heterogeneous Data
Xiao, D., Fan, X., & Chen, L. (2025) · Sensors · doi:10.3390/s25051441 · Cited by 7
Verifiability for privacy-preserving computing on distributed data — a survey
Bontekoe, T., Karastoyanova, D., & Türkmen, F. (2025) · International Journal of Information Security · doi:10.1007/s10207-025-01047-7 · Cited by 17
Mukherjee, S., Walch, R., Meisingseth, F., Lex, E., & Rechberger, C. (2024) · IFIP advances in information and communication technology · doi:10.1007/978-3-031-65175-5_25 · Cited by 7
Distributed & Scalable Oblivious Sorting and Shuffling
Ngai, N., Demertzis, I., Chamani, J. G., & Papadopoulos, D. (2024) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp54263.2024.00153 · Cited by 7
Multiparty Reach and Frequency Histogram: Private, Secure, and Practical
Ghazi, B., Kreuter, B., Kumar, R., Manurangsi, P., Peng, J., Skvortsov, E., Wang, Y., & Wright, C. (2021) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2022-0019 · Cited by 7
Yin, K., Wu, B. Y., Zhu, R., Xiao, L. W., Tan, Z., He, G., Wang, Z., & Yin, G. (2022) · Journal of Computational Science · doi:10.1016/j.jocs.2022.101789 · Cited by 7
Fu, Y., Ye, Q., Du, R., & Hu, H. (2023) · ACM Transactions on Sensor Networks · doi:10.1145/3623637 · Cited by 7
Learning With Differential Privacy
Sengupta, P., Paul, S., & Mishra, S. (2020) · Advances in information security, privacy, and ethics book series · doi:10.4018/978-1-7998-5728-0.ch019 · Cited by 7
Desfontaines, D., & Pejó, B. (2020) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2020-0028 · Cited by 141
“Another option is the shuffled model [15], which falls in-between the local and global models.”
BackgroundA Central Limit Theorem for Differentially Private Query AnsweringPreprint
Dong, J., Su, W., & Zhang, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.08721 · Cited by 7
Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex LossesPreprint
Lowy, A. M., & Razaviyayn, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.09779 · Cited by 7
Rights for Those Who Unwillingly, Unknowingly and Unidentifiably Compute!Preprint
Veale, M. (2023) · doi:10.31235/osf.io/4ugxd · Cited by 7
Far, S. B., & Rad, A. I. (2024) · Data Science and Management · doi:10.1016/j.dsm.2024.03.001 · Cited by 8
Aziz, R., Banerjee, S., & Bouzefrane, S. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-60391-4_11 · Cited by 6
Snake-Eye Resistant PKE from LWE for Oblivious Message Retrieval and Robust Encryption
Liu, Z., Sotiraki, K., Tromer, E., & Wang, Y. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-91131-6_5 · Cited by 6
Jakkamsetti, S., Liu, Z., & Madathil, V. (2025) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf64896.2025.00035 · Cited by 6
Locally Private Streaming Data Release with Shuffling and Subsampling
Li, X., Cao, Y., & Yoshikawa, M. (2023) · IEEE International Conference on Data Engineering Workshops (ICDEW) · doi:10.1109/icdew58674.2023.00026 · Cited by 6
Analyzing the Shuffle Model Through the Lens of Quantitative Information Flow
Jurado, M., Gonze, R. G., Alvim, M. S., & Catuscia Palamidessi, A. (2023) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf57540.2023.00033 · Cited by 6
“[12] (see also [28] for a revised version of that work).”
BackgroundMethodEfficient Cloud-based Secret Shuffling via Homomorphic Encryption
Becher, K., & Strufe, T. (2020) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc50000.2020.9219588 · Cited by 6
“An architecture for privacy-preserving online analysis of client data based on trusted hardware is presented in [3].”
BackgroundBUDS: Balancing Utility and Differential Privacy by Shuffling
Sengupta, P., Paul, S., & Mishra, S. (2020) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt49239.2020.9225470 · Cited by 6
The Power of Synergy in Differential Privacy: Combining a Small Curator with Local RandomizersPreprint
Beimel, A., Korolova, A., Kobbi Nissim, B., Sheffet, O., & Stemmer, U. (2019) · arXiv (Cornell University) · doi:10.4230/lipics.itc.2020.14 · Cited by 6
“New models for di ff erentially private computation have recently emerged to alleviate the (inevitable) low accuracy of the local model, of which we will discuss the shu ffl e model [38, 14, 19, 6, 5, 32] and the hybrid model [2].”
MethodDP-Cryptography: Marrying Differential Privacy and Cryptography in Emerging ApplicationsPreprint
Wagh, S., He, X., Machanavajjhala, A., & Mittal, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.08887 · Cited by 6
“We will use one of these systems called Prochlo [8, 16] to illustrate the key idea of how anonymity can help improve the accuracy of such applications.”
BackgroundMethodInfluential
Metadata
- Authors
- Bittau, A., Erlingsson, Ú., Maniatis, P., Mironov, I., Raghunathan, A., Lie, D., Rudominer, M., Kode, U., Tinnes, J., & Seefeld, B.
- Affiliations
- Google (United States) (US)
- University of Toronto (CA)
- Venue
- Proceedings of the 26th Symposium on Operating Systems Principles
- Publisher
- ACM
- Published
- 2017-10-14
- Pages
- 441-459
- OpenAlex
- W2761138375
- Cited by
- 378
- References
- 50
- Citations by year
- 2026: 22 · 2025: 37 · 2024: 55 · 2023: 46 · 2022: 50 · 2021: 70 · 2020: 46 · 2019: 36 · 2018: 12 · 2017: 4
- FWCI
- 11.96
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM SIGOPS Symposium on Operating Systems Principles (SOSP) (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- TSpace (University of Toronto) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
- Social Sciences › Sociology and Political Science › Privacy, Security, and Data Protection
- Keywords
- user privacy, privacy-preserving monitoring, telemetry, error reporting, demographic profiling, system architecture
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