Abstract
Objective: Privacy in VANETs commands short-lived pseudonyms since the nodes are very mobile. It results in big computational overheads during secure communication between vehicles, which could place the safety of people and vehicles at risk. To overcome such a limitation, we are using the validation approach of pseudonyms based on Bloom Filter, which provides less computational overheads than other authentication procedures. A complete end-toend system is developed in three phases: authorization, clustering, encryption, and decryption phase, to establish secure transmission of data in VANETs.
Methods: The authorization phase uses Bloom’s Filter authentication based on the pseudonym scheme. Based on the distributed parameters related to vehicles, clusters of vehicles are created to save power and bandwidth in communications. These clusters are chained to the next cluster with the help of the cluster head to share the information. First, only authenticated vehicles that are regular travelers on the road segment are allowed to become part of the cluster. SMBF ensures that any vehicle that is not a frequent traveler on the given road segment is not taking part in the communication process. Clustering is used to ensure the speed of communication.
Results: The proposed scheme results are compared with other state-of-art techniques in VANETs. The analysis indicates that the storage and computational processing requirements are reduced by 28%, resulting in decreased communication costs.
Conclusion: The proposed authentication process stores the pseudonyms in the certificate authority database. Hence, more memory requirements are required to maintain this technique. Overall, the performance of SMBF needs to be tested under different types of attacks.
Keywords: ECDH, cryptography, Bloom’s Filter, RSA, clustering, pseudonym.
Graphical Abstract
[http://dx.doi.org/10.17485/ijst/2016/v9i47/106423]
[http://dx.doi.org/10.1109/MCOM.2008.4689254]
[Phoenix, USA. [http://dx.doi.org/10.1109/INFOCOM.2008.179]
[http://dx.doi.org/10.1090/S0025-5718-1987-0866109-5]
[http://dx.doi.org/10.1109/ACCESS.2021.3060046]
[http://dx.doi.org/10.1109/ICC.2009.5198637]
[http://dx.doi.org/10.1049/cp.2011.0769]
[http://dx.doi.org/10.1016/S1570-8705(03)00040-4]
[http://dx.doi.org/10.1109/IVS.2011.5940509]
[http://dx.doi.org/10.1109/IWCMC.2011.5982709]
[http://dx.doi.org/10.1049/iet-its.2015.0072]
[http://dx.doi.org/10.1002/dac.4111]
[http://dx.doi.org/10.1109/TITS.2015.2439292]
[http://dx.doi.org/10.1109/TITS.2016.2516027]
[http://dx.doi.org/10.1109/TPDS.2010.14]
[http://dx.doi.org/10.1109/JIOT.2014.2366120]
[http://dx.doi.org/10.1109/JSYST.2012.2231792]
[http://dx.doi.org/10.1109/VTCFall.2015.7391111]
[http://dx.doi.org/10.1109/ISCO.2015.7282299]
[http://dx.doi.org/10.1109/ICCSP.2016.7754429]
[http://dx.doi.org/10.1109/CCAA.2016.7813782]
[http://dx.doi.org/10.1109/WINCOM.2016.7777191]
[http://dx.doi.org/10.1109/TST.2016.7787005]
[http://dx.doi.org/10.1109/ICACCI.2016.7732079]
[http://dx.doi.org/10.1109/TVT.2015.2406877]
[http://dx.doi.org/10.1145/2069131.2069135]
[http://dx.doi.org/10.1016/j.jnca.2012.07.002]