4.7 Article

Fast Secure and Anonymous Key Agreement Against Bad Randomness for Cloud Computing

期刊

IEEE TRANSACTIONS ON CLOUD COMPUTING
卷 10, 期 3, 页码 1819-1830

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCC.2020.3008795

关键词

Cloud computing; secure channel; anonymous authentication; bad randomness resistance; zero round trip time

资金

  1. National Key R&D Program of China [2017YFB0802000]
  2. NSF of China [61972159, 61572198, 61321064]
  3. Open Research Fund of Engineering Research Center of Software/Hardware Co-design Technology and Application, Ministry of Education (East China Normal University)
  4. Fundamental Research Funds for the CentralUniversities

向作者/读者索取更多资源

This paper proposes a novel protocol for secure channel establishment in cloud computing, addressing challenges faced by existing protocols, including low connection delay, certificate management problem, user privacy, and randomness issues.
In cloud computing, resources are usually in cloud service provider's network and typically accessed remotely by the cloud users via public channels. Key agreement enables secure channel establishment over a public channel for the secure communications between a cloud user and a cloud service provider. Existing key agreement protocols for cloud computing suffer from some challenges, e.g., realizing low connection delay, eliminating certificate management problem, enhancing user privacy and avoiding bad randomness. To tackle these challenges, we propose a certificateless O-RTT anonymous AKA protocol against bad randomness for secure channel establishment in cloud computing. As a 0-RTT protocol, it significantly speeds up the efficiency of the secure channel establishment process. Further, our protocol does not need for the certificates to bind a public key with an entity's identity and hence solves the certificate management problem. Finally, concrete security analysis of the protocol is also proposed. The protocol not only satisfies the traditional security attributes (e.g., known-key security, unknown key-share), but also strong security guarantees, i.e., user privacy and bad randomness resistance.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据