Search

In Intelligent transportation system (ITS) applications, such as road safety and traffic monitoring, useful information is frequently gathered and transmitted to the management center for analysis, to provide a wide range of control, communication, and management measures. However, privacy of users must be preserved, since data transmitted by users may reveal sensitive private information such as location, travel route, etc. In this paper, we propose a privacy-preserving data aggregation scheme for ITS applications. The proposed scheme employs the combination of modified Paillier cryptosystem, Chinese Remainder theorem, Boneh short signature, and hash function operations not only to aggregate data of heterogeneous vehicles into one but also to provide fault resilience in a scenario when some devices are malfunctioning and not reporting to the management center. In the proposed scheme, each vehicle collects its data and computes a one-time secret key shared with the gateway to mask its data. We develop a hash function-based technique to ensure the authenticity and integrity of the aggregated encrypted data without revealing the individual data. Security analysis shows that the proposed scheme is secure, privacy-preserving, and supports conditional traceability. Extensive performance analysis and comparison demonstrate that the scheme is significantly more efficient than the related schemes. [ABSTRACT FROM AUTHOR]

• ECC-based certificateless signature scheme with compact aggregation. • Fine-grained access control using attribute-based encryption and signature scheme. • Proof of security in the random oracle model (ROM). • Efficient, secure, and privacy-preserving for practical deployment. Very recently, a number of intelligent applications have evolved in smart cities such as smart grid, smart parking, smart waste management, smart manufacturing, smart home, and smart health, making our cities more smarter. In the context of smart health, smart devices are employed to collect and transmit biomedical information to a medical server, allowing medical practitioners to give better and improved healthcare services. However, considering the sensitive nature of the medical data, any illegal access may have devastating effects on the patient's health condition. A lightweight privacy-preserving authentication and fine-grained access control scheme for smart health known as PAASH is proposed. In PAASH, a new ultraefficient certificateless signature scheme with compact aggregation is developed to achieve source authentication and data integrity. To achieve efficient user authorization and data confidentiality, a privacy-preserving access control technique using the developed aggregate signature and ciphertext-policy attribute-based encryption (CP-ABE) is implemented. An analysis of PAASH reveals that it can provide desirable privacy and security measures in smart health. Moreover, the formal security demonstrated in the random oracle model (ROM) shows that PAASH is semantically secure under the intractability of the Discrete Logarithm Problem (DLP). The performance evaluation shows that PAASH is par excellence practically suitable for smart health. [ABSTRACT FROM AUTHOR]

Certificateless aggregate signature (CL-AS) is a digital signature technique used to achieve improved performance in resource-constrained environments like vehicular ad hoc networks (VANETs) by eliminating the certificate issue in the traditional public key cryptography (PKC), addressing the key escrow problem in identity-based PKC, and utilizing the efficiency benefits of aggregate signature. Recently, an efficient CL-AS scheme for VANETs was proposed which the authors claimed to be existentially secure against forgery attacks in the random oracle model. In this paper, the scheme was analyzed and found to be insecure under existing security model. Consequently, we propose a new efficient certificateless aggregate signature scheme for VANETs applications based on elliptic curve cryptography. The proposed scheme does not only meet the privacy and security requirements for VANETs, but supports batch verification, autonomy, and conditional privacy preservation. In addition, the proposed scheme is provably secure against existential forgery on adaptive chosen message attack in the random oracle model based on the hardness assumption of the elliptic curve discrete logarithm problem. Extensive efficiency analysis demonstrates that the performance of the proposed scheme exceeds those of the recent related schemes in terms of computation cost and communication overhead. [ABSTRACT FROM AUTHOR]

In Nigeria road transport system, the conventional paper-based manifest allows passengers' information to be collected and used for emergency purposes. However, the privacy of passengers is not preserved because an adversary can easily obtain these sensitive information for malicious intentions such as extortion, kidnapping, route monitoring, assassination, spying, and so forth. To address this problem, we develop a provably secure scalable lightweight data management scheme for achieving data privacy, authenticity, integrity, and confidentiality in road transport systems. An efficient authentication scheme is developed to achieve data authenticity and integrity, and a novel perturbation to guarantee data privacy and confidentiality. We show that the scheme is provably secure in the random oracle model based on Discrete Logarithm Assumption (DLA). In addition, the scheme achieves strong anonymity, conditional traceability and resistance to various attacks, and provides countermeasure against privilege escalation. The novel perturbation prevents gleaning by adversaries and ensures perfect reconstruction of original data from the perturbed data. Compared with related schemes, the performance evaluation and comparisons show an improved efficiency in terms of computation and communication overheads. Therefore, the proposed scheme is suitable for practical applications in the road transport system in Nigeria to overcome the weaknesses and limitations of the paper manifest. [ABSTRACT FROM AUTHOR]

The pervasiveness of the Internet has attracted a new paradigm of technology known as Internet-of-Things (IoT). The numerous devices connected to IoT generate huge amount of data which must be protected and efficiently verified by the data center. To achieve big data authentication in IoT, several certificateless aggregate signature schemes have been proposed. However, their design is based on bilinear pairing operation, which is known to be mathematically complex. In this work, we propose a secure and efficient data aggregation scheme for IoT known as Efficient Data Aggregation Scheme (EDAS) without using complex mathematical operation. The performance analysis shows that EDAS is computationally more efficient than related schemes. [ABSTRACT FROM AUTHOR]

Fog computing is a qualifiedly roseate technology introduced to support latency-sensitive and mission-critical applications by bringing resources closer to the end users. To exploit the full potentials of this auspicious technology, it is important to select optimal fog nodes for secured service provisioning. Therefore, in this work, an optimal fog node selection is formulated as a multi-objective optimization problem. To solve this problem, an efficient selection strategy based on improved particle swarm optimization (PSO) and modified firefly algorithm (FA) is developed. This study considers two important objectives that have not been optimized in the previous works: trust and rate of sojourn, in addition to remaining node capacity and energy consumption. The linear weighted-sum approach is used to aggregate the individual objective functions, after which the Best–worst method (BWM) is used to determine the weight vector of the aggregated function. The impact of the variation in the weight values of the most sensitive objective indicate that in the worst-case scenario, the proposed model is robust and insensitive with an improvement of about 42.16%–50.02% over the related methods. Moreover, we conduct an experimental simulation of the proposed selection strategy as well as comparative analysis with the state-of-the-art algorithms using six performance metrics. The results show that the proposed hybrid PSO-FA achieves a higher accuracy and faster convergence. The proposed solution also records an improvement of about 18.64%–69.45% in resource utilization, 10.94%–40.45% in energy consumption, 12.50%–75% in trust violation, 4.94%–31.12% in computation delay, and 24.71%–37.7% in makespan over the related advanced algorithms. [ABSTRACT FROM AUTHOR]

Internet of vehicle (IoV) is an extension of vehicular ad hoc network (VANET) used in smart cities to achieve a more reliable information sharing and communication among smart vehicles, roadside units (RSUs), and people as well as improved traffic safety and better driving experience. In VANET, communications among vehicles and between vehicles and RSUs are done using the dedicated short range communication (DSRC) protocol. However, this technology faces some drawbacks including high latency, limited spectrum, poor scalability and reliability, and network congestion. To this end, many researchers have explored the complementary benefits of long term evolution-vehicle (LTE-V) such as higher capacity and mobility supports, better spectral efficiency, improved quality of service (QoS), and inter-operability to support vehicle-to-everything (V2X) communication. The information transmitted in LTE-V must be secured and the privacy of users protected before the deployment of this auspicious technology. In this research article, a lightweight certificateless authentication and group key agreement for LTE-V is proposed. The designed authentication scheme is constructed without using time-consuming operations. A batch verification technique which reduces the computational burden on the RSU when required to authenticate prodigious messages is introduced. The developed group key distribution mechanism achieves group communication and supports dynamic updating with negligible computation. We prove that the proposed scheme is semantically secure in the random oracle model (ROM) based on the intractability of the discrete logarithm problem (DLP), and demonstrate that it meets all the desired privacy and security requirements. An extensive analysis of the performance shows that the scheme is substantially efficient compared with the state-of-the-art schemes. The performance evaluation through experimental simulation further shows the superiority of the proposed scheme over the traditional IEEE 802.11p-based schemes. [Display omitted] [ABSTRACT FROM AUTHOR]

In wireless networks, seamless roaming allows a mobile user (MU) to utilize its services through a foreign server (FS) when outside his home server (HS). However, security and efficiency of the authentication protocol as well as privacy of MUs are of great concern to achieve an efficient authentication protocol. Conventionally, authentication involves the participation of three entities (MU, HS, and FS); however, involving an HS in the authentication process incurs heavy computational burden on it due to huge amount of roaming requests. Moreover, wireless networks are often susceptible to various forms of passive and active attacks. Similarly, mobile devices have low processing, communication, and power capabilities. In this paper, we propose an efficient, secure, and privacy-preserving lightweight authentication protocol for roaming MUs in wireless networks without engaging an HS. The proposed authentication protocol uses unlinkable pseudo-IDs and lightweight time-bound group signature to provide strong user anonymity, and a cost-effective cryptographic scheme to achieve security of the authentication protocol. Similarly, we implement a better billing system for MUs and a computationally efficient revocation scheme. Our analysis shows that the protocol has better performance than other related authentication protocols in wireless communications in terms of security, privacy, and efficiency. [ABSTRACT FROM AUTHOR]