• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Yan Xincheng, Chen Yue, Ba Yang, Jia Hongyong, Wang Zhonghui. Updatable Attribute-Based Encryption Scheme Supporting Dynamic Change of User Rights[J]. Journal of Computer Research and Development, 2020, 57(5): 1057-1069. DOI: 10.7544/issn1000-1239.2020.20190254
Citation: Yan Xincheng, Chen Yue, Ba Yang, Jia Hongyong, Wang Zhonghui. Updatable Attribute-Based Encryption Scheme Supporting Dynamic Change of User Rights[J]. Journal of Computer Research and Development, 2020, 57(5): 1057-1069. DOI: 10.7544/issn1000-1239.2020.20190254

Updatable Attribute-Based Encryption Scheme Supporting Dynamic Change of User Rights

Funds: This work was supported by the National Natural Science Foundation of China (61702549) and the Science and Technology Program of Henan Province (172102210017).
More Information
  • Published Date: April 30, 2020
  • Attribute-based encryption has great advantages in achieving fine-grained secure sharing for cloud data. Due to the dynamic changes of user access rights in cloud storage, data re-encryption is an effective method to ensure the forward security of ciphertext when the attribute or user private key is revoked, but the corresponding computation overhead and communication overhead of data uploading and downloading are too large. To address these issues, an updatable attribute-based encryption scheme is proposed to support dynamic changes of user rights (SDCUR-UABE). By constructing the attribute version key and user version key in ciphertext-policy attribute-based encryption, only the corresponding components of transformation key in user’s private key need to be updated when the user attribute is revoked. Similarly, when a system attribute is revoked, the corresponding attribute version key needs to be updated to implement replaceable update of part components for the ciphertext and key. Next, only the user version key needs to be updated when the user private key is revoked. Therefore the expensive computation and communication overhead caused by ciphertext update based on data re-encryption can be avoided. Besides, key segmentation is used to realize data decryption outsourcing to reduce the user’s decryption overhead in the construction of the scheme. Theoretical analysis and experimental verification show that the proposed scheme can effectively solve the computing efficiency and communication overhead of ciphertext update when the user rights are dynamically changed in the cloud storage system, and greatly reduce the computational complexity of user decryption under the premise of guaranteeing forward security for ciphertext.
  • Related Articles

    [1]Xia Qing, Li Shuai, Hao Aimin, Zhao Qinping. Deep Learning for Digital Geometry Processing and Analysis: A Review[J]. Journal of Computer Research and Development, 2019, 56(1): 155-182. DOI: 10.7544/issn1000-1239.2019.20180709
    [2]Xu Xiao, Ding Shifei, Sun Tongfeng, Liao Hongmei. Large-Scale Density Peaks Clustering Algorithm Based on Grid Screening[J]. Journal of Computer Research and Development, 2018, 55(11): 2419-2429. DOI: 10.7544/issn1000-1239.2018.20170227
    [3]Sun Yong, Tan Wenan, Jin Ting, Zhou Liangguang. A Collaborative Collusion Detection Method Based on Online Clustering[J]. Journal of Computer Research and Development, 2018, 55(6): 1320-1332. DOI: 10.7544/issn1000-1239.2018.20170231
    [4]Xu Kai, Wu Xiaojun, Yin Hefeng. Distributed Low Rank Representation-Based Subspace Clustering Algorithm[J]. Journal of Computer Research and Development, 2016, 53(7): 1605-1611. DOI: 10.7544/issn1000-1239.2016.20148362
    [5]Zhang Shuai, Li Tao, Jiao Xiaofan, Wang Yifeng, Yang Yulu. Parallel TNN Spectral Clustering Algorithm in CPU-GPU Heterogeneous Computing Environment[J]. Journal of Computer Research and Development, 2015, 52(11): 2555-2567. DOI: 10.7544/issn1000-1239.2015.20148151
    [6]Zhu Hong, Ding Shifei, Xu Xinzheng. An AP Clustering Algorithm of Fine-Grain Parallelism Based on Improved Attribute Reduction[J]. Journal of Computer Research and Development, 2012, 49(12): 2638-2644.
    [7]Lu Weiming, Du Chenyang, Wei Baogang, Shen Chunhui, and Ye Zhenchao. Distributed Affinity Propagation Clustering Based on MapReduce[J]. Journal of Computer Research and Development, 2012, 49(8): 1762-1772.
    [8]Li Wenjun, Wang Jianxin, and Chen Jianer. An Improved Parameterized Algorithm for Hyperplane-Cover Problem[J]. Journal of Computer Research and Development, 2012, 49(4): 804-811.
    [9]Luo Xiaonan, Lin Mouguang, Ji Changbo, and Li Zhiyong. A Progressive Geometry Simplification Method for Mobile Computing Terminal[J]. Journal of Computer Research and Development, 2007, 44(6): 1038-1043.
    [10]Ou Xinliang, Chen Songqiao, Chang Zhiming. A Parallel Geometric Correction Algorithm Based on Dynamic Division-Point Computing[J]. Journal of Computer Research and Development, 2006, 43(6): 1115-1121.

Catalog

    Article views (1247) PDF downloads (318) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return