分布式安全存储中基于共享组的周期性密钥更新

钱权, 王天宏, 黄国锐, 张瑞

doi:10.3969/j.issn.1007-2861.2013.01.008

上海大学学报(自然科学版) >

2013 , Vol. 19 >Issue 1: 39 - 43

DOI: https://doi.org/10.3969/j.issn.1007-2861.2013.01.008

计算机工程与科学

分布式安全存储中基于共享组的周期性密钥更新

展开

1. 上海大学计算机工程与科学学院, 上海200444; 2. 解放军陆军军官学院, 合肥230031

钱权(1972—), 男, 副教授, 博士, 研究方向为计算机网络、网络安全和协议分析与验证. E-mail: qqian@shu.edu.cn

收稿日期: 2012-11-20

网络出版日期: 2013-02-28

基金资助

国家自然科学基金资助项目(61003248); 国家教育部博士点基金资助项目(20093108120016); 上海市重点学科建设资助项目(J50103); 上海市教委创新基金资助项目(09YZ05); 上海市科委开放课题基金资助项目(09511501300)

收起

Cyclic Key Update Scheme Based on Sharing Group for Distributed Secure Storage

Expand

1. School of Computer Engineering and Science, Shanghai University, Shanghai 200444, China;
2. Army Officer Acadedy of People’s Liberation Army, Hefei 230031, China

Received date: 2012-11-20

Online published: 2013-02-28

Fold

摘要

分布式存储是解决海量数据存储的重要手段, 而多用户环境下密钥的分发和更新是分布式安全存储的重要问题. 传统方法大多采用密钥分发中心(key distribution enter, KDC)进行控制, 但随着用户数的增多, 密钥中心的工作量增大. 利用Chebyshev多项式的周期性特性和逻辑密钥树(logical key hierarchy, LKH)的层次密钥结构, 设计一种分布式文件存储中基于文件共享组的周期性密钥更新方案(cyclic key update scheme, CKUS). 该方案的特点是密钥的更新和传递无需借助公钥密码体制, 而直接通过文件所有者进行组播; 文件共享者采用本地计算, 提高了计算效率. 同时, 利用Chebyshev多项式的周期性特点, 使每个文件共享者自适应密钥更新, 有效降低密钥更新时的通信量, 减少用户节点的密钥存储量.

关键词： Chebyshev多项式; 逻辑密钥树; 分布式安全存储; 密钥更新

本文引用格式

钱权, 王天宏, 黄国锐, 张瑞 . 分布式安全存储中基于共享组的周期性密钥更新[J]. 上海大学学报(自然科学版), 2013 , 19(1) : 39 -43 . DOI: 10.3969/j.issn.1007-2861.2013.01.008

Abstract

Distributed storage is an efficient means for massive data storage. However, the key distribution and update are big challenges for such multi-user network environments. In traditional methods, key distribution and update are controlled by the key distribution center (KDC). The increases users inevitably increase the KDC’s workload. In this paper, a sharing group based cyclic key update scheme (CKUS) is proposed, which makes use of the cyclic characteristic of Chebyshev polynomials and the key management feature of logical key hierarchy (LKH). The special feature of CKUS is that key updating and transmitting do not resort to the public and private keys, but are only multicast by the file owner directly. Thus, file sharers only use local computations, thus increasing computational efficiency. At the same time, the scheme takes advantage of the Chebyshev polynomial’s cyclic characteristic, which make each file sharers update its key self-adaptively, reduce network traffic of key update effectively, and reduces the keys storage requirements of the user nodes.

Key words： chebyshev polynomial; logical key hierarchy (LKH); distributed secure storage; key update

参考文献

[1] 韩德志. 分布式安全存储技术[J]. 计算机科学, 2007, 34(11): 81-83.

[2] Alon N, Kaplan H, Krivelevich M, et al. Scalable secure storage when half the system is faulty [C]// Proceedings of the 27th International Colloquium on

Automata, Languages and Programming (ICALP’00). 2000: 576-587.

[3] Kallahalla M, Riedel E, Swaminathan R, et al. Plutus: Scalable secure file sharing on untrusted storage [C]// Proceedings of the 2nd USENIX Conference

on File and Storage Technologies (FAST’03). 2003: 29-42.
[4] Cattaneo G, Catuogano L, Sorbo A D, et al. The design and implementation of a transparent cryptographic file system for UNIX [C]// Proceedings of the

FREENIX Track: 2001 UNENIX Annual Technical Conference. USENIX: Association Berkeley, 2001: 199-212.

[5] Wallner D, Harder E, Agee R. Key management for multicast: Issues and architectures (RFC2627) [J/OL]. [1999-01-23]. http://tools.ietf.org/html/rfc2627.

[6] Wong C K, Gouda M, Lam S S. Secure group communications using key graphs [J]. IEEE/ACM Transaction on Networking, 2000, 8(1): 16-30.

[7] Kocarev L, Tasev Z. Public-key encryption based on Chebyshev maps [C]// Proceedings of the 2003 International Symposium on Circuits and Systems (ISCAS’03).

2003: 28-31.

[8] 赵耿, 闫慧, 童宗科. 基于Chebyshev 多项式的公钥密码系统算法[J]. 计算机工程, 2008, 34(24): 137-139.

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract

参考文献