Compulsory traceable ciphertext-policy attribute-based encryption against privilege abuse in fog computing

2018 ◽  
Vol 88 ◽  
pp. 107-116 ◽  
Author(s):  
Huidong Qiao ◽  
Jiangchun Ren ◽  
Zhiying Wang ◽  
Haihe Ba ◽  
Huaizhe Zhou
2021 ◽  
Author(s):  
Tingyun Gan ◽  
Yongjian Liao ◽  
Yikuan Liang ◽  
Zijun Zhou ◽  
Ganglin Zhang

Abstract Vehicular fog computing (VFC), combing vehicle ad hoc networks (VANET) with fog computing, is an efficient vehicle communication architecture. However, the user data is often threatened since VFC is an open environment. Attribute-based encryption (ABE) is suitable for open scenarios, such as cloud and Internet of Things (IoT), because of its confidentiality and access control characteristics. However, the traditional ABE has disadvantages, such as the inability to hide the attributes in the access policy, and the use of computationally inefficient composite order bilinear pairing groups to prove adaptive security. Traditional ABE is not practical in VFC. We summarized the existing schemes of full policy hiding ABE and partial policy hiding ABE, then concluded that partial policy hiding ABE is more suitable for VFC. We combine policy hiding technology and the technology of converting bilinear pairing cryptography schemes into prime-order bilinear pairing cryptography schemes and propose an efficient and partial policy-hiding ciphertext-policy ABE (CP-ABE) scheme suitable for VFC. Experiments have proved that our scheme is computationally more efficient than previous policy hiding ABE schemes.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 66832-66844 ◽  
Author(s):  
Zhenhua Liu ◽  
Jing Xu ◽  
Yan Liu ◽  
Baocang Wang

Author(s):  
Fei Meng ◽  
Leixiao Cheng ◽  
Mingqiang Wang

AbstractCountless data generated in Smart city may contain private and sensitive information and should be protected from unauthorized users. The data can be encrypted by Attribute-based encryption (CP-ABE), which allows encrypter to specify access policies in the ciphertext. But, traditional CP-ABE schemes are limited because of two shortages: the access policy is public i.e., privacy exposed; the decryption time is linear with the complexity of policy, i.e., huge computational overheads. In this work, we introduce a novel method to protect the privacy of CP-ABE scheme by keyword search (KS) techniques. In detail, we define a new security model called chosen sensitive policy security: two access policies embedded in the ciphertext, one is public and the other is sensitive and hidden. If user's attributes don't satisfy the public policy, he/she cannot get any information (attribute name and its values) of the hidden one. Previous CP-ABE schemes with hidden policy only work on the “AND-gate” access structure or their ciphertext size or decryption time maybe super-polynomial. Our scheme is more expressive and compact. Since, IoT devices spread all over the smart city, so the computational overhead of encryption and decryption can be shifted to third parties. Therefore, our scheme is more applicable to resource-constrained users. We prove our scheme to be selective secure under the decisional bilinear Diffie-Hellman (DBDH) assumption.


2015 ◽  
Vol 10 (6) ◽  
pp. 1274-1288 ◽  
Author(s):  
Jianting Ning ◽  
Xiaolei Dong ◽  
Zhenfu Cao ◽  
Lifei Wei ◽  
Xiaodong Lin

2013 ◽  
Vol 14 (2) ◽  
pp. 85-97 ◽  
Author(s):  
Yong Cheng ◽  
Zhi-ying Wang ◽  
Jun Ma ◽  
Jiang-jiang Wu ◽  
Song-zhu Mei ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document