Show simple item record

dc.creatorWang X. 
dc.creatorHou X. 
dc.creatorRios R. 
dc.creatorHallgren P. 
dc.creatorTippenhauer N.O. 
dc.creatorOchoa M. 
dc.date.accessioned2020-05-25T23:56:48Z
dc.date.available2020-05-25T23:56:48Z
dc.date.created2018
dc.identifier.urihttps://repository.urosario.edu.co/handle/10336/22527
dc.description.abstractLocation privacy has mostly focused on scenarios where users remain static. However, investigating scenarios where the victims present a particular mobility pattern is more realistic. In this paper, we consider abstract attacks on services that provide location information on other users in the proximity. In that setting, we quantify the required effort of the attacker to localize a particular mobile victim. We prove upper and lower bounds for the effort of an optimal attacker. We experimentally show that a Linear Jump Strategy (LJS) practically achieves the upper bounds for almost uniform initial distributions of victims. To improve performance for less uniform distributions known to the attacker, we propose a Greedy Updating Attack Strategy (GUAS). Finally, we derive a realistic mobility model from a real-world dataset and discuss the performance of our strategies in that setting. © 2018, Springer Nature Switzerland AG.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.11099 LNCS,(2018); pp. 373-392
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85051865842&doi=10.1007%2f978-3-319-98989-1_19&partnerID=40&md5=cc65c09ad6b87f30ab1d65089ff24fcd
dc.titleLocation proximity attacks against mobile targets: Analytical bounds and attacker strategies
dc.typeconferenceObject
dc.publisherSpringer Verlag
dc.subject.keywordSecurity of data
dc.subject.keywordSecurity systems
dc.subject.keywordAnalytical bounds
dc.subject.keywordAttack strategies
dc.subject.keywordImprove performance
dc.subject.keywordLocation information
dc.subject.keywordMobility pattern
dc.subject.keywordRealistic mobility models
dc.subject.keywordUniform distribution
dc.subject.keywordUpper and lower bounds
dc.subject.keywordLocation
dc.rights.accesRightsinfo:eu-repo/semantics/openAccess
dc.type.spaDocumento de conferencia
dc.rights.accesoAbierto (Texto Completo)
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersion
dc.identifier.doihttps://doi.org/10.1007/978-3-319-98989-1_19
dc.relation.citationEndPage392
dc.relation.citationStartPage373
dc.relation.citationTitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.relation.citationVolumeVol. 11099 LNCS
dc.source.instnameinstname:Universidad del Rosario
dc.source.reponamereponame:Repositorio Institucional EdocUR


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record