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 条
  • [21] A novel traceability approach in IoT paradigm for CP-ABE proxy re-encryption
    Nishant Doshi
    Sādhanā, 47
  • [22] Identity-based re-encryption scheme with lightweight re-encryption key generation
    Liu, Liang
    Ye, Jun
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2018, 21 (01) : 41 - 57
  • [23] A secure and efficient access control scheme with attribute revocation and merging capabilities for fog-enabled IoT?
    Sarma, Richa
    Barbhuiya, Ferdous Ahmed
    COMPUTERS & ELECTRICAL ENGINEERING, 2022, 104
  • [24] Fog-enabled Event Processing Based on IoT Resource Models
    Zhang, Yang
    Sheng, Victor S.
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2019, 31 (09) : 1707 - 1721
  • [25] Delay Minimized Task Scheduling in Fog-Enabled IoT Networks
    Zhang, Guowei
    Shen, Fei
    Zhang, Yueyue
    Yang, Rong
    Yang, Yang
    Jorswieck, Eduard A.
    2018 10TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP), 2018,
  • [26] Distributed Resource Management for Blockchain in Fog-Enabled IoT Networks
    Yang, Lichao
    Li, Ming
    Zhang, Heli
    Ji, Hong
    Xiao, Mingyan
    Li, Xi
    IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (04) : 2330 - 2341
  • [27] Provable Lightweight Hybrid Proxy Re-encryption Scheme without Pairings for Internet of Things
    Abouelkheir, Eman
    El-sherbiny, Shamia
    HUMAN-CENTRIC COMPUTING AND INFORMATION SCIENCES, 2024, 14
  • [28] FU-Serve: Fog-enabled UAV-as-a-Service for IoT Applications
    Raju, Imandi
    Roy, Arijit
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 6401 - 6406
  • [29] Chosen-Ciphertext Secure Proxy Re-Encryption
    Canetti, Ran
    Hohenberger, Susan
    CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2007, : 185 - 194
  • [30] Data sharing using proxy re-encryption based on DNA computing
    Elhadad, Ahmed
    SOFT COMPUTING, 2020, 24 (03) : 2101 - 2108