{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:36:09Z","timestamp":1743021369126,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780103"},{"type":"electronic","value":"9783031780110"}],"license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-78011-0_16","type":"book-chapter","created":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T19:25:51Z","timestamp":1733081151000},"page":"476-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bruisable Onions: Anonymous Communication in\u00a0the\u00a0Asynchronous Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4639-9163","authenticated-orcid":false,"given":"Megumi","family":"Ando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3567-3550","authenticated-orcid":false,"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9321-9460","authenticated-orcid":false,"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Ando, M., Christ, M., Lysyanskaya, A., Malkin, T.: Poly Onions: Achieving Anonymity in the Presence of Churn. In: Kiltz, E., Vaikuntanathan, V. (eds.) Theory of Cryptography. TCC 2022. LNCS, vol. 13748. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_25","DOI":"10.1007\/978-3-031-22365-5_25"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-030-90456-2_7","volume-title":"Theory of Cryptography","author":"M Ando","year":"2021","unstructured":"Ando, M., Lysyanskaya, A.: Cryptographic shallots: a formal treatment of repliable onion encryption. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 188\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_7"},{"key":"16_CR3","unstructured":"Ando, M., Lysyanskaya, A., Upfal, E.: Practical and provably secure onion routing. In: ICALP 2018, LIPIcs, vol. 107. Schloss Dagstuhl (July 2018)"},{"key":"16_CR4","unstructured":"Ando, M., Lysyanskaya, A., Upfal, E.: On the complexity of anonymous communication through public networks. In: ITC 2021. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (July 2021)"},{"key":"16_CR5","unstructured":"Attarian, R., Mohammadi, E., Wang, T., Beni, E.H.: MixFlow: assessing mixnets anonymity with contrastive architectures and semantic network information. Cryptology ePrint Archive, Report 2023\/199 (2023)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-27809-2_26","volume-title":"Financial Cryptography","author":"R Berman","year":"2004","unstructured":"Berman, R., Fiat, A., Ta-Shma, A.: Provable unlinkability against traffic analysis. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 266\u2013280. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27809-2_26"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Manoharan, P., Meiser, S., Mohammadi, E.: AnoA: a framework for analyzing anonymous communication protocols. In: CSF 2013 Computer Security Foundations Symposium. IEEE Computer Society Press (2013)","DOI":"10.1109\/CSF.2013.18"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An asynchronous [(n-1)\/3]-resilient consensus protocol. In: PODC (1984)","DOI":"10.1145\/800222.806743"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS. IEEE Computer Society Press (October 2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Boneh, D., Mazi\u00e8res, D.: Riposte: an anonymous messaging system handling millions of users. In: 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press (May 2015)","DOI":"10.1109\/SP.2015.27"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"issue":"1","key":"16_CR12","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":"16_CR13","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":"16_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: 25th ACM STOC. ACM Press (May 1993)","DOI":"10.1145\/167088.167105"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"R Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13\u201325. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055717"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_29"},{"key":"16_CR17","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. IEEE Computer Society Press (May 2018)","DOI":"10.1109\/SP.2018.00011"},{"key":"16_CR18","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":"16_CR19","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: the second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium, 9-13 August 2004, San Diego, CA, USA (2004)","DOI":"10.21236\/ADA465464"},{"key":"16_CR20","unstructured":"Iwanik, J., Klonowski, M., Kuty\u0142owski, M.: Duo-onions and hydra-onions-failure and adversary resistant onion protocols. Springer, In Communications and Multimedia Security (2005)"},{"issue":"2","key":"16_CR21","doi-asserted-by":"publisher","first-page":"105","DOI":"10.2478\/popets-2019-0022","volume":"2019","author":"C Kuhn","year":"2019","unstructured":"Kuhn, C., Beck, M., Schiffner, S., Jorswieck, E.A., Strufe, T.: On privacy notions in anonymous communication. Proc. Priv. Enhancing Technol. 2019(2), 105\u2013125 (2019)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"16_CR22","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. IEEE Computer Society Press (May 2020)","DOI":"10.1109\/SP40000.2020.00039"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Kwon, A., Corrigan-Gibbs, H., Devadas, S., Ford, B.: Atom: horizontally scaling strong anonymity. In: Proceedings of the 26th Symposium on Operating Systems Principles, 28-31 October 2017, Shanghai, China. ACM (2017)","DOI":"10.1145\/3132747.3132755"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-030-92075-3_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"C Kuhn","year":"2021","unstructured":"Kuhn, C., Hofheinz, D., Rupp, A., Strufe, T.: Onion routing with\u00a0replies. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13091, pp. 573\u2013604. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_20"},{"key":"16_CR25","unstructured":"Lynch, N.A.: Distributed algorithms. Elsevier (1996)"},{"key":"16_CR26","unstructured":"Murdoch, S.J., Danezis, G.: Low-cost traffic analysis of tor. In: 2005 IEEE Symposium on Security and Privacy. IEEE Computer Society Press (May 2005)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Mironov","year":"2009","unstructured":"Mironov, I., Pandey, O., Reingold, O., Vadhan, S.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126\u2013142. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_8"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511813603"},{"key":"16_CR29","unstructured":"Piotrowska, A.M., Hayes, J., Elahi, T., Meiser, S., Danezis, G.: The loopix anonymity system. In: USENIX Security 2017. USENIX Association (August 2017)"},{"key":"16_CR30","unstructured":"Ropek, L.: Someone is running hundreds of malicious servers on the Tor network and might be de-anonymizing users (December 2021). https:\/\/tinyurl.com\/2p999e8e"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Rackoff, C., Simon, D.R.: Cryptographic defense against traffic analysis. In: 25th ACM STOC. ACM Press (May 1993)","DOI":"10.1145\/167088.167260"},{"key":"16_CR32","unstructured":"Sun, Y., et al.: RAPTOR: routing attacks on privacy in Tor. In: USENIX Security Symposium (2015)"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Gilad, Y., Leung, D., Zaharia, M., Zeldovich, N.: Stadium: a distributed metadata-private messaging system. In: SOSP 2017. ACM (Oct 2017)","DOI":"10.1145\/3132747.3132783"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"van\u00a0den Hooff, J., Lazar, D., Zaharia, M., Zeldovich, N.: Vuvuzela: scalable private messaging resistant to traffic analysis. In: SOSP 2015. ACM (Oct 2015)","DOI":"10.1145\/2815400.2815417"},{"issue":"3","key":"16_CR35","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1515\/popets-2018-0019","volume":"2018","author":"R Wails","year":"2018","unstructured":"Wails, R., Sun, Y., Johnson, A., Chiang, M., Mittal, P.: Tempest: temporal dynamics in anonymity systems. PoPETs 2018(3), 22\u201342 (2018)","journal-title":"PoPETs"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78011-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T20:03:05Z","timestamp":1733083385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78011-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"ISBN":["9783031780103","9783031780110"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78011-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}