{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:47Z","timestamp":1766278967132,"version":"3.48.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031223648"},{"type":"electronic","value":"9783031223655"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22365-5_25","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"715-746","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Poly Onions: Achieving Anonymity in the Presence of Churn"],"prefix":"10.1007","author":[{"given":"Megumi","family":"Ando","sequence":"first","affiliation":[]},{"given":"Miranda","family":"Christ","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"25_CR1","unstructured":"Tor directory protocol, version 3. http:\/\/gittweb.torproject.org\/torspec.git\/plain\/dir-spec.txt"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Ando, M., Lysyanskaya, A.: Cryptographic shallots: A formal treatment of repliable onion encryption. In: TCC (2021)","DOI":"10.1007\/978-3-030-90456-2_7"},{"key":"25_CR3","unstructured":"Ando, M., Lysyanskaya, A., Upfal, E.: Practical and provably secure onion routing. In: ICALP (2018)"},{"key":"25_CR4","unstructured":"Ando, M., Lysyanskaya, A., Upfal, E.: On the complexity of anonymous communication through public networks. In: ITC (2021)"},{"key":"25_CR5","unstructured":"Augustine, J., Pandurangan, G., Robinson, P., Roche, S.T., Upfal, E.: Enabling robust and efficient distributed computation in dynamic peer-to-peer networks. In: 56th FOCS"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Backes, M., Goldberg, I., Kate, A., Mohammadi, E.: Provably secure and practical onion routing. In: 2012 IEEE 25th Computer Security Foundations Symposium","DOI":"10.1109\/CSF.2012.32"},{"key":"25_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: 2013 IEEE 26th Computer Security Foundations Symposium","DOI":"10.1109\/CSF.2013.18"},{"key":"25_CR8","unstructured":"Blaze, M., Ioannidis, J., Angelos, D., Keromytis, T.M., Rubin, A.D.: Anonymity in wireless broadcast networks, IJ Network Security (2009)"},{"key":"25_CR9","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_CR10","doi-asserted-by":"crossref","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. In: Communications of the ACM (1981)","DOI":"10.1145\/358549.358563"},{"key":"25_CR11","unstructured":"Chen, C., Asoni, D.E., Barrera, D., Danezis, G., Perrig, A.: High-speed onion routing at the network layer. In: ACM CCS, HORNET (2015)"},{"key":"25_CR12","unstructured":"Christ, M.: New lower bounds on the complexity of provably anonymous onion routing. Undergraduate honors thesis, Brown University (2020)"},{"key":"25_CR13","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":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"R Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45\u201364. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_4"},{"key":"25_CR15","unstructured":"Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a type III anonymous remailer protocol. In: 2003 IEEE Symposium on Security and Privacy"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Danezis, G., Goldberg, I.: Sphinx: A compact and provably secure mix format. In: 2009 IEEE Symposium on Security and Privacy","DOI":"10.1109\/SP.2009.15"},{"key":"25_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","DOI":"10.1109\/SP.2018.00011"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Das, D., Meiser, S., Mohammadi, E., Kate, A.: Comprehensive anonymity trilemma: User coordination is not enough. In: Proceedings on Privacy Enhancing Technologies (2020)","DOI":"10.2478\/popets-2020-0056"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: the second-generation onion router. In: USENIX Security Symposium (2004)","DOI":"10.21236\/ADA465464"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Falkner, J., Piatek, M., John, J.P., Krishnamurthy, A., Anderson, T.: Profiling a million user dht. In: IMC 2007","DOI":"10.1145\/1298306.1298325"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Dov Gordon, S., Katz, J., Liang, M., Xu, J.: Spreading the privacy blanket: - differentially oblivious shuffling for differential privacy. In: ACNS 2022","DOI":"10.1007\/978-3-031-09234-3_25"},{"key":"25_CR22","unstructured":"Iwanik, J., Klonowski, M., Kuty\u0142owski, M.: Duo-onions and hydra-onions-failure and adversary resistant onion protocols. In: Communications and Multimedia Security 2005"},{"key":"25_CR23","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","DOI":"10.1109\/SP40000.2020.00039"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Kuhn, C., Hofheinz, D., Rupp, A., Strufe, T.: Onion routing with replies. In: ASISACRYPT 2021","DOI":"10.1007\/978-3-030-92075-3_20"},{"key":"25_CR25","unstructured":"Kwon, A., Corrigan-Gibbs, H., Devadas, S., Ford, B.: Atom: Horizontally scaling strong anonymity. In: 26th ACM SOSP"},{"key":"25_CR26","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge University Press"},{"key":"25_CR27","unstructured":"Murdoch, S.J., Danezis, G.: Low-cost traffic analysis of tor. In: 2005 IEEE Symposium on Security and Privacy"},{"key":"25_CR28","unstructured":"Rackoff, C., Simon, D.R.: Cryptographic defense against traffic analysis. In: 25th ACM STOC"},{"key":"25_CR29","unstructured":"Ropek, L.: Someone is running hundreds of malicious servers on the Tor network and might be de-anonymizing users. https:\/\/tinyurl.com\/2p999e8e"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Stutzbach, D., Rejaie, R.: Understanding churn in peer-to-peer networks. In: IMC 2006","DOI":"10.1145\/1177080.1177105"},{"key":"25_CR31","unstructured":"Sun, Y., et al.: Routing Attacks on Privacy in Tor. In: USENIX Security Symposium, RAPTOR (2015)"},{"key":"25_CR32","unstructured":"Tyagi, N., Gilad, Y., Leung, D., Zaharia, M., Zeldovich, N.: A distributed metadata-private messaging system. In: Symposium on Operating Systems Principles, Stadium (2017)"},{"key":"25_CR33","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 of the 25th Symposium on Operating Systems Principles 2015","DOI":"10.1145\/2815400.2815417"}],"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-22365-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:08Z","timestamp":1766278928000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22365-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223648","9783031223655"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22365-5_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":"21 December 2022","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":"Chicago, IL","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 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":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"139","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":"60","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":"43% - 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.1","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":"9.9","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}