Revocable and Fog-Enabled Proxy Re-Encryption Scheme for IoT Environments

被引:0
|
作者
Lin, Han-Yu [1 ]
Chen, Pei-Ru [1 ]
机构
[1] Natl Taiwan Ocean Univ, Dept Comp Sci & Engn, Keelung 202, Taiwan
关键词
fog computing; proxy; re-encryption; revocation; IoT;
D O I
10.3390/s24196290
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
As technology advances rapidly, a diverse array of Internet of Things (IoT) devices finds widespread application across numerous fields. The intelligent nature of these devices not only gives people more convenience, but also introduces new challenges especially in security when transmitting data in fog-based cloud environments. In fog computing environments, data need to be transmitted across multiple devices, increasing the risk of data being intercepted or tampered with during transmission. To securely share cloud ciphertexts, an alleged proxy re-encryption approach is a commonly adopted solution. Without decrypting the original ciphertext, such a mechanism permits a ciphertext intended for user A to be easily converted into the one intended for user B. However, to revoke the decryption privilege of data users usually relies on the system authority to maintain a user revocation list which inevitably increases the storage space. In this research, the authors come up with a fog-based proxy re-encryption system with revocable identity. Without maintaining the traditional user revocation list, the proposed scheme introduces a time-updated key mechanism. The time-update key could be viewed as a partial private key and should be renewed with different time periods. A revoked user is unable to obtain the renewed time-update key and hence cannot share or decrypt cloud ciphertexts. We formally demonstrate that the introduced scheme satisfies the security of indistinguishability against adaptively chosen identity and chosen plaintext attacks (IND-PrID-CPA) assuming the hardness of the Decisional Bilinear Diffie-Hellman (DBDH) problem in the random oracle model. Furthermore, compared with similar systems, the proposed one also has lower computational complexity as a whole.
引用
收藏
页数:15
相关论文
共 50 条
  • [41] Leakage resilient ID-based proxy re-encryption scheme for access control in fog computing
    Wang, Zhiwei
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 87 : 679 - 685
  • [42] Anonymous proxy re-encryption
    Shao, Jun
    Liu, Peng
    Wei, Guiyi
    Ling, Yun
    SECURITY AND COMMUNICATION NETWORKS, 2012, 5 (05) : 439 - 449
  • [43] Improved Proxy Re-encryption Scheme for Symmetric Key Cryptography
    Syalim, Amril
    Nishide, Takashi
    Sakurai, Kouichi
    2017 INTERNATIONAL WORKSHOP ON BIG DATA AND INFORMATION SECURITY (IWBIS 2017), 2017, : 105 - 111
  • [44] Revocable Identity-Based Broadcast Proxy Re-Encryption for Data Sharing in Clouds
    Ge, Chunpeng
    Liu, Zhe
    Xia, Jinyue
    Fang, Liming
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (03) : 1214 - 1226
  • [45] An Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing
    Selvi, S. Sharmila Deva
    Paul, Arinjita
    Rangan, Chandrasekaran Pandu
    PROVABLE SECURITY, PROVSEC 2017, 2017, 10592 : 413 - 433
  • [46] A new RSA-based proxy re-encryption scheme
    Wang, Liangliang
    Chen, Kefei
    Long, Yu
    Mao, Xianping
    Journal of Computational Information Systems, 2015, 11 (02): : 567 - 575
  • [47] A proxy re-encryption scheme based on elliptic curve group
    Yin, Shou-Lin (352720214@qq.com), 1600, Ubiquitous International (08):
  • [48] A Proxy Re-Encryption with Keyword Search Scheme in Cloud Computing
    Tang, Yongli
    Lian, Huanhuan
    Zhao, Zemao
    Yan, Xixi
    CMC-COMPUTERS MATERIALS & CONTINUA, 2018, 56 (02): : 339 - 352
  • [49] A BGN-Type Homomorphic Proxy Re-Encryption Scheme
    Liu, Shu-Guang
    Zhang, Wei
    INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND INFORMATION SECURITY (CNIS 2015), 2015, : 226 - 229
  • [50] Non-transitive Bidirectional Proxy Re-encryption Scheme
    Zhang, Jindan
    Wang, Xu An
    2009 INTERNATIONAL CONFERENCE ON NETWORKING AND DIGITAL SOCIETY, VOL 1, PROCEEDINGS, 2009, : 213 - 216