Computationally Efficient Ciphertext-Policy Attribute-Based Encryption with Constant-Size Ciphertexts

2014 ◽  
pp. 259-273 ◽  
Author(s):  
Yinghui Zhang ◽  
Dong Zheng ◽  
Xiaofeng Chen ◽  
Jin Li ◽  
Hui Li
Keyword(s):  
Computationally Efficient ◽  
Constant Size ◽  
Attribute Based Encryption ◽  
Ciphertext Policy

scholarly journals Efficient access control with traceability and user revocation in IoT

2021 ◽  
Author(s):  
Yi Wu ◽  
Wei Zhang ◽  
Hu Xiong ◽  
Zhiguang Qin ◽  
Kuo-Hui Yeh
Keyword(s):  
Internet Of Things ◽  
Mobile Devices ◽  
Data Privacy ◽  
Constant Size ◽  
Security Proof ◽  
Attribute Based Encryption ◽  
Efficient Access ◽  
Cloud Server ◽  
User Revocation ◽  
Ciphertext Policy

AbstractWith the universality and availability of Internet of Things (IoT), data privacy protection in IoT has become a hot issue. As a branch of attribute-based encryption (ABE), ciphertext policy attribute-based encryption (CP-ABE) is widely used in IoT to offer flexible one-to-many encryption. However, in IoT, different mobile devices share messages collected, transmission of large amounts of data brings huge burdens to mobile devices. Efficiency is a bottleneck which restricts the wide application and adoption of CP-ABE in Internet of things. Besides, the decryption key in CP-ABE is shared by multiple users with the same attribute, once the key disclosure occurs, it is non-trivial for the system to tell who maliciously leaked the key. Moreover, if the malicious mobile device is not revoked in time, more security threats will be brought to the system. These problems hinder the application of CP-ABE in IoT. Motivated by the actual need, a scheme called traceable and revocable ciphertext policy attribute-based encryption scheme with constant-size ciphertext and key is proposed in this paper. Compared with the existing schemes, our proposed scheme has the following advantages: (1) Malicious users can be traced; (2) Users exiting the system and misbehaving users are revoked in time, so that they no longer have access to the encrypted data stored in the cloud server; (3) Constant-size ciphertext and key not only improve the efficiency of transmission, but also greatly reduce the time spent on decryption operation; (4) The storage overhead for traceability is constant. Finally, the formal security proof and experiment has been conducted to demonstrate the feasibility of our scheme.

An Efficient Ciphertext-Policy Weighted Attribute-Based Encryption for the Internet of Health Things

2021 ◽  
pp. 1-1
Author(s):  
Hang Li ◽  
Keping Yu ◽  
Bin Liu ◽  
Chaosheng Feng ◽  
Zhiguang Qin ◽  
...  
Keyword(s):  
The Internet ◽  
Attribute Based Encryption ◽  
Ciphertext Policy

scholarly journals Updatable Ciphertext-Policy Attribute-Based Encryption Scheme With Traceability and Revocability

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 66832-66844 ◽  
Author(s):  
Zhenhua Liu ◽  
Jing Xu ◽  
Yan Liu ◽  
Baocang Wang
Keyword(s):  
Encryption Scheme ◽  
Attribute Based Encryption ◽  
Ciphertext Policy

scholarly journals Ciphertext-policy attribute-based encryption with hidden sensitive policy from keyword search techniques in smart city

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Fei Meng ◽  
Leixiao Cheng ◽  
Mingqiang Wang
Keyword(s):  
Smart City ◽  
Keyword Search ◽  
Sensitive Information ◽  
Security Model ◽  
Computational Overhead ◽  
Diffie Hellman ◽  
Attribute Based Encryption ◽  
Iot Devices ◽  
Ciphertext Policy ◽  
Access Policies

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.

Sign in / Sign up

Export Citation Format

Share Document