{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:34:42Z","timestamp":1767339282364,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030904555"},{"type":"electronic","value":"9783030904562"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-90456-2_7","type":"book-chapter","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T12:02:37Z","timestamp":1636027357000},"page":"188-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Cryptographic Shallots: A Formal Treatment of Repliable Onion Encryption"],"prefix":"10.1007","author":[{"given":"Megumi","family":"Ando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"7_CR1","unstructured":"Ando, M., Lysyanskaya, A.: Cryptographic shallots: a formal treatment of repliable onion encryption. Cryptology ePrint Archive, Report 2020\/215 (2020). https:\/\/eprint.iacr.org\/2020\/215"},{"key":"7_CR2","unstructured":"Ando, M., Lysyanskaya, A., Upfal, E.: Practical and provably secure onion routing. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) ICALP 2018, volume 107 of LIPIcs, pp. 144:1\u2013144:14. Schloss Dagstuhl (July 2018)"},{"key":"7_CR3","unstructured":"Ando, M., Lysyanskaya, A., Upfal, E.: On the complexity of anonymous communication through public networks. In: 2nd Conference on Information-Theoretic Cryptography, ITC 2021. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"7_CR4","unstructured":"Boneh, D., Shoup, V.: A graduate course in applied cryptography. Draft 0.2 (2015)"},{"key":"7_CR5","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":"7_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (October 2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-48000-7_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"R Canetti","year":"2015","unstructured":"Canetti, R., Cohen, A., Lindell, Y.: A simpler variant of universally composable security for standard multiparty computation. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 3\u201322. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_1"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: 28th ACM STOC, pp. 639\u2013648. ACM Press (May 1996)","DOI":"10.1145\/237814.238015"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-662-49387-8_11","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"R Canetti","year":"2016","unstructured":"Canetti, R., Shahaf, D., Vald, M.: Universally composable authentication and key-exchange with global PKI. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9615, pp. 265\u2013296. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_11"},{"issue":"2","key":"7_CR10","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"},{"key":"7_CR11","unstructured":"Cottrell, L.: Mixmaster and remailer attacks (1995)"},{"key":"7_CR12","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":"7_CR13","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":"7_CR14","doi-asserted-by":"crossref","unstructured":"Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: design of a type III anonymous remailer protocol. In: 2003 IEEE Symposium on Security and Privacy, pp. 2\u201315. IEEE Computer Society Press (May 2003)","DOI":"10.1109\/SECPRI.2003.1199323"},{"key":"7_CR15","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, pp. 269\u2013282. IEEE Computer Society Press (May 2009)","DOI":"10.1109\/SP.2009.15"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Danezis, G., Laurie, B.: Minx: a simple and efficient anonymous packet format. In: Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, pp. 59\u201365 (2004)","DOI":"10.1145\/1029179.1029198"},{"key":"7_CR17","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, San Diego, CA, USA, 9\u201313 August 2004, pp. 303\u2013320 (2004)","DOI":"10.21236\/ADA465464"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Gulcu, C., Tsudik, G.: Mixing e-mail with Babel. In: Proceedings of Internet Society Symposium on Network and Distributed Systems Security, pp. 2\u201316. IEEE (1996)","DOI":"10.1109\/NDSS.1996.492350"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Johnson, A., Wacek, C., Jansen, R., Sherr, M., Syverson, P.F.: Users get routed: traffic correlation on tor by realistic adversaries. In: Sadeghi, A.-R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 337\u2013348. ACM Press (November 2013)","DOI":"10.1145\/2508859.2516651"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman and Hall\/CRC (2014)","DOI":"10.1201\/b17668"},{"key":"7_CR21","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 (May 2020)","DOI":"10.1109\/SP40000.2020.00039"},{"key":"7_CR22","unstructured":"M\u00f6ller, U., Cottrell, L.: Mixmaster protocol\u2013v2. unfinished draft (January 2000)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Parekh, S.: Prospects for remailers. First Monday 1(2) (1996)","DOI":"10.5210\/fm.v1i2.476"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Sun, Y., Edmundson, A., Feamster, N., Chiang, M., Mittal, P.: Counter-RAPTOR: safeguarding tor against active routing attacks. In: 2017 IEEE Symposium on Security and Privacy, pp. 977\u2013992. IEEE Computer Society Press (May 2017)","DOI":"10.1109\/SP.2017.34"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Wails, R., Sun, Y., Johnson, A., Chiang, M., Mittal, P.: Tempest: temporal dynamics in anonymity systems. PoPETs 2018(3), 22\u201342 (2018)","DOI":"10.1515\/popets-2018-0019"}],"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-030-90456-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T01:19:44Z","timestamp":1730683184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90456-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030904555","9783030904562"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90456-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","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":"Raleigh, NC","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2021\/","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":"Websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","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":"66","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":"41% - 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":"4","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":"16","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)"}}]}}