Sökning: L773:2327 4662 >
Cooperative Locatio...
-
Khodaei, MohammadKTH,Nätverk och systemteknik,Networked Systems Security group
(författare)
Cooperative Location Privacy in Vehicular Networks : Why Simple Mix-zones are not Enough
- Artikel/kapitelEngelska2021
Förlag, utgivningsår, omfång ...
-
Institute of Electrical and Electronics Engineers Inc.2021
-
electronicrdacarrier
Nummerbeteckningar
-
LIBRIS-ID:oai:DiVA.org:kth-290827
-
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-290827URI
-
https://doi.org/10.1109/JIOT.2020.3043640DOI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:art swepub-publicationtype
Anmärkningar
-
QC 20210323
-
Vehicular communications disclose rich information about the vehicles and their whereabouts. Pseudonymous authentication secures communication while enhancing user privacy. To enhance location privacy, cryptographic mix-zones were proposed to facilitate vehicles covertly transition to new ephemeral credentials. The resilience to (syntactic and semantic) pseudonym linking (attacks) highly depends on the geometry of the mix-zones, mobility patterns, vehicle density, and arrival rates. We introduce a tracking algorithm for linking pseudonyms before and after a cryptographically protected mix-zone. Our experimental results show that an eavesdropper, leveraging standardized vehicular communication messages and road layout, could successfully link ≈73% of pseudonyms during non-rush hours and ≈62% of pseudonyms during rush hours after vehicles change their pseudonyms in a mix-zone. To mitigate such inference attacks, we present a novel cooperative mix-zone scheme that enhances user privacy regardless of the vehicle mobility patterns, vehicle density, and arrival rate to the mix-zone. A subset of vehicles, termed relaying vehicles, are selected to be responsible for emulating non-existing vehicles. Such vehicles cooperatively disseminate decoy traffic without affecting safety-critical operations: with 50% of vehicles as relaying vehicles, the probability of linking pseudonyms (for the entire interval) drops from ≈68% to ≈18%. On average, this imposes 28 ms extra computation overhead, per second, on the Road-Side Units (RSUs) and 4.67 ms extra computation overhead, per second, on the (relaying) vehicle side; it also introduces 1.46 KB/sec extra communication overhead by (relaying) vehicles and 45 KB/sec by RSUs for the dissemination of decoy traffic. Thus, user privacy is enhanced at the cost of low computation and communication overhead.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Papadimitratos, PanagiotisKTH,Kommunikationssystem, CoS,Networked Systems Security group(Swepub:kth)u1ysvc1i
(författare)
-
KTHNätverk och systemteknik
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:IEEE Internet of Things Journal: Institute of Electrical and Electronics Engineers Inc., s. 1-12327-4662
Internetlänk
Hitta via bibliotek
Till lärosätets databas