Advertisement

On Location Hiding in Distributed Systems

  • Karol GotfrydEmail author
  • Marek Klonowski
  • Dominik Pająk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10641)

Abstract

We consider the following problem – a group of mobile agents perform some task on a terrain modeled as a graph. In a given moment of time an adversary gets access to the graph and agents’ positions. Shortly before adversary’s observation the devices have a chance to relocate themselves in order to hide their initial configuration, as the initial configuration may possibly reveal to the adversary some information about the task they performed. Clearly agents have to change their locations in possibly short time using minimal energy. In our paper we introduce a definition of a well hiding algorithm in which the starting and final configurations of the agents have small mutual information. Then we discuss the influence of various features of the model on running time of the optimal well hiding algorithm. We show that if the topology of the graph is known to the agents, then the number of steps proportional to the diameter of the graph is sufficient and necessary. In the unknown topology scenario we only consider a single agent case. We first show that the task is impossible in the deterministic case if the agent has no memory. Then we present a polynomial randomized algorithm. Finally in the model with memory we show that the number of steps proportional to the number of edges of the graph is sufficient and necessary. In some sense we investigate how complex is the problem of “losing” information about location (both physical and logical) for different settings.

Keywords

Location hiding Mobile agents Random walks Graphs 

Notes

Acknowledgments

The authors of this paper would like to thank to anonymous reviewers for their valuable comments, suggestions and remarks.

References

  1. 1.
    Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: FOCS, pp. 218–223 (1979)Google Scholar
  2. 2.
    Alon, N., Avin, C., Koucký, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. Comb. Probab. Comput. 20(4), 481–502 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Boyd, S.P., Diaconis, P., Xiao, L.: Fastest mixing Markov chain on a graph. SIAM Rev. 46(4), 667–689 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Cover, T.M.: Which processes satisfy the second law. In: Halliwell, J.J., Pérez-Mercader, J., Zurek, W.H. (eds.) PhysicaL Origins of Time Asymmetry, pp. 98–107 (1994)Google Scholar
  5. 5.
    Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, Hoboken (2006)zbMATHGoogle Scholar
  6. 6.
    Díaz, C.: Anonymity metrics revisited. In: Anonymous Communication and Its Applications, 09–14 October 2005 (2005)Google Scholar
  7. 7.
    Dragomir, S., Scholz, M., Sunde, J.: Some upper bounds for relative entropy and applications. Comput. Math. Appl. 39(9), 91–100 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    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–489. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-03685-9_36 CrossRefGoogle Scholar
  9. 9.
    Elsässer, R., Sauerwald, T.: Tight bounds for the cover time of multiple random walks. Theor. Comput. Sci. 412(24), 2623–2641 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Feige, U.: A tight lower bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(4), 433–438 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Feige, U.: A tight upper bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(1), 51–54 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Gao, K., Zhu, Y., Gong, S., Tan, H.: Location privacy protection algorithm for mobile networks. EURASIP J. Wirel. Commun. Netw. 2016(1), 205 (2016)CrossRefGoogle Scholar
  13. 13.
    Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS, Providence (2009)zbMATHGoogle Scholar
  14. 14.
    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–52. ACM, New York (2014)Google Scholar
  15. 15.
    Lovász, L.: Random walks on graphs: a survey. Comb. Paul Erdos Eighty 2(1), 1–46 (1993)Google Scholar
  16. 16.
    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–50 (2016)Google Scholar
  17. 17.
    Nonaka, Y., Ono, H., Sadakane, K., Yamashita, M.: The hitting and cover times of metropolis walks. Theor. Comput. Sci. 411(16–18), 1889–1894 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Pfitzmann, A., Köhntopp, M.: Anonymity, unobservability, and pseudonymity — a proposal for terminology. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 1–9. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-44702-4_1 CrossRefGoogle Scholar
  19. 19.
    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–762. ACM, New York (2014)Google Scholar
  20. 20.
    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)zbMATHGoogle Scholar
  21. 21.
    Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Rényi, A.: On measures of entropy and information. In: Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 547–561. University of California Press (1961)Google Scholar
  23. 23.
    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–699 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    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–122 (2014)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Karol Gotfryd
    • 1
    Email author
  • Marek Klonowski
    • 1
  • Dominik Pająk
    • 1
  1. 1.Department of Computer ScienceWrocław University of Science and TechnologyWrocławPoland

Personalised recommendations