TY - JOUR
T1 - Fuzzy encryption in cloud computation
T2 - efficient verifiable outsourced attribute-based encryption
AU - Li, Jing
AU - Li, Xiong
AU - Wang, Licheng
AU - He, Debiao
AU - Ahmad, Haseeb
AU - Niu, Xinxin
N1 - Publisher Copyright:
© 2017, Springer-Verlag Berlin Heidelberg.
PY - 2018/2/1
Y1 - 2018/2/1
N2 - Attributed-based encryption (ABE) is a promising cryptographic access control mechanism with a rich expressiveness of ABE policies. Due to the high complexities of encryption and decryption, users are burdened with large computation cost. Fortunately, outsourcing technologies can be used to reduce the computation overhead for the ABE schemes. In the recent decade, the achievements of the outsourced ciphertext-policy ABE (CP-ABE) schemes are inspiring. But, the outsourcing encryption algorithms for CP-ABE schemes are not addressed properly since the encryption exponents are dynamic. In this paper, we present an efficient outsourced CP-ABE scheme with checkability, where the number of the exponential operations in the encryption can be reduced to a constant by introducing a blinding algorithm. Meanwhile, the ciphertext size is not increased. Furthermore, to guarantee the correctness of our scheme, we provide the verification mechanism based on a collision-resistance hash function, which allows the users to efficiently check the validity of messages and outsourced computation results. Besides, the proposed scheme is secure against replayable chosen ciphertext attacks based on Green’s outsourcing security model. Intensive experiments are carried out to illustrate the efficiency of the proposed scheme.
AB - Attributed-based encryption (ABE) is a promising cryptographic access control mechanism with a rich expressiveness of ABE policies. Due to the high complexities of encryption and decryption, users are burdened with large computation cost. Fortunately, outsourcing technologies can be used to reduce the computation overhead for the ABE schemes. In the recent decade, the achievements of the outsourced ciphertext-policy ABE (CP-ABE) schemes are inspiring. But, the outsourcing encryption algorithms for CP-ABE schemes are not addressed properly since the encryption exponents are dynamic. In this paper, we present an efficient outsourced CP-ABE scheme with checkability, where the number of the exponential operations in the encryption can be reduced to a constant by introducing a blinding algorithm. Meanwhile, the ciphertext size is not increased. Furthermore, to guarantee the correctness of our scheme, we provide the verification mechanism based on a collision-resistance hash function, which allows the users to efficiently check the validity of messages and outsourced computation results. Besides, the proposed scheme is secure against replayable chosen ciphertext attacks based on Green’s outsourcing security model. Intensive experiments are carried out to illustrate the efficiency of the proposed scheme.
KW - Attributed-based encryption
KW - Cloud servers
KW - Efficient verification
KW - Outsourced encryption
UR - https://www.scopus.com/pages/publications/85008699120
U2 - 10.1007/s00500-017-2482-1
DO - 10.1007/s00500-017-2482-1
M3 - Article
AN - SCOPUS:85008699120
SN - 1432-7643
VL - 22
SP - 707
EP - 714
JO - Soft Computing
JF - Soft Computing
IS - 3
ER -