In the smart grid, the various stakeholders can communicate securely and efficiently only if they employ a proper key distribution scheme. In recent years, a number of key distribution schemes have been proposed to be used in the context of the smart grid. However, some suffer from security challenges, some do not provide the smart meter anonymity, some require high communication and computational costs that make them less suitable for the resource-constrained smart meters, some are based on the public key infrastructure, and most of the newly published ones have the key escrow problem. Therefore, to remedy these challenges, in this paper, we propose an anonymous elliptic curve cryptography-based self-certified key distribution scheme that not only is free from the overhead of the certificate management and the key escrow issue, but also is more efficient than anonymous schemes in terms of both communication and computational costs. More significantly, we have implemented the cryptographic elements on two state-of-the-art ARM chips. First, a 32-bit ARM Cortex-M4 microcontroller as a candidate for the smart meter and second, a 64-bit Octa core ARM Cortex-A53 as a candidate for the service provider. We hope that the achieved results be beneficial for other future researches in this field.
In smart grid, key exchange protocols play a vital role in providing secure channels to read consumption reports from the smart meters. Thus far, several key exchange schemes have been proposed for the networked smart meters. However, for the first time, quite recently, Sha et al. have presented an interesting two-phase authentication and key agreement scheme that exclusively aims at the isolated smart meters. In their scheme, they have properly addressed the computationally-constrained smart meters by offering a lightweight key exchange protocol. Nevertheless, after meticulous observation, we found that their proposed scheme cannot resist the desynchronization attack and cannot provide the perfect forward secrecy. Moreover, there are some other weaknesses in their scheme. As a result, to tackle the existing security challenges, in this paper, by utilization of the extended Chebyshev chaotic maps, we propose an efficient anonymous password-authenticated key exchange protocol that not only is free from the limitations of Sha et al.'s scheme, but also provides the anonymity. The security analysis in the random oracle model and using the widely-accepted ProVerif tool besides the computational and communication costs comparison demonstrate that the proposed scheme has reached a proper level of efficiency without sacrificing the desired security properties.
17 September 2018 in IEEE Transactions on Parallel and Distributed Systems
Cloud computing is a widespread technology, which has attracted much attention nowadays. Among the many criteria that must be considered for data storage in the cloud, access control plays a vital role. Role-based access control (RBAC) is a well-known technique for secure data storage in the cloud. Since the traditional RBAC models are improper for open and decentralized environments, few works have integrated the trust concept into the RBAC model. Nevertheless, they have not fully addressed the required security metrics of a trust-based system. Therefore, in this paper, we first introduce the security goals that should be considered in an efficient trust-based system. Second, we propose a novel trust and reputation based RBAC model that not only can properly withstand the security threats of trust-based RBAC models, but also is scalable as it has reasonable computational cost. Third, we evaluate the proposed model using the famous trust network of advogato dataset. Eventually, we compare the proposed model with recently-published ones in terms of mean absolute error, indirect trust computational cost, and provided features. The achieved results are indicative of the priority and betterment of the proposed model to be employed in real cloud environments.