Supporting dynamic updates in storage clouds with the Akl-Taylor scheme

被引:30
作者
Castiglione, Arcangelo [1 ]
De Santis, Alfredo [1 ]
Masucci, Barbara [1 ]
Palmieri, Francesco [1 ]
Huang, Xinyi [2 ,3 ]
Castiglione, Aniello [1 ]
机构
[1] Univ Salerno, Dept Comp Sci, Via Giovanni Paolo 2,132, I-84084 Fisciano, SA, Italy
[2] Fujian Normal Univ, Fujian Prov Key Lab Network Secur & Cryptol, Sch Math & Comp Sci, Fuzhou 350117, Fujian, Peoples R China
[3] State Key Lab Cryptol, POB 5159, Beijing 100878, Peoples R China
关键词
Access control; Key assignment; Dynamic updates; Key management; Cloud storage; KEY ASSIGNMENT SCHEME; ACCESS-CONTROL; MANAGEMENT SCHEME; SECURE; ALGORITHM;
D O I
10.1016/j.ins.2016.08.093
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the wide diffusion of cloud technologies, an ever increasing amount of sensitive data is moved on centralized network-based repository services, providing elastic outsourced storage capacity, available through remote access. This introduces new challenges associated to the security and privacy of outsourced data that has to be dynamically created, shared, updated and removed by a large number of users, characterized by different access rights and views structured according to hierarchical roles. The address such challenges, and implement secure access control policies in those application domains, several cryptographic solutions have been proposed. In particular, hierarchical key assignment schemes represent an effective solution to deal with cryptographic access control. Starting from the first proposal due to AkI and Taylor in 1983, many hierarchical key assignment schemes have been proposed. However, the highly dynamic nature of cloud-based storage solutions may significantly stress the applicability of such schemes on a wide scale. In order to overcome such limitations, in this work we provide new results on the Akl-Taylor scheme, by carefully analyzing the problem of supporting dynamic updates, as well as key replacement operations. In doing this, we also perform a rigorous analysis of the Akl-Taylor scheme in the dynamic setting characterizing storage clouds, by considering different key assignment strategies and proving that the corresponding schemes are secure with respect to the notion of key recovery. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:56 / 74
页数:19
相关论文
共 61 条
[1]  
Aho A. V., 1972, SIAM Journal on Computing, V1, P131, DOI 10.1137/0201008
[2]   CRYPTOGRAPHIC SOLUTION TO A PROBLEM OF ACCESS-CONTROL IN A HIERARCHY [J].
AKL, SG ;
TAYLOR, PD .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1983, 1 (03) :239-248
[3]  
[Anonymous], 1979, TECHNICAL REPORT
[4]  
[Anonymous], 2013, P INT C APPL CRYPT N
[5]  
Atallah M. J., 2006, SACMAT 2006. Proceedings of Eleventh ACM Symposium on Access Control Models and Technologies, P11
[6]  
Atallah M.J., 2005, P ACM C COMPUTER COM, P190
[7]  
Atallah MJ, 2007, LECT NOTES COMPUT SC, V4734, P515
[8]   Dynamic and Efficient Key Management for Access Hierarchies [J].
Atallah, Mikhail J. ;
Blanton, Marina ;
Fazio, Nelly ;
Frikken, Keith B. .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2009, 12 (03)
[9]  
Ateniese G., 2012, J CRYPTOL, V25, P1
[10]  
Ateniese G., 2006, P 13 ACM C COMPUTER, P288