{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:56Z","timestamp":1766281016198,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031092336"},{"type":"electronic","value":"9783031092343"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09234-3_25","type":"book-chapter","created":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T07:23:45Z","timestamp":1655450625000},"page":"501-520","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Spreading the\u00a0Privacy Blanket:"],"prefix":"10.1007","author":[{"given":"Dov","family":"Gordon","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Mingyu","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Jiayu","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,18]]},"reference":[{"key":"25_CR1","unstructured":"Ando, M., Lysyanskaya, A., Upfal, E.: Practical and provably secure onion routing. In: ICALP 2018, volume 107 of LIPIcs, pp. 144:1\u2013144:14. Schloss Dagstuhl, July 2018"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Backes, M., Goldberg, I., Kate, A., Mohammadi, E.: Provably secure and practical onion routing. In: 25th IEEE Computer Security Foundations Symposium (CSF), pp. 369\u2013385 (2012)","DOI":"10.1109\/CSF.2012.32"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Manoharan, P., Meiser, S., Mohammadi, E.: AnoA: a framework for analyzing anonymous communication protocols. In: 26th IEEE Computer Security Foundations Symposium (CSF), pp. 163\u2013178 (2013)","DOI":"10.1109\/CSF.2013.18"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-030-26951-7_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"B Balle","year":"2019","unstructured":"Balle, B., Bell, J., Gasc\u00f3n, A., Nissim, K.: The privacy blanket of the shuffle model. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 638\u2013667. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_22"},{"key":"25_CR5","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. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 451\u2013468. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_25"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Bell, J.H., Bonawitz, K.A., Gasc\u00f3n, A., Lepoint, T., Raykova, M.: Secure single-server aggregation with (poly)logarithmic overhead. In: ACM CCS, pp. 1253\u20131269. ACM Press (2020)","DOI":"10.1145\/3372297.3417885"},{"key":"25_CR7","unstructured":"Bellet, A., Guerraoui, R., Hendrikx, H.: Who started this rumor? Quantifying the natural differential privacy guarantees of gossip protocols. In 34th International Symposium on Distributed Computing (DISC), volume 179 of LIPIcs, pp. 8:1\u20138:18 (2020)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Bittau, A., et al.: Prochlo: strong privacy for analytics in the crowd. In: Proceedings 26th Symposium on Operating Systems Principles (SOSP), pp. 441\u2013459 (2017)","DOI":"10.1145\/3132747.3132769"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-36594-2_21","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2013","unstructured":"Boyle, E., Goldwasser, S., Tessaro, S.: Communication locality in secure multi-party computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 356\u2013376. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_21"},{"key":"25_CR10","unstructured":"B\u00fcnz, B., Hu, Y., Matsuo, S., Shi, E.: Non-interactive differentially anonymous router (2021). Available at https:\/\/eprint.iacr.org\/2021\/1242"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11535218_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J Camenisch","year":"2005","unstructured":"Camenisch, J., Lysyanskaya, A.: A formal treatment of onion routing. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 169\u2013187. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_11"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Hubert Chan, T.-H., Chung, K.-M., Maggs, B.M., Shi, E.: Foundations of differentially oblivious algorithms. In: 30th SODA, pp. 2448\u20132467. ACM-SIAM (2019)","DOI":"10.1137\/1.9781611975482.150"},{"key":"25_CR13","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"},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Comm. ACM 24(2), 84\u201388 (1981)","journal-title":"Comm. ACM"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"25_CR16","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., 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":"25_CR17","doi-asserted-by":"crossref","unstructured":"Dani, V., King, V., Movahedi, M., Saia, J.: Brief announcement: breaking the $$O(nm)$$ bit barrier, secure multiparty computation with a static adversary. In: 31st ACM PODC, pp. 227\u2013228. ACM (2012)","DOI":"10.1145\/2332432.2332473"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Das, D., Meiser, S., Mohammadi, E., Kate, A.: Anonymity trilemma: strong anonymity, low bandwidth overhead, low latency - choose two. In 2018 IEEE Symposium on Security and Privacy, pp. 108\u2013126. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00011"},{"key":"25_CR19","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.: 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":"25_CR20","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Johnson, A., Syverson, P.F.: Probabilistic analysis of onion routing in a black-box model. ACM Trans. Inf. Syst. Secur. 15(3), 14:1\u201314:28 (2012)","DOI":"10.1145\/2382448.2382452"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-61996-8_37","volume-title":"Information Hiding","author":"DM Goldschlag","year":"1996","unstructured":"Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Hiding routing information. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 137\u2013150. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61996-8_37"},{"issue":"3","key":"25_CR22","doi-asserted-by":"publisher","first-page":"6","DOI":"10.2478\/popets-2019-0034","volume":"2019","author":"A Groce","year":"2019","unstructured":"Groce, A., Rindal, P., Rosulek, M.: Cheaper private set intersection via differentially private leakage. Proc. Priv. Enhancing Technol. (PETS) 2019(3), 6\u201325 (2019)","journal-title":"Proc. Priv. Enhancing Technol. (PETS)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"He, X., Machanavajjhala, A., Flynn, C.J., Srivastava, D.: Composing differential privacy and secure computation: a case study on scaling private record linkage. In: ACM CCS 2017, pp. 1389\u20131406. ACM Press (2017)","DOI":"10.1145\/3133956.3134030"},{"key":"25_CR24","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS 2012. The Internet Society, February 2012"},{"key":"25_CR25","unstructured":"Kuhn, C., Beck, M., Schiffner, S., Jorswieck, E.A., Strufe, T.: On privacy notions in anonymous communication (2018). Available at https:\/\/arxiv.org\/abs\/1812.05638"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Kuhn, C., Beck, M., Strufe, T.: Breaking and (partially) fixing provably secure onion routing. In: 2020 IEEE Symposium on Security and Privacy, pp. 168\u2013185. IEEE Computer Society Press (2020)","DOI":"10.1109\/SP40000.2020.00039"},{"key":"25_CR27","unstructured":"Lazar, D., Gilad, Y., Zeldovich, N.: Karaoke: distributed private messaging immune to passive traffic analysis. In: Proceedings 13th USENIX Conference on Operating Systems Design and Implementation, pp. 711\u2013725. USENIX Association (2018)"},{"key":"25_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-30108-0_7","volume-title":"Computer Security \u2013 ESORICS 2004","author":"S Mauw","year":"2004","unstructured":"Mauw, S., Verschuren, J.H.S., de Vink, E.P.: A formalization of anonymity and onion routing. In: Samarati, P., Ryan, P., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol. 3193, pp. 109\u2013124. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30108-0_7"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Mazloom, S., Dov Gordon, S.: Secure computation with differentially private access patterns. In: ACM CCS 2018, pp. 490\u2013507. ACM Press (2018)","DOI":"10.1145\/3243734.3243851"},{"key":"25_CR30","unstructured":"Mazloom, S., Le, P.H., Ranellucci, S., Dov Gordon, S.: Secure parallel computation on national scale volumes of data. In: USENIX Security 2020, pp. 2487\u20132504. USENIX Association (2020)"},{"key":"25_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-319-25258-2_32","volume-title":"Structural Information and Communication Complexity","author":"M Movahedi","year":"2015","unstructured":"Movahedi, M., Saia, J., Zamani, M.: Secure multi-party shuffling. In: Scheideler, C. (ed.) SIROCCO 2014. LNCS, vol. 9439, pp. 459\u2013473. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25258-2_32"},{"key":"25_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-35199-1_17","volume-title":"Cryptography and Coding","author":"NP Smart","year":"2019","unstructured":"Smart, N.P., Talibi Alaoui, Y.: Distributing any elliptic curve based protocol. In: Albrecht, M. (ed.) IMACC 2019. LNCS, vol. 11929, pp. 342\u2013366. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35199-1_17"},{"key":"25_CR33","doi-asserted-by":"crossref","unstructured":"Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: 1997 IEEE Symposium on Security and Privacy, pp. 44\u201354. IEEE Computer Society Press (1997)","DOI":"10.1109\/SECPRI.1997.601314"},{"key":"25_CR34","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Gilad, Y., Leung, D., Zaharia, M., Zeldovich, N.: Stadium: a distributed metadata-private messaging system. In: Proceedings 26th Symposium on Operating Systems Principles (SOSP), pp. 423\u2013440. ACM Press (2017)","DOI":"10.1145\/3132747.3132783"},{"key":"25_CR35","doi-asserted-by":"crossref","unstructured":"van den Hooff, J., Lazar, D., Zaharia, M., Zeldovich, N.: Vuvuzela: scalable private messaging resistant to traffic analysis. In: Proceedings 25th Symposium on Operating Systems Principles (SOSP), pp. 137\u2013152. ACM Press (2015)","DOI":"10.1145\/2815400.2815417"},{"key":"25_CR36","doi-asserted-by":"crossref","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: SODA 2019, pp. 2468\u20132479 (2019)","DOI":"10.1137\/1.9781611975482.151"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09234-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T03:11:58Z","timestamp":1727406718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09234-3_25"}},"subtitle":["Differentially Oblivious Shuffling for Differential Privacy"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031092336","9783031092343"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09234-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/acns2022\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","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":"44","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":"5","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":"24% - 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.7","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":"5","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)"}},{"value":"For the Workshops, 52 papers were submitted, from which 31 were accepted. Additionally they include 5 posters.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}