会议名称：
Joint 14th IEEE Int Conf on Trust, Secur and Privacy in Comp and Commun / 13th IEEE Int Symposium on Parallel and Distributed Proc with Applications / 9th IEEE Int Conf on Big Data Science and Engineering (IEEE TrustCom-ISPA-BigDataSE)
会议时间：
AUG 20-22, 2015
会议地点：
Aalto Univ, Helsinki, FINLAND
会议主办单位：
Aalto Univ
关键词：
key management;rekeying;mult-privileged group communications;security
摘要：
In some group-oriented applications, users can access several data resources according to their respective willingness. So, how to effectively access the data resources is a challenge in multi-privileged group communications. Some key management schemes for hierarchical access control are proposed. In this paper, we discuss the challenges of key management. Then, we present a list of evaluation criteria for secure key management for multi-privileged group communications, and investigate the features of some typical schemes. The schemes can be divided into several classes according to some separate dimensions, such as the topology of key model, the rekeying method, the rekeying policy and the encryption method of data resources. We analyze them comparatively regarding to the secure distribution and renewal of key materials.
期刊：
Journal of Applied Science and Engineering,2014年17(1):81-92 ISSN：1560-6686
通讯作者：
Wang, G.-J.(csgjwang@csu.edu.cn)
作者机构：
[Zhou, Wei; Wang, Guo-Jun; Xu, Yang] School of Information Science and Engineering, Central South University, Changsha 410083, China;[Zhou, Wei] College of Information Science and Technology, Hunan Agriculture University, Changsha 410128, China
通讯机构：
School of Information Science and Engineering, Central South University, China
关键词：
Engineering;Chinese remainder theorem;Dynamic membership;Forward and backward securities;Group key management;Key management;Key management schemes;Multi-privileged groups;Multiway tree;Mobile telecommunication systems
摘要：
Key management becomes more difficult in multi-privileged communications due to the dynamic membership and the complex relations between users and resources. In this paper, we propose a novel key management scheme in which the key graph is based on multiway trees. Chinese remainder theorem is employed to combine some encrypted rekeying materials into a short message for rekeying. As a result, users can update affected keys through the rekeying material and one-way function by themselves. The security analysis shows forward and backward security can be maintained. Compared with some existing schemes, our proposed scheme can reduce rekeying overhead efficiently.
通讯机构：
[Wang, Jianxin] C;Cent South Univ, Sch Informat Sci & Engn, Changsha 410083, Hunan, Peoples R China.
摘要：
<jats:p>Many evidences have demonstrated that protein complexes are overlapping and hierarchically organized in PPI networks. Meanwhile, the large size of PPI network wants complex detection methods have low time complexity. Up to now, few methods can identify overlapping and hierarchical protein complexes in a PPI network quickly. In this paper, a novel method, called MCSE, is proposed based on<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:mi>λ</mml:mi></mml:mrow></mml:math>-module and “seed-expanding.” First, it chooses seeds as essential PPIs or edges with high edge clustering values. Then, it identifies protein complexes by expanding each seed to a<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2"><mml:mrow><mml:mi>λ</mml:mi></mml:mrow></mml:math>-module. MCSE is suitable for large PPI networks because of its low time complexity. MCSE can identify overlapping protein complexes naturally because a protein can be visited by different seeds. MCSE uses the parameter<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3"><mml:mrow><mml:mi>λ</mml:mi></mml:mrow></mml:math>_th to control the range of seed expanding and can detect a hierarchical organization of protein complexes by tuning the value of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4"><mml:mrow><mml:mi>λ</mml:mi></mml:mrow></mml:math>_th. Experimental results of<jats:italic>S. cerevisiae</jats:italic>show that this hierarchical organization is similar to that of known complexes in MIPS database. The experimental results also show that MCSE outperforms other previous competing algorithms, such as CPM, CMC, Core-Attachment, Dpclus, HC-PIN, MCL, and NFC, in terms of the functional enrichment and matching with known protein complexes.</jats:p>
