{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:19Z","timestamp":1778065099032,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319636870","type":"print"},{"value":"9783319636887","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63688-7_15","type":"book-chapter","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T01:19:44Z","timestamp":1501204784000},"page":"447-467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Topology-Hiding Computation on All Graphs"],"prefix":"10.1007","author":[{"given":"Adi","family":"Akavia","sequence":"first","affiliation":[]},{"given":"Rio","family":"LaVigne","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Moran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,29]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Moran, T.: Topology hiding computation beyond logarithmic diametere. In: Eurocrypt (2017, to appear)","DOI":"10.1007\/978-3-319-56617-7_21"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lov\u00e1sz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 29\u201331 October 1979, pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1214\/10-AAP718","volume":"21","author":"J Balogh","year":"2011","unstructured":"Balogh, J., Bollob\u00e1s, B., Krivelevich, M., M\u00fcller, T., Walters, M.: Hamilton cycles in random geometric graphs. Ann. Appl. Probab. 21(3), 1053\u20131072 (2011)","journal-title":"Ann. Appl. Probab."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-662-44381-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"A Beimel","year":"2014","unstructured":"Beimel, A., Gabizon, A., Ishai, Y., Kushilevitz, E., Meldgaard, S., Paskin-Cherniavsky, A.: Non-interactive secure multiparty computation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 387\u2013404. Springer, Heidelberg (2014). doi:\n                      10.1007\/978-3-662-44381-1_22"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R.: The electrical resistance of a graph captures its commute and cover times. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 574\u2013586. ACM, New York (1989)","DOI":"10.1145\/73007.73062"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Chandran, N., Chongchitmate, W., Garay, J.A., Goldwasser, S., Ostrovsky, R., Zikas, V.: The hidden graph model: communication locality and optimal resiliency with adaptive faults. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, pp. 153\u2013162. ACM, New York (2015)","DOI":"10.1145\/2688073.2688102"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Estrin, D., Govindan, R., Heidemann, J., Kumar, S.: Next century challenges: scalable coordination in sensor networks. In: Proceedings of the 5th Annual ACM\/IEEE International Conference on Mobile Computing and Networking, pp. 263\u2013270. ACM (1999)","DOI":"10.1145\/313451.313556"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00453-012-9710-y","volume":"67","author":"T Friedrich","year":"2013","unstructured":"Friedrich, T., Sauerwald, T., Stauffer, A.: Diameter and broadcast time of random geometric graphs in arbitrary dimensions. Algorithmica 67(1), 65\u201388 (2013)","journal-title":"Algorithmica"},{"key":"15_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, New York (2004)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. ACM, New York (1987)","DOI":"10.1145\/28395.28420"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-55220-5_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Goldwasser","year":"2014","unstructured":"Goldwasser, S., et al.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 578\u2013602. Springer, Heidelberg (2014). doi:\n                      10.1007\/978-3-642-55220-5_32"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Halevi, S., Ishai, Y., Jain, A., Kushilevitz, E., Rabin, T.: Secure multiparty computation with general interaction patterns. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, ITCS 2016, pp. 157\u2013168. ACM, New York (2016)","DOI":"10.1145\/2840728.2840760"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-22792-9_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S Halevi","year":"2011","unstructured":"Halevi, S., Lindell, Y., Pinkas, B.: Secure computation on the web: computing without simultaneous interaction. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 132\u2013150. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-22792-9_8"},{"issue":"2\u20133","key":"15_CR15","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2007.04.031","volume":"384","author":"M Hinkelmann","year":"2007","unstructured":"Hinkelmann, M., Jakoby, A.: Communications in unknown networks: preserving the secret of topology. Theor. Comput. Sci. 384(2\u20133), 184\u2013200 (2007). Structural Information and Communication Complexity (SIROCCO 2005)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR16","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":"M Hirt","year":"2016","unstructured":"Hirt, M., Maurer, U., Tschudi, D., Zikas, V.: Network-hiding communication and applications to multi-party protocols. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 335\u2013365. Springer, Heidelberg (2016). doi:\n                      10.1007\/978-3-662-53008-5_12"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(93)90199-J","volume":"46","author":"S Hoory","year":"1993","unstructured":"Hoory, S., Wigderson, A.: Universal traversal sequences for expander graphs. Inf. Process. Lett. 46(2), 67\u201369 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01048274","volume":"2","author":"JD Kahn","year":"1989","unstructured":"Kahn, J.D., Linial, N., Nisan, N., Saks, M.E.: On the cover time of random walks on graphs. J. Theor. Probab. 2(1), 121\u2013128 (1989)","journal-title":"J. Theor. Probab."},{"key":"15_CR19","first-page":"353","volume-title":"Combinatorics, Paul Erd\u0151s is Eighty","author":"L Lov\u00e1sz","year":"1996","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: a survey. In: Mikl\u00f3s, D., S\u00f3s, V.T., Sz\u0151nyi, T. (eds.) Combinatorics, Paul Erd\u0151s is Eighty, vol. 2, pp. 353\u2013398. J\u00e1nos Bolyai Mathematical Society, Budapest (1996)"},{"key":"15_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing - Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing - Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-662-46494-6_8","volume-title":"Theory of Cryptography","author":"T Moran","year":"2015","unstructured":"Moran, T., Orlov, I., Richelson, S.: Topology-hiding computation. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 169\u2013198. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-46494-6_8"},{"key":"15_CR22","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003). no. 5"},{"issue":"5","key":"15_CR23","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/332833.332838","volume":"43","author":"GJ Pottie","year":"2000","unstructured":"Pottie, G.J., Kaiser, W.J.: Wireless integrated network sensors. Commun. ACM 43(5), 51\u201358 (2000)","journal-title":"Commun. ACM"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, SFCS 1986, pp. 162\u2013167. IEEE Computer Society, Washington, D.C. (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63688-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T00:05:51Z","timestamp":1596845151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63688-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319636870","9783319636887"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63688-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"29 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iacr.org\/conferences\/crypto2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}