The smart environment is a crucial application of the Internet of Things(IoT). Due to its growing security and efficiency needs, recent years have seen the proposal of numerous authentication and key agreement (AKA) protocols. Unfortunately, most of existing AKA protocols only support one-to-one AKA and rely on the elliptic curve cryptosystem, resulting in huge overhead. In addition, these protocols fail to consider the resource-asymmetric characteristics of this scenario. That is, the resources on the gateway side are abundant, while the resources on user sides and device sides are limited. In order to achieve efficient and secure one-to-many AKA establishment in this scenario, where one-to-many means that users can realize key agreements with multiple smart devices at the same time. For the first time, this paper uses the one-to-many computing structure of the Chinese Remainder Theorem (CRT) to design an efficient one-to-many AKA establishment, which is perfectly adapted to resource-asymmetric allocation in smart environments. Compared with existing solutions, this solution has the following advantages. Firstly, our protocol is suitable for resource-asymmetric environments, where the gateway acts as an intermediate node and uses rich resources to integrate multiple AKA requests. Secondly, the solution supports users to negotiate session keys with multiple smart devices at the same time. Thirdly, we prove the protocol’s security under the Real-or-Random (ROR) model. In addition, we perform formal security verification of the protocol using the Automated Validation of Internet Security Protocols and Applications(AVISPA) tool. Finally, the security and efficiency of this solution are superior to similar solutions. Specifically, our solution can meet 18 security and functionality requirements. Compared with the latest similar scheme, assuming that the number of smart devices is 10, our scheme reduces the computational cost by 75.75%. At the same time, in terms of communication cost, our protocol reduces it by 37.78%.

As Internet technology develops swiftly, the significance of privacy protection is escalating in the realms of e-commerce, e-government and software security. Due to the combination of the benefits of proxy signatures and blind signatures, the proxy blind signature scheme not only distributes the workload across application networks but also effectively safeguards the confidentiality of sensitive information. Additionally, the identity-based proxy blind signature protocol can avoid the problem of heavy certificate management and is widely used in electronic commerce and other scenarios. However, some identity-based proxy blind signature protocols that rely on the large integer factorization problem and the discrete logarithm problem are unable to withstand from attacks from quantum computers. Furthermore, current lattice-based proxy blind signature protocols offer only heuristic security and require three rounds of information exchange during the signing phase. In this paper, we introduce a new two-round identity-based proxy blind signature scheme based on lattices. This scheme utilizes a zero-knowledge proof protocol on lattices as its core component to develop an interactive two-round signature scheme that is free from security proof vulnerabilities. Additionally, we validate the security of the proposed protocol within the random oracle model and conduct a performance analysis.

As the promising next-generation power grid, the smart grid has developed rapidly in recent years. The smart grid enables energy to be stored and delivered more efficiently and safely, but user data’s integrity protection has been an important security issue in the smart grid. Although lots of digital signature protocols for the smart grid have been proposed to resolve this problem, they are vulnerable to quantum attacks. To deal with this problem, an efficient identity-based signature protocol on lattices is proposed in this paper. To improve our protocol’s efficiency, the tree of commitments is utilized. Moreover, a detailed performance evaluation of the proposed protocol is made. The performance analysis demonstrates that the potential utility of our protocol in the smart grid is huge.

As an important part of smart cities, vehicle ad hoc networks (VANETs) have attracted much attention from both industry and academia. In a VANET, generating a secure session key to facilitate subsequent data-in-transit transfer between two or more vehicles is crucial, which can be achieved by using an authenticated key agreement protocol. However, most of the existing identity-based two-party authenticated key agreement protocols have significant computational requirements or are known to be insecure. Thus, in this paper, a secure and efficient identity-based two-party authenticated key agreement protocol is presented by us. This protocol does not involve complex bilinear pairing computations and can generate a valid session key in two rounds. The security of the proposed protocol is proved in the eCK model which has better capability to describe a protocol’s security than the famous CK model, and it has been widely used in the security proof of ID-based key agreement protocols currently. Additionally, we also evaluate its performance for potential utility in a VANET.