The vehicles in the fifth-generation (5G)-enabled vehicular networks exchange the data about road conditions, since the message transmission rate and the downloading service rate have been considerably brighter. The data shared by vehicles are vulnerable to privacy and security issues. Notably, the existing schemes require expensive components, namely a road-side unit (RSU), to authenticate the messages for the joining process. To cope with these issues, this paper proposes a provably secure efficient data-sharing scheme without RSU for 5G-enabled vehicular networks. Our work included six phases, namely: TA initialization (TASetup) phase, pseudonym-identity generation (PIDGen) phase, key generation (KeyGen) phase, message signing (MsgSign) phase, single verification (SigVerify) phase, and batch signatures verification (BSigVerify) phase. The vehicle in our work has the ability to verify multiple signatures simultaneously. Our work not only achieves privacy and security requirements but also withstands various security attacks on the vehicular network. Ultimately, our work also evaluates favourable performance compared to other existing schemes with regards to costs of communication and computation.

No abstract

The security and privacy concerns in vehicular communication are often faced with schemes depending on either elliptic curve (EC) or bilinear pair (BP) cryptographies. However, the operations used by BP and EC are time-consuming and more complicated. None of the previous studies fittingly tackled the efficient performance of signing messages and verifying signatures. Therefore, a chaotic map-based conditional privacy-preserving authentication (CM-CPPA) scheme is proposed to provide communication security in 5G-enabled vehicular networks in this paper. The proposed CM-CPPA scheme employs a Chebyshev polynomial mapping operation and a hash function based on a chaotic map to sign and verify messages. Furthermore, by using the AVISPA simulator for security analysis, the results of the proposed CM-CPPA scheme are good and safe against general attacks. Since EC and BP operations do not employ the proposed CM-CPPA scheme, their performance evaluation in terms of overhead such as computation and communication outperforms other most recent related schemes. Ultimately, the proposed CM-CPPA scheme decreases the overhead of computation of verifying the signatures and signing the messages by 24.2% and 62.52%, respectively. Whilst, the proposed CM-CPPA scheme decreases the overhead of communication of the format tuple by 57.69%.

The privacy and security vulnerabilities in fifth-generation (5G)-enabled vehicular networks are often required to cope with schemes based on either bilinear pair cryptography (BPC) or elliptic curve cryptography (ECC). Nevertheless, these schemes suffer from massively inefficient performance related to signing and verifying messages in areas of the high-density traffic stream. Meanwhile, adversaries could launch side-channel attacks to obtain sensitive data protected in a tamper-proof device (TPD) to destroy the system. This paper proposes a Chebyshev polynomial-based scheme for resisting side-channel attacks in 5G-enabled vehicular networks. Our work could achieve both important properties of the Chebyshev polynomial in terms of chaotic and semi-group. Our work consists of five phases: system initialization, enrollment, signing, verification, and pseudonym renew. Moreover, to resist side-channel attacks, our work renews periodically and frequently the vehicle’s information in the TPD. Security analysis shows that our work archives the privacy (pseudonym identity and unlikability) and security (authentication, integrity, and traceability) in 5G-enabled vehicular networks. Finally, our work does not employ the BPC or the ECC; its efficiency performance outperforms other existing recent works, making it suitable for use in vehicular networks.

Intracranial hemorrhaging is considered a type of disease that affects the brain and is very dangerous, with high-mortality cases if there is no rapid diagnosis and prompt treatment. CT images are one of the most important methods of diagnosing intracranial hemorrhages. CT images contain huge amounts of information, requiring a lot of experience and taking a long time for proper analysis and diagnosis. Thus, artificial intelligence techniques provide an automatic mechanism for evaluating CT images to make a diagnosis with high accuracy and help radiologists make their diagnostic decisions. In this study, CT images for rapid detection of intracranial hemorrhages are diagnosed by three proposed systems with various methodologies and materials, where each system contains more than one network. The first system is proposed by three pretrained deep learning models, which are GoogLeNet, ResNet-50 and AlexNet. The second proposed system using a hybrid technology consists of two parts: the first part is the GoogLeNet, ResNet-50 and AlexNet models for extracting feature maps, while the second part is the SVM algorithm for classifying feature maps. The third proposed system uses artificial neural networks (ANNs) based on the features of the GoogLeNet, ResNet-50 and AlexNet models, whose dimensions are reduced by a principal component analysis (PCA) algorithm, and then the low-dimensional features are combined with the features of the GLCM and LBP algorithms. All the proposed systems achieved promising results in the diagnosis of CT images for the rapid detection of intracranial hemorrhages. The ANN network based on fusion of the deep feature of AlexNet with the features of GLCM and LBP reached an accuracy of 99.3%, precision of 99.36%, sensitivity of 99.5%, specificity of 99.57% and AUC of 99.84%.

Vehicular fog computing enabled by the Fifth Generation (5G) has been on the rise recently, providing real-time services among automobiles in the field of smart transportation by improving road traffic safety and enhancing driver comfort. Due to the public nature of wireless communication channels, in which communications are conveyed in plain text, protecting the privacy and security of 5G-enabled vehicular fog computing is of the utmost importance. Several existing works have proposed an anonymous authentication technique to address this issue. However, these techniques have massive performance efficiency issues with authenticating and validating the exchanged messages. To face this problem, we propose a novel anonymous authentication scheme named ANAA-Fog for 5G-enabled vehicular fog computing. Each participating vehicle’s temporary secret key for verifying digital signatures is generated by a fog server under the proposed ANAA-Fog scheme. The signing step of the ANAA-Fog scheme is analyzed and proven secure with the use of the ProfVerif simulator. This research also satisfies privacy and security criteria, such as conditional privacy preservation, unlinkability, traceability, revocability, and resistance to security threats, as well as others (e.g., modify attacks, forgery attacks, replay attacks, and man-in-the-middle attacks). Finally, the result of the proposed ANAA-Fog scheme in terms of communication cost and single signature verification is 108 bytes and 2.0185 ms, respectively. Hence, the assessment metrics section demonstrates that our work incurs a little more cost in terms of communication and computing performance when compared to similar studies.

No abstract

On the Ethereum network, users communicate with one another through a variety of different accounts. Pseudo-anonymity was enforced over the network to provide the highest level of privacy. By using accounts that engage in fraudulent activity across the network, such privacy may be exploited. Like other cryptocurrencies, Ethereum blockchain may exploited with several fraudulent activities such as Ponzi schemes, phishing, or Initial Coin Offering (ICO) exits, etc. However, the identification of parameters with abnormal account characteristics is not an easy task and requires an intelligent approach to distinguish between normal and fraudulent activities. Therefore, this paper has attempted to solve this a problem by using machine learning techniques to introduce a robust approach that can detect fraudulent accounts on Ethereum. We have used a K-Nearest Neighbor, Random Forest and XGBoost over a collected dataset of 4,681 instances along with 2,179 fraudulent accounts associated and 2,502 regular accounts. The XGBoost, RF, and KNN techniques achieved average accuracies of 96.80 %, 94.8 8%, and 87.85% and an average AUC of 0.995, 0.99 and 0.93, respectively.