{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:41:51Z","timestamp":1769316111036,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030453879","type":"print"},{"value":"9783030453886","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45388-6_8","type":"book-chapter","created":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T23:05:47Z","timestamp":1588115147000},"page":"215-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Topology-Hiding Computation for Networks with Unknown Delays"],"prefix":"10.1007","author":[{"given":"Rio","family":"LaVigne","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0349-3838","authenticated-orcid":false,"given":"Chen-Da","family":"Liu-Zhang","sequence":"additional","affiliation":[]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Moran","sequence":"additional","affiliation":[]},{"given":"Marta","family":"Mularczyk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6188-1049","authenticated-orcid":false,"given":"Daniel","family":"Tschudi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,29]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-319-63688-7_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"Adi Akavia","year":"2017","unstructured":"Akavia, Adi, LaVigne, Rio, Moran, Tal: Topology-Hiding Computation on All Graphs. In: Katz, Jonathan, Shacham, Hovav (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 447\u2013467. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_15"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-319-56617-7_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"Adi Akavia","year":"2017","unstructured":"Akavia, Adi, Moran, Tal: Topology-Hiding Computation Beyond Logarithmic Diameter. In: Coron, Jean-S\u00e9bastien, Nielsen, Jesper Buus (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 609\u2013637. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_21"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-45682-1_33","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"Mihir Bellare","year":"2001","unstructured":"Bellare, Mihir, Boldyreva, Alexandra, Desai, Anand, Pointcheval, David: Key-Privacy in Public-Key Encryption. In: Boyd, Colin (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 566\u2013582. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_33"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Marshall Ball, Elette Boyle, Tal Malkin, and Tal Moran. Exploring the boundaries of topology-hiding computation. In Eurocrypt\u201918, 2018","DOI":"10.1007\/978-3-319-78372-7_10"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or, Ran Canetti, and Oded Goldreich. Asynchronous secure computation. In 25th ACM STOC, pages 52\u201361. ACM Press, May 1993","DOI":"10.1145\/167088.167109"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd FOCS, pages 136\u2013145. IEEE Computer Society Press, October 2001","DOI":"10.1109\/SFCS.2001.959888"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-53015-3_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Ran Cohen","year":"2016","unstructured":"Cohen, Ran, Coretti, Sandro, Garay, Juan, Zikas, Vassilis: Probabilistic Termination and Composability of Cryptographic Protocols. In: Robshaw, Matthew, Katz, Jonathan (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 240\u2013269. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_9"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Nishanth Chandran, Vipul Goyal, and Amit Sahai. New constructions for uc secure computation using tamper-proof hardware. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 545\u2013562. Springer, 2008","DOI":"10.1007\/978-3-540-78967-3_31"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Seung Geol Choi, Jonathan Katz, Dominique Schr\u00f6der, Arkady Yerukhimovich, and Hong-Sheng Zhou. (efficient) universally composable oblivious transfer using a minimal number of stateless tokens. In Theory of Cryptography Conference, pages 638\u2013662. Springer, 2014","DOI":"10.1007\/978-3-642-54242-8_27"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally composable two-party and multi-party secure computation. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 494\u2013503. ACM, 2002","DOI":"10.1145\/509907.509980"},{"key":"8_CR11","first-page":"310","volume":"10","author":"Alessandro Chiesa","year":"2010","unstructured":"Chiesa, Alessandro, Tromer, Eran: Proof-carrying data and hearsay arguments from signature cards. ICS 10, 310\u2013331 (2010)","journal-title":"ICS"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"Ivan Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, Ivan, Ishai, Yuval: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In: Shoup, Victor (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 378\u2013394. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_23"},{"key":"8_CR13","first-page":"257","volume":"2","author":"M Fleury","year":"1883","unstructured":"Fleury, M.: Deux probl\u00e8mes de g\u00e9om\u00e9trie de situation. Journal de math\u00e9matiques \u00e9l\u00e9mentaires 2, 257\u2013261 (1883)","journal-title":"Journal de math\u00e9matiques \u00e9l\u00e9mentaires"},{"key":"8_CR14","unstructured":"H Fleischner. X. 1 algorithms for eulerian trails. Eulerian Graphs and Related Topics: Part 1 (Annals of Discrete Mathematics), 2(50):1\u201313, 1991"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, and Akshay Wadia. Founding cryptography on tamper-proof hardware tokens. In Theory of Cryptography Conference, pages 308\u2013326. Springer, 2010","DOI":"10.1007\/978-3-642-11799-2_19"},{"issue":"2\u20133","key":"8_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2007.04.031","volume":"384","author":"Markus Hinkelmann","year":"2007","unstructured":"Hinkelmann, Markus, Jakoby, Andreas: Communications in unknown networks: Preserving the secret of topology. Theoretical Computer Science 384(2\u20133), 184\u2013200 (2007)","journal-title":"Theoretical Computer Science"},{"key":"8_CR17","unstructured":"Dennis Hofheinz, J\u00f6rn M\u00fcller-Quade, and Dominique Unruh. Universally composable zero-knowledge arguments and commitments from signature cards. In 5th Central European Conference on Cryptology, 2005"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-662-53008-5_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Martin Hirt","year":"2016","unstructured":"Hirt, Martin, Maurer, Ueli, Tschudi, Daniel, Zikas, Vassilis: Network-Hiding Communication and Applications to Multi-party Protocols. In: Robshaw, Matthew, Katz, Jonathan (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 335\u2013365. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_12"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"Theory of Cryptography","author":"Jonathan Katz","year":"2013","unstructured":"Katz, Jonathan, Maurer, Ueli, Tackmann, Bj\u00f6rn, Zikas, Vassilis: Universally Composable Synchronous Computation. In: Sahai, Amit (ed.) TCC 2013. LNCS, vol. 7785, pp. 477\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Rio Lavigne, Chen-Da Liu-Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, and Daniel Tschudi. Topology-hiding computation beyond semi-honest adversaries. In Theory of Cryptography Conference, to appear, 2018","DOI":"10.1007\/978-3-030-03810-6_1"},{"key":"8_CR21","unstructured":"Rio LaVigne, Chen-Da Liu-Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, and Daniel Tschudi. Topology-hiding computation for networks with unknown delays. Cryptology ePrint Archive, Report 2019\/1211, 2019. https:\/\/eprint.iacr.org\/2019\/1211"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-662-48000-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Yehuda Lindell","year":"2015","unstructured":"Lindell, Yehuda, Pinkas, Benny, Smart, Nigel P., Yanai, Avishay: Efficient Constant Round Multi-party Computation Combining BMR and SPDZ. In: Gennaro, Rosario, Robshaw, Matthew (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 319\u2013338. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_16"},{"key":"8_CR23","unstructured":"SAM Makki. A distributed algorithm for constructing an eulerian tour. In Performance, Computing, and Communications Conference, 1997. IPCCC 1997, IEEE International, pages 94\u2013100. IEEE, 1997"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-662-46494-6_8","volume-title":"Theory of Cryptography","author":"Tal Moran","year":"2015","unstructured":"Moran, Tal, Orlov, Ilan, Richelson, Silas: Topology-Hiding Computation. In: Dodis, Yevgeniy, Nielsen, Jesper Buus (eds.) TCC 2015. LNCS, vol. 9014, pp. 159\u2013181. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_8"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45388-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T00:05:11Z","timestamp":1682726711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45388-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030453879","9783030453886"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45388-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2020\/","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 Web Review System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"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":"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-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":"15","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"}]}}