{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T03:05:40Z","timestamp":1725937540683},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319720494"},{"type":"electronic","value":"9783319720500"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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-72050-0_11","type":"book-chapter","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T11:57:13Z","timestamp":1514548633000},"page":"174-192","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Location Hiding in Distributed Systems"],"prefix":"10.1007","author":[{"given":"Karol","family":"Gotfryd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Klonowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Paj\u0105k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,30]]},"reference":[{"key":"11_CR1","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: FOCS, pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"issue":"4","key":"11_CR2","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1017\/S0963548311000125","volume":"20","author":"N Alon","year":"2011","unstructured":"Alon, N., Avin, C., Kouck\u00fd, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. Comb. Probab. Comput. 20(4), 481\u2013502 (2011)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"11_CR3","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1137\/S0036144503423264","volume":"46","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Diaconis, P., Xiao, L.: Fastest mixing Markov chain on a graph. SIAM Rev. 46(4), 667\u2013689 (2004)","journal-title":"SIAM Rev."},{"key":"11_CR4","unstructured":"Cover, T.M.: Which processes satisfy the second law. In: Halliwell, J.J., P\u00e9rez-Mercader, J., Zurek, W.H. (eds.) PhysicaL Origins of Time Asymmetry, pp. 98\u2013107 (1994)"},{"key":"11_CR5","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, Hoboken (2006)","edition":"2"},{"key":"11_CR6","unstructured":"D\u00edaz, C.: Anonymity metrics revisited. In: Anonymous Communication and Its Applications, 09\u201314 October 2005 (2005)"},{"issue":"9","key":"11_CR7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0898-1221(00)00089-4","volume":"39","author":"S Dragomir","year":"2000","unstructured":"Dragomir, S., Scholz, M., Sunde, J.: Some upper bounds for relative entropy and applications. Comput. Math. Appl. 39(9), 91\u2013100 (2000)","journal-title":"Comput. Math. Appl."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-03685-9_36","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"K Efremenko","year":"2009","unstructured":"Efremenko, K., Reingold, O.: How well do random walks parallelize? In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX\/RANDOM - 2009. LNCS, vol. 5687, pp. 476\u2013489. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03685-9_36"},{"issue":"24","key":"11_CR9","doi-asserted-by":"crossref","first-page":"2623","DOI":"10.1016\/j.tcs.2010.08.010","volume":"412","author":"R Els\u00e4sser","year":"2011","unstructured":"Els\u00e4sser, R., Sauerwald, T.: Tight bounds for the cover time of multiple random walks. Theor. Comput. Sci. 412(24), 2623\u20132641 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"11_CR10","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/rsa.3240060406","volume":"6","author":"U Feige","year":"1995","unstructured":"Feige, U.: A tight lower bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(4), 433\u2013438 (1995)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"11_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/rsa.3240060106","volume":"6","author":"U Feige","year":"1995","unstructured":"Feige, U.: A tight upper bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(1), 51\u201354 (1995)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"11_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1186\/s13638-016-0708-z","volume":"2016","author":"K Gao","year":"2016","unstructured":"Gao, K., Zhu, Y., Gong, S., Tan, H.: Location privacy protection algorithm for mobile networks. EURASIP J. Wirel. Commun. Netw. 2016(1), 205 (2016)","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"11_CR13","volume-title":"Markov Chains and Mixing Times","author":"DA Levin","year":"2009","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS, Providence (2009)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Li, M., Zhu, H., Gao, Z., Chen, S., Yu, L., Hu, S., Ren, K.: All your location are belong to us: breaking mobile social networks for automated user location tracking. In: MobiHoc, pp. 43\u201352. ACM, New York (2014)","DOI":"10.1145\/2632951.2632953"},{"issue":"1","key":"11_CR15","first-page":"1","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: a survey. Comb. Paul Erdos Eighty 2(1), 1\u201346 (1993)","journal-title":"Comb. Paul Erdos Eighty"},{"issue":"4","key":"11_CR16","first-page":"42","volume":"144","author":"BKR Niroj Kumar Pani","year":"2016","unstructured":"Niroj Kumar Pani, B.K.R., Mishra, S.: A topology-hiding secure on-demand routing protocol for wireless ad hoc network. Int. J. Comput. Appl. 144(4), 42\u201350 (2016)","journal-title":"Int. J. Comput. Appl."},{"issue":"16\u201318","key":"11_CR17","doi-asserted-by":"crossref","first-page":"1889","DOI":"10.1016\/j.tcs.2010.01.032","volume":"411","author":"Y Nonaka","year":"2010","unstructured":"Nonaka, Y., Ono, H., Sadakane, K., Yamashita, M.: The hitting and cover times of metropolis walks. Theor. Comput. Sci. 411(16\u201318), 1889\u20131894 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44702-4_1","volume-title":"Designing Privacy Enhancing Technologies","author":"A Pfitzmann","year":"2001","unstructured":"Pfitzmann, A., K\u00f6hntopp, M.: Anonymity, unobservability, and pseudonymity \u2014 a proposal for terminology. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 1\u20139. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44702-4_1"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Pham, A., Huguenin, K., Bilogrevic, I., Hubaux, J.P.: Secure and private proofs for location-based activity summaries in urban areas. In: UbiComp, pp. 751\u2013762. ACM, New York (2014)","DOI":"10.1145\/2632048.2632064"},{"key":"11_CR20","volume-title":"Numerical Recipes 3rd Edition: The Art of Scientific Computing","author":"WH Press","year":"2007","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes 3rd Edition: The Art of Scientific Computing, 3rd edn. Cambridge University Press, New York (2007)","edition":"3"},{"issue":"4","key":"11_CR21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1391289.1391291","volume":"55","author":"O Reingold","year":"2008","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17 (2008)","journal-title":"J. ACM"},{"key":"11_CR22","unstructured":"R\u00e9nyi, A.: On measures of entropy and information. In: Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 547\u2013561. University of California Press (1961)"},{"issue":"4","key":"11_CR23","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1137\/S0036144504443821","volume":"48","author":"J Sun","year":"2006","unstructured":"Sun, J., Boyd, S.P., Xiao, L., Diaconis, P.: The fastest mixing markov process on a graph and a connection to a maximum variance unfolding problem. SIAM Rev. 48(4), 681\u2013699 (2006)","journal-title":"SIAM Rev."},{"key":"11_CR24","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.adhoc.2014.05.012","volume":"21","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Yan, T., Tian, J., Hu, Q., Wang, G., Li, Z.: TOHIP: a topology-hiding multipath routing protocol in mobile ad hoc networks. Ad Hoc Netw. 21, 109\u2013122 (2014)","journal-title":"Ad Hoc Netw."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72050-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T17:21:50Z","timestamp":1570555310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72050-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319720494","9783319720500"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72050-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}