SwePub
Sök i LIBRIS databas

  Utökad sökning

id:"swepub:oai:DiVA.org:kth-290827"
 

Sökning: id:"swepub:oai:DiVA.org:kth-290827" > Cooperative Locatio...

Cooperative Location Privacy in Vehicular Networks : Why Simple Mix-zones are not Enough

Khodaei, Mohammad (författare)
KTH,Nätverk och systemteknik,Networked Systems Security group
Papadimitratos, Panagiotis (författare)
KTH,Kommunikationssystem, CoS,Networked Systems Security group
 (creator_code:org_t)
Institute of Electrical and Electronics Engineers Inc. 2021
2021
Engelska.
Ingår i: IEEE Internet of Things Journal. - : Institute of Electrical and Electronics Engineers Inc.. - 2327-4662. ; , s. 1-1
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • 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

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)

Nyckelord

Anonymity
Location Privacy
Mix Networks
Privacy
Pseudonymity
VANETs.
Vehicular Communication
Cryptography
Privacy by design
Roads and streets
Safety engineering
Semantics
Communication overheads
Cooperative locations
Critical operations
Extra computations
Inference attacks
Tracking algorithm
Vehicular communications
Vehicular networks
Road vehicles

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...
Khodaei, Mohamma ...
Papadimitratos, ...
Om ämnet
TEKNIK OCH TEKNOLOGIER
TEKNIK OCH TEKNO ...
och Elektroteknik oc ...
Artiklar i publikationen
IEEE Internet of ...
Av lärosätet
Kungliga Tekniska Högskolan

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy