.png){kind=icon}
返回
Block Design-Based Key Agreement for Group Data Sharing in Cloud Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/TDSC.2017.2725953.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Data sharing in cloud computing enables multiple participants to freely share the group data, which improves the efficiency of work in cooperative environments and has widespread potential applications. However, how to ensure the security of data sharing within a group and how to efficiently share the outsourced data in a group manner are formidable challenges. Note that key agreement protocols have played a very important role in secure and efficient group data sharing in cloud computing. In this paper, by taking advantage of the symmetric balanced incomplete block design (SBIBD), we present a novel block design-based key agreement protocol that supports multiple participants, which can flexibly extend the number of participants in a cloud environment according to the structure of the block design. Based on the proposed group data sharing model, we present general formulas for generating the common conference key $\mathcal {K}$K for multiple participants. Note that by benefiting from the $(v,k + 1,1)$(v,k+1,1)-block design, the computational complexity of the proposed protocol linearly increases with the number of participants and the communication complexity is greatly reduced. In addition, the fault tolerance property of our protocol enables the group data sharing in cloud computing to withstand different key attacks, which is similar to Yis protocol.
Keyword:
Protocols
Cloud computing
Fault tolerance
Fault tolerant systems
Data models
Cryptography
Key agreement protocol
symmetric balanced incomplete block design (SBIBD)
data sharing
cloud computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.4K
被引数:
9.6K
机构
引用论文
.png){kind=icon}
分享收藏Probing the Most Stable Isomer of Zirconium Bis(phenoxy-imine) Cation: A Computational Investigation
PREAI
分享收藏
查看更多内容