Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/8601
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAbul, Osman-
dc.date.accessioned2022-07-30T16:41:53Z-
dc.date.available2022-07-30T16:41:53Z-
dc.date.issued2022-
dc.identifier.citationAbul, O. (2022). Location-privacy preserving partial nearby friends querying in urban areas. Data & Knowledge Engineering, 139, 102006.en_US
dc.identifier.issn0169-023X-
dc.identifier.issn1872-6933-
dc.identifier.urihttps://doi.org/10.1016/j.datak.2022.102006-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/8601-
dc.description.abstractThis work studies the location-privacy preserving proximity querying in the context of proximity based services (PBSs), a special kind of location-based services (LBSs). The users register with the trusted PBS provider and specify their own personalized location privacy profile to be enforced against the curious friends (other registered users). Due to the urban area constraint, the user mobility is only on the city road network which is modeled as a weighted directed graph. The users share their own precise locations with the PBS provider and also query the nearby friends, the metric of which is defined on the shortest path on the graph. The proposed location privacy model ensures the location anonymity of the friends on the graph. To this end, two anonymity models, called weak location k-anonymity and strong location k-anonymity, are introduced to protect against the identified consecutive attack scenarios. The attack scenarios model the belief of the attacker (the query issuer) on the whereabouts of the friends. The PBS provider simulates the belief of each attacker on every users' whereabouts and suppresses some friends from the query result to ensure the location anonymity of each and every user at all times. Effective and efficient algorithms, needing no cryptographic protocols, have been developed to provide weak/strong location k-anonymity. An extensive experimental evaluation, mainly addressing the issues of privacy/utility tradeoff and runtime efficiency, on two real graphs with a simulated mobility is presented.en_US
dc.description.sponsorshipTUBITAK [118E712]en_US
dc.description.sponsorshipAcknowledgment This work has been supported by TUBITAK under the grant number 118E712.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofData & Knowledge Engineeringen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectLocation based servicesen_US
dc.subjectLocation privacyen_US
dc.subjectProximity servicesen_US
dc.subjectk-anonymityen_US
dc.subjectProtecting Privacyen_US
dc.subjectMobile Systemsen_US
dc.subjectAnonymizationen_US
dc.subjectFrameworken_US
dc.titleLocation-Privacy Preserving Partial Nearby Friends Querying in Urban Areasen_US
dc.typeArticleen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.departmentFaculties, Faculty of Engineering, Department of Computer Engineeringen_US
dc.identifier.volume139en_US
dc.identifier.wosWOS:000798803300003en_US
dc.identifier.scopus2-s2.0-85126922004en_US
dc.institutionauthorAbul, Osman-
dc.identifier.doi10.1016/j.datak.2022.102006-
dc.authorscopusid6602597612-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ2-
item.openairetypeArticle-
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.dept02.3. Department of Computer Engineering-
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record



CORE Recommender

WEB OF SCIENCETM
Citations

2
checked on Dec 21, 2024

Page view(s)

70
checked on Dec 16, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.