中文

Journal of Shanghai University >

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

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

Computer Engineering and Science

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

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

Cite this article

QIAN Quan, WANG Tian-hong, HUANG Guo-rui, ZHANG Rui . Cyclic Key Update Scheme Based on Sharing Group for Distributed Secure Storage[J]. Journal of Shanghai University, 2013 , 19(1) : 39 -43 . DOI: 10.3969/j.issn.1007-2861.2013.01.008

References

 
[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
Outlines

/

〈 〉