In this paper, we propose privacy-preserving route reporting schemes for traffic management for both infrastructure-supported and self-organizing vehicular ad hoc networks (VANETs). Using only pseudonyms and anonymous authentication to conceal the real identity of the drivers cannot fully preserve the drivers' privacy because the reported future positions can be used to link pseudonyms and identify the drivers, e.g., from the locations they visit. Motivated by the fact that traffic management systems do not need to know the vehicles' individual routes and the total number of vehicles in each road segment would suffice, the proposed schemes aggregate the vehicles' routes. Countering the collusion attacks is usually hard, particularly in a self-organizing setting. The concept we use to mitigate the attack is that one vehicle is not trusted to run the scheme because it can be curious to know the drivers' routes, but these schemes are run by multiple vehicles. Our ns-2 simulation results and analysis have demonstrated that our schemes can preserve the drivers' privacy with acceptable overhead.

In this paper, we propose an efficient scheme that utilizes symmetric-key-cryptography and hashing operations to collect consumption data. The idea is based on sending masked power consumption readings from the meters and removing these masks by adding all the meters' messages, so that the utility can learn the aggregated reading but cannot learn the individual readings. We also introduce a key management procedure that uses asymmetric key operations, but unlike the power consumption collection that is done very frequently, the key management procedure is run every long time for key renewals. Our evaluations indicate that the cryptographic operations needed in our scheme are much more efficient than the operations needed in the existing schemes. In addition, we have shown that the proposed scheme can preserve the consumers' privacy and provide high protection level against collusion attacks. Finally, ns-3 simulation results demonstrate that the network performance of the proposed scheme outperforms the performance of the existing schemes due to reducing the packet size and computational overhead.

One of the most promising technologies that will be used for charging Electric Vehicles (EVs) is wireless charging. By employing this technology, an EV is able to charge its battery without the need to stop. The charging stations should authenticate the EVs before allowing them to charge their batteries. Traditional digital signature reveals the real identity of the driver and degrades the location privacy. In this paper, we propose an efficient privacy-preserving authentication scheme for EVs wireless charging scenario. Our objective is not only to enable the EVs and the charging station to perform mutual authentication but to protect the privacy of the drivers without the need of a Third Trusted Party (TTP). The EVs use blind signature for authentication with the charging station to protect their privacy. Then, they use hash chains to authenticate themselves to the charging pads which are limited constraint devices. The verification of a hash chain requires performing simple hash operations which is computationally cheap and light-weight. The communication between the EVs and the charging station is secured by establishing an encrypted session. Our extensive evaluations demonstrate that our scheme preserves the drivers' privacy while mutually authenticate the EVs and the charging pads with low communication and computation overhead.

Given the large geographic deployment and scalability of the Advanced Metering Infrastructure (AMI) networks, it is inefficient to create one large certificate revocation list (CRL) for all the networks. It is also inefficient to create a CRL for each meter having the certificates it needs because too many CRLs will be required. It is beneficial to balance the size of the CRLs and the overhead of forming and distributing them. In this paper, the certificate authority (CA) groups the AMI networks and composes one CRL for each group. We use Bloom filter to reduce the number of CRLs by increasing the groups size with acceptable overhead on the meters. However, Bloom filters suffer from false positives which is not acceptable in AMI networks because meters may miss important messages. We propose a novel scheme to identify and mitigate the false positives by making use of the fact that Bloom filters are free of false negatives. The meters should contact the gateway to resolve the false positives. We use Merkle tree to enable the gateway to provide efficient proof for certificate revocation without contacting the CA. We derive a mathematical formula to the probability of contacting the gateway as a function of the filter's parameters. We will show that this probability can be low by properly designing the Bloom filter. In order to assess the performance and the applicability of the proposed scheme, we use ns-3 network simulator to implement the scheme in a IEEE 802.11s-based mesh AMI networks. The results demonstrate that our scheme can be used efficiently for AMI networks.

Rapid advances in technology and shifting tastes among motorists have reworked the contemporary automobile production sector. Driving is now much safer and more convenient than ever before thanks to a plethora of new technology and apps. Millions of people are hurt every year despite the fact that automobiles are networked and have several sensors and radars for collision avoidance. Each year, many of them are injured in car accidents and need emergency care, and sadly, the fatality rate is growing. Vehicle and pedestrian collisions are still a serious problem, making it imperative to advance methods that prevent them. This paper refines our previous efficient VANET-based pedestrian safety system based on two-way communication between smart cars and the cell phones of vulnerable road users. We implemented the scheme using C and NS3 to simulate different traffic scenarios. Our objective is to measure the additional overhead to protect vulnerable road users. We prove that our proposed scheme adds just a little amount of additional overhead and successfully satisfies the stringent criteria of safety applications.