Cross-layer scheme for detecting large-scale colluding Sybil attack in VANETs

Rabieh, Khaled; Mahmoud, Mohamed; Guo, Terry N.; Younis, Mohamed

doi:10.1109/icc.2015.7249492

Cited by 42 publications

(25 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Location verification schemes are used to detect Sybil attacks. The underline idea is that the Sybil attacker cannot be physically located at more than one location at the same time.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A secure and privacy-preserving event reporting scheme for vehicular Ad Hoc networks

Rabieh

Mahmoud

Azer

et al. 2015

Security Comm. Networks

Self Cite

View full text Add to dashboard Cite

In vehicular ad hoc networks, vehicles should report events to warn the drivers of unexpected hazards on the roads. While these reports can contribute to safer driving, vehicular ad hoc networks suffer from various security threats; a major one is Sybil attacks. In these attacks, an individual attacker can pretend as several vehicles that report a false event. In this paper, we propose a secure event‐reporting scheme that is resilient to Sybil attacks and preserves the privacy of drivers. Instead of using asymmetric key cryptography, we use symmetric key cryptography to decrease the computation overhead. We propose an efficient pseudonym generation technique. The vehicles receive a small number of long‐term secrets to compute pseudonyms/keys to be used in reporting the events without leaking private information about the drivers. In addition, we propose a scheme to identify the vehicles that use their pool of pseudonyms to launch Sybil attacks without leaking private information to road side units. We also study a strong adversary model assuming that attackers can share their pool of pseudonyms to launch colluding Sybil attacks. Our security analysis and simulation results demonstrate that our scheme can detect Sybil attackers effectively with low communication and computation overhead. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

“…Location verification schemes are used to detect Sybil attacks. The underline idea is that the Sybil attacker cannot be physically located at more than one location at the same time.…”

Section: Related Workmentioning

confidence: 99%

“…Then, the locations far from the cluster bounds are accused of Sybil attack. In , the RSUs are equipped with a directional antenna that enables them to beamform the packets to a certain location. The RSU sends a challenge packet to the suspected vehicle at its expected location.…”

Section: Related Workmentioning

confidence: 99%

A secure and privacy-preserving event reporting scheme for vehicular Ad Hoc networks

Rabieh

Mahmoud

Azer

et al. 2015

Security Comm. Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…To authenticate a message, the SM signs the message with its private key and a digital signature algorithm. The verifier of the message's signature first verifies the certificate, and then verifies the signature with the signer's public key (extracted from the certificate) and signature verification algorithm [7], [8], [9]. When a certificate is issued, its lifetime is limited by an expiration date.…”

Section: Introductionmentioning

confidence: 99%

Scalable Certificate Revocation Schemes for Smart Grid AMI Networks Using Bloom Filters

Rabieh

Mahmoud

Akkaya

et al. 2017

IEEE Trans. Dependable and Secure Comput.

Self Cite

View full text Add to dashboard Cite

Given the scalability of the Advanced Metering Infrastructure (AMI) networks, maintenance and access of certificate revocation lists (CRLs) pose new challenges. It is inefficient to create one large CRL for all the smart meters (SMs) or create a customized CRL for each SM since too many CRLs will be required. In order to tackle the scalability of the AMI network, we divide the network into clusters of SMs, but there is a tradeoff between the overhead at the certificate authority (CA) and the overhead at the clusters. We use Bloom filters to reduce the size of the CRLs in order to alleviate this tradeoff by increasing the clusters' size with acceptable overhead. However, since Bloom filters suffer from false positives, there is a need to handle this problem so that SMs will not discard important messages due to falsely identifying the certificate of a sender as invalid. To this end, we propose two certificate revocation schemes that can identify and nullify the false positives. While the first scheme requires contacting the gateway to resolve them, the second scheme requires the CA additionally distribute the list of certificates that trigger false positives. Using mathematical models, we have demonstrated that the probability of contacting the gateway in the first scheme and the overhead of the second scheme can be very low by properly designing the Bloom filters. In order to assess the scalability and validate the mathematical formulas, we have implemented the proposed schemes using Visual C. The results indicate that our schemes are much more scalable than the conventional CRL and the mathematical and simulation results are almost identical. Moreover, we simulated the distribution of the CRLs in a wireless mesh-based AMI network using ns-3 network simulator and assessed its distribution overhead.

show abstract

“…In Vehicular Ad Hoc Networks (VANETs), onboard units are installed in vehicles to enable them to communicate with each other and with roadside units (RSUs) installed along the roads [1], [2]. VANETs have received extensive attention from both industry and academia due to the need for better and safer driving conditions.…”

Section: Introductionmentioning

confidence: 99%

Efficient Privacy-Preserving Chatting Scheme with Degree of Interest Verification for Vehicular Social Networks

Rabieh¹,

Mahmoud²,

Siraj³

et al. 2014

2015 IEEE Global Communications Conference (GLOBECOM)

Self Cite

View full text Add to dashboard Cite

Wireless communication capabilities of Vehicular Ad Hoc Networks (VANETs) have been utilized in various cutting-edge applications such as Vehicular Social Networks (VSNs). One of the benefits of VSNs is sharing of common-interest information among vehicle drivers. Drivers may benefit from identifying neighbors that have interest common with them alongwith the extent of their interest. However, there are some privacy issues that should be addressed. Revealing the nature and degree of interests (DOI) of drivers can be in violation of their privacy. In this paper, we propose an efficient chatting scheme among drivers that preserves such privacy. We use attribute based encryption (ABE) technique for anonymous common interest verification and homomorphic encryption technique for anonymous DOI verification. Moreover, we propose an efficient search mechanism to enable vehicles to check if they have common interests with low computation and communication overhead. To secure conversation, a key agreement protocol is used to enable the drivers that have the same interest and the desired DOI to establish a shared secret key. Our extensive evaluations demonstrate that our scheme can successfully preserve drivers' privacy with low communication and computation overhead.

show abstract

Cross-layer scheme for detecting large-scale colluding Sybil attack in VANETs

Cited by 42 publications

References 11 publications

A secure and privacy-preserving event reporting scheme for vehicular Ad Hoc networks

A secure and privacy-preserving event reporting scheme for vehicular Ad Hoc networks

Scalable Certificate Revocation Schemes for Smart Grid AMI Networks Using Bloom Filters

Efficient Privacy-Preserving Chatting Scheme with Degree of Interest Verification for Vehicular Social Networks

Contact Info

Product

Resources

About