Advertisement

Multiple Target Localisation in Sensor Networks with Location Privacy

  • Matthew Roughan
  • Jon Arnold
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4572)

Abstract

It is now well known that data-fusion from multiple sensors can improve detection and localisation of targets. Traditional data fusion requires the sharing of detailed data from multiple sources. In some cases, the various sources may not be willing to share such detailed information. For instance, current military allies may be willing to share some level of information, but only if they can do so without revealing their secrets. This situation appears relevant for modern sensor networks, which may be comprised of networks from multiple participants. It has previously been shown that localisation of a single target can be performed while preserving location privacy of the sensor nodes. Here we extend this to the case of multiple targets. The novel aspect of the problem is related to the ambiguity in target labels, and how we resolve this ambiguity.

Keywords

privacy-preservation localization ad-hoc networks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Atallah, M., Bykova, M., Li, J., Frikken, K., Topkara, M.: Private collaborative forecasting and benchmarking. In: Proc. of the ACM Workshop on Privacy in the Electronic Society (WPES 2004), Washington, DC (October 2004)Google Scholar
  2. 2.
    Benaloh, J.: Secret sharing homomorphisms: Keeping shares of a secret secret. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251–260. Springer, Heidelberg (1987)Google Scholar
  3. 3.
    Brickell, J., Shmatikov, V.: Privacy-preserving graph algorithms in the semi-honest model. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 236–252. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.: Tools for privacy preserving distributed data mining. In: SIGKDD Explorations, vol. 4(2) (December 2002)Google Scholar
  5. 5.
    Patwari, N., Hero, A.O., Costa, J.A.: Learning Sensor Location from Signal Strength and Connectivity. Springer, Heidelberg, 2006 (to appear)Google Scholar
  6. 6.
    Roughan, M., Arnold, J.: Data fusion without data fusion: localization and tracking without sharing sensitive information. In: Information, Decision and Control (IDC), Adelaide, Australia (February 2007)Google Scholar
  7. 7.
    Roughan, M., Zhang, Y.: Secure distributed data-mining and its application to large-scale network measurements. SIGCOMM Comput. Commun. Rev. 36(1), 7–14 (2006)CrossRefGoogle Scholar
  8. 8.
    Shang, Y., Ruml, W., Zhang, Y., Fromherz, M.: Localization from mere connectivity. In: MobiHoc 2003, Annapolis, Maryland (2003)Google Scholar
  9. 9.
    Verykios, V.S., Bertino, E., Fovino, I.N., Provenza, L.P., Saygin, Y., Theodoridis, Y.: State-of-the-art in privacy preserving data mining. SIGMOD Record 33(1), 50–57 (2004)CrossRefGoogle Scholar
  10. 10.
    Yao, A.: Protocols for secure computations. In: Proc. of the 23th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 160–164 (1982)Google Scholar
  11. 11.
    Yao, A.: How to generate and exchange secrets. In: Proc. of the 27th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 162–167 (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Matthew Roughan
    • 1
  • Jon Arnold
    • 2
  1. 1.School of Mathematical Science, University of Adelaide, SA 5005Australia
  2. 2.Defence Science and Technology OrganisationAustralia

Personalised recommendations