{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T16:43:58Z","timestamp":1783788238552,"version":"3.55.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030269500","type":"print"},{"value":"9783030269517","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26951-7_22","type":"book-chapter","created":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T23:02:47Z","timestamp":1565305367000},"page":"638-667","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":137,"title":["The Privacy Blanket of the Shuffle Model"],"prefix":"10.1007","author":[{"given":"Borja","family":"Balle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Bell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adri\u00e0","family":"Gasc\u00f3n","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"22_CR1","unstructured":"Balle, B., Barthe, G., Gaboardi, M.: Privacy amplification by subsampling: tight analyses via couplings and divergences. In: Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, Montr\u00e9al, Canada, 3\u20138 December 2018, pp. 6280\u20136290 (2018)"},{"key":"22_CR2","unstructured":"Balle, B., Bell, J., Gasc\u00f3n, A., Nissim, K.: The privacy blanket of the shuffle model. CoRR abs\/1903.02837 (2019). http:\/\/arxiv.org\/abs\/1903.02837"},{"key":"22_CR3","unstructured":"Balle, B., Wang, Y.X.: Improving the Gaussian mechanism for differential privacy: analytical calibration and optimal denoising. In: Proceedings of the 35th International Conference on Machine Learning, ICML (2018)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Barthe, G., Gaboardi, M., Gr\u00e9goire, B., Hsu, J., Strub, P.: Proving differential privacy via probabilistic couplings. In: Symposium on Logic in Computer Science (LICS), pp. 749\u2013758 (2016)","DOI":"10.1145\/2933575.2934554"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Barthe, G., K\u00f6pf, B., Olmedo, F., B\u00e9guelin, S.Z.: Probabilistic relational reasoning for differential privacy. In: Symposium on Principles of Programming Languages (POPL), pp. 97\u2013110 (2012)","DOI":"10.1145\/2103621.2103670"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-39212-2_8","volume-title":"Automata, Languages, and Programming","author":"G Barthe","year":"2013","unstructured":"Barthe, G., Olmedo, F.: Beyond differential privacy: composition theorems and relational logic for f-divergences between probabilistic programs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 49\u201360. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_8"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-85174-5_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A Beimel","year":"2008","unstructured":"Beimel, A., Nissim, K., Omri, E.: Distributed private data analysis: simultaneously solving how and what. In: Wagner, D.A. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 451\u2013468. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_25"},{"key":"22_CR8","unstructured":"Bhowmick, A., Duchi, J., Freudiger, J., Kapoor, G., Rogers, R.: Protection against reconstruction and its applications in private federated learning. arXiv e-prints arXiv:1812.00984, December 2018"},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Bittau, A., et al.: PROCHLO: strong privacy for analytics in the crowd. In: Proceedings of the 26th Symposium on Operating Systems Principles, Shanghai, China, 28\u201331 October 2017, pp. 441\u2013459. ACM (2017). https:\/\/doi.org\/10.1145\/3132747.3132769","DOI":"10.1145\/3132747.3132769"},{"key":"22_CR10","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","author":"S Boucheron","year":"2013","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press, Oxford (2013)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-33090-2_25","volume-title":"Algorithms \u2013 ESA 2012","author":"T-HH Chan","year":"2012","unstructured":"Chan, T.-H.H., Shi, E., Song, D.: Optimal lower bound for differentially private multi-party aggregation. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 277\u2013288. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_25"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-030-17653-2_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Cheu","year":"2019","unstructured":"Cheu, A., Smith, A.D., Ullman, J., Zeber, D., Zhilyaev, M.: Distributed differential privacy via shuffling. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 375\u2013403. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_13"},{"key":"22_CR13","unstructured":"Ding, B., Kulkarni, J., Yekhanin, S.: Collecting telemetry data privately. In: Guyon, I., et al. (eds.) Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, Long Beach, CA, USA, 4\u20139 December 2017, pp. 3574\u20133583 (2017). http:\/\/papers.nips.cc\/paper\/6948-collecting-telemetry-data-privately"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.D.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"2468","DOI":"10.1137\/1.9781611975482.151","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"\u00dalfar Erlingsson","year":"2019","unstructured":"Erlingsson, \u00da., Feldman, V., Mironov, I., Raghunathan, A., Talwar, K., Thakurta, A.: Amplification by shuffling: from local to central differential privacy via anonymity. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2468\u20132479. SIAM (2019)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Erlingsson, \u00da., Pihur, V., Korolova, A.: RAPPOR: randomized aggregatable privacy-preserving ordinal response. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA, 3\u20137 November 2014, pp. 1054\u20131067 (2014)","DOI":"10.1145\/2660267.2660348"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Feldman, V., Mironov, I., Talwar, K., Thakurta, A.: Privacy amplification by iteration. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 521\u2013532 (2018)","DOI":"10.1109\/FOCS.2018.00056"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography from anonymity. In: FOCS, pp. 239\u2013248. IEEE Computer Society (2006)","DOI":"10.1109\/FOCS.2006.25"},{"key":"22_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790423","volume-title":"Probability Theory: The Logic of Science","author":"ET Jaynes","year":"2003","unstructured":"Jaynes, E.T.: Probability Theory: The Logic of Science. Cambridge University Press, Cambridge (2003)"},{"key":"22_CR20","unstructured":"Joseph, M., Mao, J., Neel, S., Roth, A.: The role of interactivity in local differential privacy. CoRR abs\/1904.03564 (2019), http:\/\/arxiv.org\/abs\/1904.03564"},{"key":"22_CR21","unstructured":"Kairouz, P., Bonawitz, K., Ramage, D.: Discrete distribution estimation under local privacy. In: ICML, JMLR Workshop and Conference Proceedings, vol. 48, pp. 2436\u20132444 (2016). JMLR.org"},{"key":"22_CR22","first-page":"17:1","volume":"17","author":"P Kairouz","year":"2016","unstructured":"Kairouz, P., Oh, S., Viswanath, P.: Extremal mechanisms for local differential privacy. J. Mach. Learn. Res. 17, 17:1\u201317:51 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"22_CR23","doi-asserted-by":"publisher","unstructured":"Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.D.: What can we learn privately? In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, Philadelphia, PA, USA, 25\u201328 October 2008, pp. 531\u2013540. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/FOCS.2008.27","DOI":"10.1109\/FOCS.2008.27"},{"key":"22_CR24","volume-title":"Lectures on the Coupling Method","author":"T Lindvall","year":"2002","unstructured":"Lindvall, T.: Lectures on the Coupling Method. Courier Corporation, Chelmsford (2002)"},{"key":"22_CR25","unstructured":"Team, A.D.P.: Learning with privacy at scale. Apple Mach. Learn. J. 1(9) (2017)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26951-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:27:29Z","timestamp":1710347249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26951-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030269500","9783030269517"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26951-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"IACR websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"378","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}