A Modified Hierarchical Attribute Based Encryption Access Control Method For Mobile Cloud Computing
A Modified Hierarchical Attribute Based Encryption Access Control Method For Mobile Cloud Computing
fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TCC.2015.2513388, IEEE
Transactions on Cloud Computing
JOURNAL OF LATEX CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 2014 1
2168-7161 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TCC.2015.2513388, IEEE
Transactions on Cloud Computing
JOURNAL OF LATEX CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 2014 2
2168-7161 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TCC.2015.2513388, IEEE
Transactions on Cloud Computing
JOURNAL OF LATEX CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 2014 3
2168-7161 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TCC.2015.2513388, IEEE
Transactions on Cloud Computing
JOURNAL OF LATEX CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 2014 4
2168-7161 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TCC.2015.2513388, IEEE
Transactions on Cloud Computing
JOURNAL OF LATEX CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 2014 5
C. M-HABE Definition
Fig. 2. M-HABE model
The M-HABE is composed by the following algorithm-
TABLE III
s:
L IST OF MAJOR KEYS IN HABE Setup: Given a security parameter K that is huge enough,
AUC will generate a system parameter params and a root
Key Name Meaning
master key M K0 .
M K0 Root key, owned by AuC
CreateMK: Using system parameter params and their own
M K∗ Master key, owned by Sub-AuC
master keys, AUC or Sub-AuCs can create master keys for
P K∗ Public key, owned by Sub-AuC1
lower-level Sub-AuCs.
P Ki Public key, owned by Sub-AuCs
CreateSK: With its own master key M K∗ and system param-
M Ki Master key, owned by Sub-AuCs
eter params, Sub-AuC1 creates secret key SKu for each
P Ku Public key, owned by users
consumer if it is sure that the public key of the user is P Ku ,
SKu Secret key, owned by users
or there would be no secret key for the user.
SKi,u Secret identity key, owned by users
CreateUser: Sub-AuCs will create users’ secret identity keys
SKi,u,a Secret attribute key, owned by users
SKi,u and secret attribute keys SKi,u,a for them if the Aub-
P Ku Public key, owned by attributes
AuC makes sure that the attribute a is in charge of it and
the user u satisfies a. And if not there would be no secret
identity keys or secret attribute keys.
users and create their private keys, while other Sub-AuCs take
Encrypt: With R denoting a set of users’ IDs, A representing
charge of users attributes and create their secret identity keys
the attribute-based access structure, the pubic keys of all the
and secret attribute keys for users.
users that are in R, and the public keys of all the attributes
Each data user shown in the figure possesses a unique ID
that are in A, the data provider, which is also a data user of
which is a character string designed to describe the features
the cloud computing in this case, can encrypt the sensing
of internal parties within the system, and so do AuC, Sub-
data D into ciphertext C.
AuCs, and users attributes, especially, the ID of each user
RDcrypt: Given the ciphertext C, a data user possessing the
contains an integer for describing the privilege level of the
precise ID that is in R can decrypt the ciphertext C into
user. Additionally, data users also own a set of attributes while
plaintext D with params and the user’s secret key SKu .
other internal parties do not.
ADcrypt: Given the ciphertext C, a data user possessing an
attribute set {a} that satisfies A, which means that the
B. Key Description consumer owns at least an attribute key SKi,u,a , can also
Public key encryption is utilized in the proposed system, decrypt the ciphertext C into plaintext D with system
the related keys are summarized in Table III. parameter params, the user’s secret identity key SKi,u ,
a) Root key M K0 possessed by AuC is used to create M K∗ and the secret attribute key SKi,u,a .
for Sub-AuC1 .
b) Each Sub-AuC owns a public key P Ki and a master key
D. M-HABE Construction
M Ki , among which P Ki is composed as (P Ki−1 , IDi )
where P Ki−1 is the public key of the Sub-AuC’s father Assuming that IG is a BDH parameter generator, the M-
node, and M Ki is also created by the father node. P K∗ is HABE scheme based on bilinear map [9] is constructed by
the public key of Sub-AuC1 , which can be demonstrated as following algorithms:
ID∗ meaning that it is composed by its own IDs. Unlike Step 1. Setup(K)→(params, M K0 ): The AUC
HABE proposed by Wang [8], Sub-AuC1 in this paper only firstly chooses the root master key mk0 ∈Zq∗ ,
needs to take charge of users, and create their secret keys and then outputs the system parameter
SKu for them. And other Sub-AuCs have a set of attributes params=hq, G1 , G2 , ê, n, P0 , Q0 , H1 , H2 i, among which
2168-7161 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TCC.2015.2513388, IEEE
Transactions on Cloud Computing
JOURNAL OF LATEX CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 2014 6
(q, G1 , G2 , ê) is the output of IG, n is a positive integer, Uu1 =rPu1 , . . . , Mum =rPum ; (2)
P0 is a random generator of G1 , H1 : {0, 1}∗ →G1 and U12 =rP12 , . . . , U1t1 =rP1t1 ; (3)
H2 : G2 →{0, 1}n are two random oracles. In this step, the Xn1
system parameter is able to be obtained publicly while the U1 =r Pa1j ; . . . ; (4)
master key M K0 is kept secret. j=1
Step 2. CreateM K(params, M Ki , P Ki+1 )→(M Ki+1 ): UN 2 =rPN 2 , . . . , UN tN = rPN tN ; (5)
Assuming that Sub-AuCi is the father node of XnN
Sub-AuCi+1 . And the master key of Sub-AuCi+1 UN =r PaN j ; (6)
which is created by Sub-AuCi is in form of j=1
M Ki+1 =(mki+1 , SKi+1 , Q-tuplei+1 , HA ), among V =D⊕H2 (ê(Q0 , rnA P∗ )) (7)
which
2168-7161 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TCC.2015.2513388, IEEE
Transactions on Cloud Computing
JOURNAL OF LATEX CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 2014 7
Y ti
× Smart Phone
Cloud Servers First Level Sub-AuC U Data User
nA A Attribute AuC
Authentication
Center
ni j=2
Sub-AuC 1
Sub-AuC 2
Sub-AuC 2
! A A
ti ni D
X n A
X D
A A A A A A A A
ni j=1
D
D D
U U
k=2 D
D
U U
D
D U
2168-7161 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TCC.2015.2513388, IEEE
Transactions on Cloud Computing
JOURNAL OF LATEX CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 2014 8
R EFERENCES
Cloud
[1] N. Fernando, S. W. Loke, and W. Rahayu, “Mobile cloud computing:
A survey,” Future Generation Computer Systems, vol. 29, no. 1, pp.
Data Model 84–106, 2013.
D D
[2] S. Abolfazli, Z. Sanaei, E. Ahmed, A. Gani, and R. Buyya, “Cloud-
Data Model
D D based augmentation for mobile devices: motivation, taxonomies, and
D
Data Model
D open challenges,” Communications Surveys & Tutorials, IEEE, vol. 16,
D
Data Model
D
no. 1, pp. 337–368, 2014.
[3] R. Kumar and S. Rajalakshmi, “Mobile cloud computing: Standard
approach to protecting and securing of mobile cloud ecosystems,” in
Layer 1 Layer 2 Classified Stored Data Computer Sciences and Applications (CSA), 2013 International Confer-
Cloud Servers
ence on. IEEE, 2013, pp. 663–669.
[4] J. Carolan, S. Gaede, J. Baty, G. Brunette, A. Licht, J. Remmell,
L. Tucker, and J. Weise, “Introduction to cloud computing architecture,”
White Paper, 1st edn. Sun Micro Systems Inc, 2009.
Fig. 4. Data model
[5] E. E. Marinelli, “Hyrax: cloud computing on mobile devices using
mapreduce,” DTIC Document, Tech. Rep., 2009.
[6] Q. Han, S. Liang, and H. Zhang, “Mobile cloud sensing, big data, and 5g
Cloud
networks make an intelligent and smart world,” Network, IEEE, vol. 29,
no. 2, pp. 40–45, 2015.
[7] I. Stojmenovic, “Access control in distributed systems: Merging theory
D D with practice,” in Trust, Security and Privacy in Computing and Com-
D
munications (TrustCom), 2011 IEEE 10th International Conference on.
D
D IEEE, 2011, pp. 1–2.
D D
D
[8] G. Wang, Q. Liu, and J. Wu, “Hierarchical attribute-based encryption for
D D fine-grained access control in cloud storage services,” in Proceedings of
D
the 17th ACM conference on Computer and communications security.
Layer 1 Layer 2
ACM, 2010, pp. 735–737.
Classified Stored Data
[9] C. Gentry and A. Silverberg, “Hierarchical id-based cryptography,” in
Cloud Servers
Advances in cryptologyASIACRYPT 2002. Springer, 2002, pp. 548–566.
[10] J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-policy attribute-
based encryption,” in Security and Privacy, 2007. SP’07. IEEE Sympo-
sium on. IEEE, 2007, pp. 321–334.
Fig. 5. Encryption procedure [11] A. Shamir, “Identity-based cryptosystems and signature schemes,” in
Advances in cryptology. Springer, 1985, pp. 47–53.
[12] M. Zhou, R. Zhang, W. Xie, W. Qian, and A. Zhou, “Security and
Cloud Servers
privacy in cloud computing: A survey,” in Semantics Knowledge and
M Data User Grid (SKG), 2010 Sixth International Conference on. IEEE, 2010, pp.
105–112.
[13] B. Grobauer, T. Walloschek, and E. Stöcker, “Understanding cloud
U U computing vulnerabilities,” Security & privacy, IEEE, vol. 9, no. 2, pp.
50–57, 2011.
U U [14] S. Ghemawat, H. Gobioff, and S.-T. Leung, “The google file system,”
in ACM SIGOPS operating systems review, vol. 37, no. 5. ACM, 2003,
U pp. 29–43.
[15] M. Zhou, R. Zhang, W. Xie, W. Qian, and A. Zhou, “Security and
U U privacy in cloud computing: A survey,” in Semantics Knowledge and
Grid (SKG), 2010 Sixth International Conference on. IEEE, 2010, pp.
Data Users
105–112.
Layer 3
[16] Y. Xie, J. Zhang, G. Fu, H. Wen, Q. Han, X. Zhu, Y. Jiang, and
X. Guo, “The security issue of wsns based on cloud computing,” in
Fig. 6. Decryption procedure Communications and Network Security (CNS), 2013 IEEE Conference
on. IEEE, 2013, pp. 383–384.
[17] R. Walters, “Cyber attacks on us companies in 2014,” Heritage Foun-
dation Issue Brief, no. 4289, 2014.
HABE scheme, the novel scheme can be more adaptive for [18] A. Fox, R. Griffith, A. Joseph, R. Katz, A. Konwinski, G. Lee,
mobile cloud computing environment to process, store and D. Patterson, A. Rabkin, and I. Stoica, “Above the clouds: A berkeley
access the enormous data and files while the novel system view of cloud computing,” Dept. Electrical Eng. and Comput. Sciences,
University of California, Berkeley, Rep. UCB/EECS, vol. 28, p. 13, 2009.
can let different privilege entities access their permitted data [19] L. Sumter, “Cloud computing: security risk,” in Proceedings of the 48th
and files. The scheme not only accomplishes the hierarchical Annual Southeast Regional Conference. ACM, 2010, p. 112.
access control of mobile sensing data in the mobile cloud [20] B. R. Moyers, J. P. Dunning, R. C. Marchany, and J. G. Tront, “Effects
computing model, but protects the data from being obtained of wi-fi and bluetooth battery exhaustion attacks on mobile devices,” in
System Sciences (HICSS), 2010 43rd Hawaii International Conference
by an untrusted third party. on. IEEE, 2010, pp. 1–9.
[21] J. Oberheide and F. Jahanian, “When mobile is harder than fixed (and
vice versa): demystifying security challenges in mobile environments,”
ACKNOWLEDGMENT in Proceedings of the Eleventh Workshop on Mobile Computing Systems
& Applications. ACM, 2010, pp. 43–48.
The work is sponsored by EPRI, CSG research found- [22] W. Zhang, Y. Wen, and H.-H. Chen, “Toward transcoding as a service:
ing, NSFC (No. 61271172, 61572114), 863 High Tech- energy-efficient offloading policy for green mobile cloud,” Network,
nology Plan (Grant No. 2015AA01A707), NSFC A3 Pro- IEEE, vol. 28, no. 6, pp. 67–73, 2014.
[23] J. Horwitz and B. Lynn, “Toward hierarchical identity-based encryption,”
gram (No.61140320) and RFDP (Grant No. 20120185110030, in Advances in CryptologyEUROCRYPT 2002. Springer, 2002, pp. 466–
20130185130002). 481.
2168-7161 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TCC.2015.2513388, IEEE
Transactions on Cloud Computing
JOURNAL OF LATEX CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 2014 9
[24] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryp- Jiaxiao Meng received the B.S. degree in Traffic
tion for fine-grained access control of encrypted data,” in Proceedings and Transportation from Central South University
of the 13th ACM conference on Computer and communications security. of Forestry and Technology, Changsha, Chian, in
Acm, 2006, pp. 89–98. 2004. He is currently pursuing the M.D. degree in
[25] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, Telecommunications engineering at Beijing Univer-
G. Lee, D. Patterson, A. Rabkin, I. Stoica et al., “A view of cloud sity of Posts and Telecommunications. From 2012
computing,” Communications of the ACM, vol. 53, no. 4, pp. 50–58, to 2015, he was a Research Assistant with Electric
2010. Power Research Institute,CSG, Guangzhou, China.
[26] T.-D. Nguyen and E.-N. Huh, “An efficient key management for His research interest includes the Network Security
secure multicast in sensor-cloud,” in Computers, Networks, Systems and Cloud Computing.
and Industrial Engineering (CNSI), 2011 First ACIS/JNU International
Conference on. IEEE, 2011, pp. 3–9.
2168-7161 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.