Pandi Vijayakumar

Computationally Efficient Privacy Preserving Anonymous Mutual and Batch Authentication Schemes for Vehicular Ad Hoc Networks

In the near future, it is envisioned that vehicular Ad hoc networks (VANETs) will be making use of long-distance communication techniques, such as cellular networks and Worldwide Interoperability for Microwave Access (WiMAX), to get instant Internet access for making the communication between vehicles and fixed road side infrastructure. Moreover, VANETs will also make use of short-distance communication methods, such as Dedicated Short-Range Communications (DSRC) and Wireless Fidelity (Wi-Fi) to perform short range communication between vehicles in an ad hoc manner. This Internet connection can provide facility to other vehicles to send traffic related messages, collisions, infotainment messages other useful safety alerts. In such a scenario, providing authentication between vehicle to infrastructure and vehicle to vehicle is a challenging task. In order to provide this facility, in this paper, we propose a computationally efficient privacy preserving anonymous authentication scheme based on the use of anonymous certificates and signatures for VANETs in making them an important component of Internet of Things (IoT) and the development of smart cities. Even though there are several existing schemes available to provide such anonymous authentication based on anonymous certificates and signatures in VANETs, the existing schemes suffer from high computational cost in the certificate revocation list (CRL) checking process and in the certificate and the signature verification process. Therefore, it is not possible to meet the requirement of verifying a large number of messages per second in VANETs which would lead to increased message loss. Hence, we use a computationally efficient anonymous mutual authentication scheme to validate the message source as well as to ensure the integrity of messages along with a conditional tracking mechanism to trace the real identity of misbehaving vehicles and revoke them from VANET in the case of dispute. In this paper, we also introduce an efficient anonymous batch authentication protocol to be used in IoT for Road Side Units (RSUs) to authenticate multiple vehicles simultaneously rather than one after the other such that the total authentication time can be dramatically reduced. This proposed scheme is implemented and the performance analysis shows that our scheme is more efficient in terms of certificate and signature verification cost, while preserving conditional privacy in VANETs.

Chinese remainder theorem based centralised group key management for secure multicast communication

Designing a centralised group key management with minimal computation complexity to support dynamic secure multicast communication is a challenging issue in secure multimedia multicast. In this study, the authors propose a Chinese remainder theorem-based group key management scheme that drastically reduces computation complexity of the key server. The computation complexity of key server is reduced to O (1) in this proposed algorithm. Moreover, the computation complexity of group member is also minimised by performing one modulo division operation when a user join or leave operation is performed in a multicast group. The proposed algorithm has been implemented and tested using a key-star-based key management scheme and has been observed that this proposed algorithm reduces the computation complexity significantly.

Time efficient secure DNA based access control model for cloud computing environment

The uses of Big Data (BD) are gradually increasing in many new emerging applications, such as Facebook, eBay, Snapdeal, etc. BD is a term, which is used for describing a large volume of data. The data security is always a big concern of BD. Besides the data security, other issues of BD are data storage, high data accessing time, high data searching time, high system overhead, server demand, etc. In this paper, a new access control model has been proposed for BD to solve all these issues, where fast accessing of the large volume of data are provided based on the data size Here, a long 512-bit Deoxyribonucleic Acid (DNA) based key sequence has been used for improving the data security, and it is secured against the collision attack, man-in-the-middle attack, internal attack, etc. The proposed scheme is evaluated in terms of both theoretical and experimental results, which show the proficiency of the proposed scheme over the existing schemes. The proposed scheme uses data sizes for efficient and secure data accessing.To improve the data security, a long 512-bit key has been used in the proposed scheme.Key generation and key retrieval time at the data owners side and users side are respectively less.Experimental results and theoretical discussions prove the efficiency of the proposed scheme.

An efficient group key agreement protocol for secure P2P communication

The efficient design of a distributed group key management for a peer to peer P2P network with minimal computation complexity in dynamic secure group communication is a challenging issue. This is because of the absence of a centralized coordinator. In order to provide this facility, a self-composed distributed group key management framework is proposed for secure P2P communication. In this proposed work, group key computation is performed using Chinese remainder theorem and secure communication is performed through RSA encryption algorithm. This self-composed key management is a one round protocol in which a shared group key is generated using the public key of each individual user, and it is derived from the respective private key. The main advantage of the group key management scheme proposed in this paper is that it reduces the computation complexity of the peer users to O1. This reduction in computation complexity is achieved by performing one addition and multiplication operation during a single member join and one subtraction operation during a single member leave operation. The proposed algorithm has been implemented and analyzed with well-known existing distributed group key management protocols and observed that it reduces the computation complexity significantly. Copyright

Provably Secure Identity-Based Signcryption Scheme for Crowdsourced Industrial Internet of Things Environments

Nowadays, the Internet of Things (IoT) and cloud computing have become more pervasive in the context of the industry as digitization becomes a business priority for various organizations. Therefore, industries outsource their crowdsourced Industrial IoT (IIoT) data in the cloud in order to reduce the cost for sharing data and computation. However, the privacy of such crowdsourced data in this environment has attracted wide attention across the globe. Signcryption is the significant cryptographic primitive that meets both requirement of authenticity and confidentiality of crowdsourced data among users/industries, and thus, it is ideal for ensuring secure authentic data storage and transmission in industrial crowdsourcing environments. In this paper, we introduce a new identity-based signcryption (IBSC) scheme using bilinear pairing for IIoT deployment. Besides, two hard problems are studied, called as, modified bilinear Diffie–Hellman inversion (MBDHI) assumption and modified bilinear strong Diffie–Hellman (MBSDH) assumption. The rigorous security analysis demonstrates that our IBSC scheme for IIoT is provably secure based on the intractability of decisional-MBDHI and MBSDH assumptions under formal security model without considering the concept of the random oracle. The performance comparison with other signcryption schemes shows satisfactory results. Thus, our IBSC scheme is appropriate for IIoT crowdsourcing environments, and also applicable for low-bandwidth communications.

Mobile agent based secure internet business using access key hierarchy management scheme

Abstract To access the distributed web applications in a computer network, mobile agents have long been proved to be a successful tool. The power of a mobile agent lies in migrating to the destination hosts directly for retrieving the information under consideration. Since many businesses run their sensitive data in distributed servers, it has been a mandatory demand that before the information is downloaded, the mobile agents need to be authenticated and authorized. To provide such authentication, digital signatures based on well known algorithms such as RSA, ECC have been proposed in the past. The main drawback of these works is that the they are not computationally efficient during the encryption and decryption of keys which are used to encrypt and decrypt the content. Thus, the major contribution of our work is to reduce the computational complexity for the authentication of mobile agents through a new hierarchical access management scheme. The computational costs are reduced during the key derivation and signature verification processes. The proposed work not only reduces the computational time, but provides flexibility to give fine grained access to the mobile agents to access only the authorized files. Extensive simulations prove that our approach significantly reduces the computational overhead than the recent works in the literature and hence this approach is best suited for implementation in the distributed web environments.

EAAP: Efficient Anonymous Authentication With Conditional Privacy-Preserving Scheme for Vehicular Ad Hoc Networks

Providing an efficient anonymous authentication scheme in vehicular ad hoc networks (VANETs) with low computational cost is a challenging issue. Even though, there are some existing schemes to provide anonymous authentication, the existing schemes suffer from high computational cost in the certificate and the signature verification process, which leads to high message loss. Therefore, they fail to meet the necessity of verifying hundreds of messages per second in VANETs. In our scheme, we propose an efficient anonymous authentication scheme to avoid malicious vehicles entering into the VANET. In addition, the proposed scheme offers a conditional tracking mechanism to trace the vehicles or roadside units that abuse the VANET. As a result, our scheme revokes the privacy of misbehaving vehicles to provide conditional privacy in a computationally efficient way through which the VANET entities will be anonymous to each other until they are revoked from the VANET system. Moreover, the proposed scheme is implemented and the performance analysis shows that our scheme is computationally efficient with respect to the certificate and the signature verification process by keeping conditional privacy in VANETs.

Computationally efficient privacy preserving authentication and key distribution techniques for vehicular ad hoc networks

The incorporation of electronics by embedding the relevant sensors in the physical devices in home and office, vehicles of all types, buildings in the smart cities and in all possible spheres of life form a network of devices termed as internet of things (IoT). It is being realized that vehicular ad-hoc networks (VANETs) which are responsible for the reliable and secure communication among vehicles is a primary area of research in IoT and hence ensuring security in this area is essential. Thus, this work introduces a novel approach to improve the existing authentication support to VANETs. In this proposed framework, first an anonymous authentication approach for preserving the privacy is proposed which not only performs the vehicle user’s anonymous authentication but preserves the message integrity of the transmitting messages as well. Although many anonymous authentication schemes have been proposed in VANETs until now, the existing schemes suffer from a high computation cost during the signature and certificate verification process which leads to delayed authentication. Consequently, the vehicles and roadside units (RSUs) cannot authenticate more number of vehicles per second in VANETs. Second, an efficient anonymous group key distribution protocol is proposed in this paper for securely distributing the group key to the group of vehicles in the communication range of an RSU. The RSUs can send location based information to the group of vehicles in a secure manner using this group key. Experimental analysis portrays that the results of this new privacy preserving anonymous authentication and key management schemes are promising and efficient with regard to signature verification cost and computational cost in comparison with the existing schemes.

An efficient secure communication for healthcare system using wearable devices

Abstract In the present healthcare scenario, mobile phones play a vital role in performing secure text communications between different entities such as doctors, patients, hospitals, ambulances and other healthcare systems. Therefore, an efficient alert system for sending the private and confidential SMS messages has been proposed in this research work to send SMS alerts to healthcare entities from a heart patient. Very few research works have been proposed for multicast communication in SMS and each research work exposes some drawbacks as well. Since the proposed approach needs only one mod operation, the computational overhead of the proposed protocol is very low. Thus, the main advantage of this proposed work is that the messages are sent in a computationally efficient way and the experimental results confirm that the proposed work ensures end-to-end security with lower computational and communication overheads than the recent works in the literature.

Nth Order Binary Encoding with Split-Protocol

TocopeupwiththeBigDataexplosion,theNthOrderBinaryEncoding(NOBE)algorithmwith theSplit-protocolhasbeenproposed.Intheearlierpapers,theapplicationSplit-protocolforsecurity, reliability,availability,HPChavebeendemonstratedandimplementedencoding.Thistechnologywill significantlyreducethenetworktraffic,improvethetransmissionrateandaugmentthecapacityfor datastorage.Inadditiontodatacompression,improvingtheprivacyandsecurityisaninherentbenefit oftheproposedmethod.ItispossibletoencodethedatarecursivelyuptoNtimesanduseaunique combinationofNOBE’sparameterstogenerateencryptionkeysforadditionalsecurityandprivacyfor dataontheflightoratastation.Thispaperdescribesthedesignandapreliminarydemonstrationof (NOBE)algorithm,servingasafoundationforapplicationimplementers.Italsoreportstheoutcomes ofcomputablestudiesconcerningtheperformanceoftheunderlyingimplementation. KEywORDS Adaptive Huffman Coding, Data Compression, Performance, Split-Encoding