CryptoSeekerLab

摘要：As demand for data privacy and secure communication grows in areas like the Internet of Things, healthcare, and smart city infras tructure. A reliable way to achieve these requirements is key agreement. Current key agreement protocols often struggle to handle the wide gap in computing power between terminal devices and servers. To tackle this issue, this paper proposes a novel Asymmetric Three-Party Key Agree ment Protocol Based on Secure Multiparty Computation. By merging the Diffie-Hellman key exchange mechanism with the complexity of Sub set Product Problem (NP-complete), the scheme strategically offloads heavy computation to high-performance nodes, while terminals with lim ited resources only carry out necessary lightweight operations. This ap proach significantly reduces the overall computational and communica tion load without compromising security in the key negotiation process. Meanwhile, the design incorporates a trusted third party (TTP) solely for assisting in key generation and final result computation, enhancing anonymity and privacy protection without revealing any party’s data sources.

作者：Shanchuan Pang, Quanrun Li, Jiaming Wen and Hu Ma

关键词：Trusted Third Party，Asymmetric Computing Resources，Key Exchange Protocol，Subset Product Problem

摘要：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%.

作者：Long Li, Chingfang Hsu, Jianqun Cui, Man Ho Au, Lein Harn, Quanrun Li

关键词：Authentication and key agreement,Chebyshev chaotic map, Chinese remainder theorem,Resource-asymmetric smart environments,Multi-IoT-device Multi-IoT-device