security and privacy in vehicular social networks
play

Security and Privacy in Vehicular Social Networks Hongyu Jin, - PowerPoint PPT Presentation

KTH ROYAL INSTITUTE OF TECHNOLOGY Security and Privacy in Vehicular Social Networks Hongyu Jin, Mohammad Khodaei, and Panos Papadimitratos Networked Systems Security Group (NSS) www.eecs.kth.se/nss Security and Privacy for Vehicular


  1. KTH ROYAL INSTITUTE OF TECHNOLOGY Security and Privacy in Vehicular Social Networks Hongyu Jin, Mohammad Khodaei, and Panos Papadimitratos Networked Systems Security Group (NSS) www.eecs.kth.se/nss

  2. Security and Privacy for Vehicular Communication (VC) Systems Basic Requirements ◮ Authentication & integrity ◮ Non-repudiation ◮ Authorization and access control ◮ Conditional anonymity ◮ Unlinkability (long-term) Vehicular Public-Key Infrastructure (VPKI) ◮ Pseudonymous authentication ◮ Trusted Third Party (TTP): ◮ Certification Authority (CA) ◮ Issues credentials & binds users to their pseudonyms 2/16

  3. Security and Privacy for VC Systems (cont’d) ◮ Sign packets with the private key, corresponding to the current valid pseudonym ◮ Verify packets with the valid pseudonym ◮ Cryptographic operations in a Hardware Security Module (HSM) 3/16

  4. Security and Privacy for VC Systems (cont’d) RCA A certifies B A B ◮ Vehicular Public-Key Infrastructure (VPKI) Cross-certification Communication link Message dissemination ◮ Domain A Domain B Domain C RA Root CA (RCA) RA LTCA RA LTCA LTCA X-Cetify ◮ Long Term CA (LTCA) PCA PCA PCA LDAP LDAP ◮ Pseudonym CA (PCA) 3/4/5G RSU {Msg} (P iv ) , P i ◮ Resolution Authority (RA) v ◮ Lightweight Directory Access Protocol (LDAP) {Msg} (P iv ) , P i v B ◮ Roadside Unit (RSU) ◮ Vehicles registered with one LTCA (home domain) ◮ PCA servers in one or multiple domains ◮ Vehicles can obtain pseudonyms from any PCA ◮ Establish trust among entities with a RCA or with cross-certification ◮ Resolve (de-anonymize) a pseudonym with the help of an RA 4/16

  5. Hierarchical Organization of the VC Security Infrastructure A Certifies B A B Cross-Certification Communication Link HCA 1 HCA 2 HCA K LTCA 1 LTCA 2 LTCA 3 LTCA L PCA 1 PCA 2 PCA 3 PCA 4 PCA 5 PCA M HCA: Higher Level Authority 5/16

  6. Security and Privacy Requirements ◮ Authentication and Integrity ◮ Confidentiality ◮ Accountability and Non-repudiation ◮ Unlinkability and Anonymity ◮ Access Control ◮ Availability 6/16

  7. Adversarial Model ◮ Honest-but-Curious Entities ◮ Extend our adversarial model from fully-trustworthy to honest-but-curious servers. Honest-but-curious entities never deviate from system security policies or protocols, but they are tempted to infer and exploit user sensitive information, e.g., profile users and push advertisements to users based on their interests. ◮ Malicious Participants ◮ Registered vehicles and users (legitimate insiders) disseminate faulty information ◮ Selfish Participants ◮ Such users could try to achieve higher and optimal awards by sacrificing the minimum resources. These misbehaving internal adversaries utilize the resource of other nodes to achieve a better service without participating in the tasks. 7/16

  8. Vehicular Social Network (VSN) RSU/BS/AP SPs V 4 V 5 V 3 V 2 V 1 P 1 RSU/BS/AP P 2 Figure: Illustration of VSNs: (1) Vehicles (with OBUs, e.g., V 3 , V 4 and V 5 ) and users (with smartphones, e.g., P 2 ) can access various Service Providers (SPs) via Roadside Units (RSUs), Base Stations (BSs) or Access Points (APs); (2) Vehicles (e.g., V 1 and V 2 ) or users (e.g., P 1 ) can interact with each other over an ad-hoc network (e.g., share information obtained from SPs). 8/16

  9. Pseudonymous Authentication in VSN RSU/BS/AP SPs CAs V 2 V 1 P 1 Figure: Vehicles and users can obtain pseudonyms from the Certification Authorities (CAs). The communication in the VSNs is protected with pseudonymous authentication including P2P communication (e.g., V 1 - V 2 and V 2 - P 1 ) in the ad-hoc network and vehicle/user-SP communication. 9/16

  10. Privacy Challenges Stronger adversarial model ◮ User privacy protection against honest-but-curious entities ◮ Inference of service provider or time LTCA infers relevant information from the requests ◮ Direct (C2C-CC design) or indirect (ticket-based designs) approaches ◮ Actual pseudonym acquisition period ◮ Targeted PCA that the vehicle seeks to obtain credentials from Trivially linking pseudonyms issued by the PCA ◮ Fully-trusted proxy-based scheme that shuffles the requests ◮ Honest-but-curious proxy? 10/16

  11. Resilience Considerations Sybil-based misbehavior ◮ Acquisition of multiple simultaneously valid credentials ◮ Allow several pseudonymous valid simultaneously for a specific period of time (C2C-CC or CAMP project) ◮ Changing the certificate in a critical traffic situation (e.g., intersection, accident) ◮ Safety applications necessitate partial linkability ◮ But what if a vehicle gets compromised? ◮ Injecting multiple erroneous hazard notification ◮ VPKI should ensure a compromised vehicle cannot obtain multiple pseudonyms valid simultaneously ◮ along with enforcing a policy on the vehicle side ◮ Standardization bodies and harmonization efforts do not preclude such misbehavior 11/16

  12. Pseudonym Lifetime Policy ◮ Sybil-based misbehavior → ◮ Ideally one pseudonym for a Non-overlapping lifetime single message authentication; ◮ Flexible access to PCA → undermine but costly, e.g. 10 beacons per sec. unlinkability ◮ Safety applications necessitate ◮ Timing information makes sets of partial linkability, e.g., collision pseudonyms linkable avoidance: inferring a collision 10 9 hazard based on unlinkable 8 7 CAMs is hard; requires precise 6 location information. 5 4 ◮ No conclusive view or guideline 3 2 for pseudonym lifetime policy 1 0 5 10 15 20 25 30 35 40 45 50 55 60 Pseudonym Lifetime [sec] 12/16

  13. Certificate Revocation List (CRL) Revocation ◮ Eviction of the wrong doers in case of misbehavior ◮ Not straightforward in the VC systems ◮ Multiplicity of pseudonyms ◮ Very large number of pseudonyms, thus huge revocation list ◮ Efficient distribution of the revocation list among mobile entities ◮ Limited memory/bandwidth consumption through usage of CRL Diminish such vulnerability ◮ Requiring the vehicles to interact with the VPKI regularly ◮ Or at least as frequently as dissemination of information by PCA The remaining challenge: ◮ No consensus on the need and the method: C2C-CC suggests to preload with 1500 pseudonyms for a year and let them expire (no revocation) ◮ Timely dissemination of credential validity information ◮ Time, cost, bandwidth, network accessibility, etc. 13/16

  14. Inference Attacks ◮ Openness of wireless communication and dissemination of basic safety messages in plaintext (as confidentiality is not needed in VC systems) ◮ Vehicle Traceability ◮ Syntactic Linking: An adversary might observe an isolated pseudonym change, and associate the old and new pseudonymous identifiers through syntactic linking. ◮ Semantic Linking: An adversary could leverage physical constraints of the road layout, and message payload, e.g., location, velocity, time, acceleration, the length and width 1 of a victim’s vehicle, to predict its trajectory towards linking messages semantically. 14/16

  15. Other Challenges ◮ Extending to anonymous authentication primitives ◮ Group signature schemes ◮ Zero-knowledge proof ◮ Extensive experimental validation ◮ SEROSA ◮ SR-VPKI ◮ Operational challenges: ◮ Who is in charge of the identity and credential management ◮ How to establish the trust: ◮ [Saab, Scania, Volvo] and [Volkswagen, BMW] ◮ [EU] and [US] 15/16

  16. Security and Privacy in Vehicular Social Networks Hongyu Jin, Mohammad Khodaei, and Panos Papadimitratos Networked Systems Security Group (NSS) www.eecs.kth.se/nss In Vehicular Social Networks, A. M. Vegni, V. Loscri, and A. V. Vasilakos, Eds. CRC Press, Taylor & Francis Group, March 2017. 16/16

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend