Privacy-Preserving Blockchain-Based Registration Scheme for AV Parking System

Autonomous Vehicles (AV) are a prime example of how innovation and automation are at the forefront of growing technology trends. The concern of parking systems is becoming apparent as research into ways to increase the efficiency and cost-effectiveness of AV continues. To ward against various internet attackers and secure users\u27 sensitive information, an efficient AV parking system must have powerful user privacy and cyber security capabilities. In my work, I present a blockchain-based privacy registration system for AV parking systems that meets the following criteria. The proposed scheme incorporates k-Nearest Neighbor (kNN) - an efficient and lightweight algorithm - for encrypting and matching available parking slots of participating AV parking lots with the parking spaces of interest to AV users using vector matrices. Additionally, the incorporated blockchain eliminates the need for financial third parties and ensures secure payment fairness and transparency between the AV and parking lot. The proposed approach is also shown to be robust and efficient, according to our security and privacy analysis. Keywords: Blockchain, Parking Reservation, Autonomous Vehicles (AV), k-Nearest Neighbor (kNN), Parking Cloud Server (PCS

Efficient and Privacy-Preserving Ride Sharing Organization for Transferable and Non-Transferable Services

Ride-sharing allows multiple persons to share their trips together in one vehicle instead of using multiple vehicles. This can reduce the number of vehicles in the street, which consequently can reduce air pollution, traffic congestion and transportation cost. However, a ride-sharing organization requires passengers to report sensitive location information about their trips to a trip organizing server (TOS) which creates a serious privacy issue. In addition, existing ride-sharing schemes are non-flexible, i.e., they require a driver and a rider to have exactly the same trip to share a ride. Moreover, they are non-scalable, i.e., inefficient if applied to large geographic areas. In this paper, we propose two efficient privacy-preserving ride-sharing organization schemes for Non-transferable Ride-sharing Services (NRS) and Transferable Ride-sharing Services (TRS). In the NRS scheme, a rider can share a ride from its source to destination with only one driver whereas, in TRS scheme, a rider can transfer between multiple drivers while en route until he reaches his destination. In both schemes, the ride-sharing area is divided into a number of small geographic areas, called cells, and each cell has a unique identifier. Each driver/rider should encrypt his trip's data and send an encrypted ride-sharing offer/request to the TOS. In NRS scheme, Bloom filters are used to compactly represent the trip information before encryption. Then, the TOS can measure the similarity between the encrypted trips data to organize shared rides without revealing either the users' identities or the location information. In TRS scheme, drivers report their encrypted routes, an then the TOS builds an encrypted directed graph that is passed to a modified version of Dijkstra's shortest path algorithm to search for an optimal path of rides that can achieve a set of preferences defined by the riders

Privacy-Preserving Ride Sharing Scheme for Autonomous Vehicles in Big Data Era

Ride sharing can reduce the number of vehicles in the streets by increasing the occupancy of vehicles, which can facilitate traffic and reduce crashes and the number of needed parking slots. Autonomous Vehicles (AVs) can make ride sharing convenient, popular, and also necessary because of the elimination of the driver effort and the expected high cost of the vehicles. However, the organization of ride sharing requires the users to disclose sensitive detailed information not only on the pick-up/drop-off locations but also on the trip time and route. In this paper, we propose a scheme to organize ride sharing and address the unique privacy issues. Our scheme uses a similarity measurement technique over encrypted data to preserve the privacy of trip data. The ride sharing region is divided into cells and each cell is represented by one bit in a binary vector. Each user should represent trip data as binary vectors and submit the encryption of the vectors to a server. The server can measure the similarity of the users’ trip data and find users who can share rides without knowing the data. Our analysis has demonstrated that the proposed scheme can organize ride sharing without disclosing private information. We have implemented our scheme using Visual C on a real map and the measurements have confirmed that our scheme is effective when ride sharing becomes popular and the server needs to organize a large number of rides in short time