IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i8p246216.html
   My bibliography  Save this article

URALP: Unreachable Region Aware Location Privacy against Maximum Movement Boundary Attack

Author

Listed:
  • Nha Nguyen
  • Seungchul Han
  • Minho Shin

Abstract

As location-based services have become popular, thereby exposed user locations raised serious privacy concerns. A typical measure for location privacy is to report blurred locations and ensure that other users coexist in the reported region. However, additional knowledge about the user's maximum speed and the territorial information in user's vicinity can allow for the adversary to effectively compromise the user's location privacy. In this paper, we present an anonymization algorithm that effectively counters such attacks while achieving k -anonymity requirements as well as minimum acceptable cloaked region size. We evaluate our anonymization scheme using state-of-the-art simulators for both vehicular movements and pedestrian movements. The experimental results demonstrate the effectiveness and efficiency of our proposed algorithm.

Suggested Citation

  • Nha Nguyen & Seungchul Han & Minho Shin, 2015. "URALP: Unreachable Region Aware Location Privacy against Maximum Movement Boundary Attack," International Journal of Distributed Sensor Networks, , vol. 11(8), pages 246216-2462, August.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:246216
    DOI: 10.1155/2015/246216
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/246216
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/246216?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:246216. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.