Everything Under Control: Secure Data Sharing Mechanism for Cloud-Edge Computing

被引:8
作者
Song, Zishuai [1 ,2 ]
Ma, Hui [1 ,2 ]
Zhang, Rui [1 ,2 ]
Xu, Wenhan [1 ,2 ]
Li, Jianhao [1 ,2 ]
机构
[1] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China
[2] Univ Chinese Acad Sci, Sch Cyber Secur, Beijing 100049, Peoples R China
基金
中国国家自然科学基金;
关键词
Access control; Encryption; Distributed databases; Security; Data processing; Data privacy; Servers; Cloud-edge computing; controllable delegation; bilateral access control; verifiability; WebAssembly; ATTRIBUTE-BASED ENCRYPTION; BILATERAL ACCESS-CONTROL; PROXY RE-ENCRYPTION;
D O I
10.1109/TIFS.2023.3266164
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Cloud-edge computing is a new paradigm for data sharing. Many computation tasks are assigned to multiple edge nodes to mitigate the computing burden of the cloud and data is also outsourced to them to provide real-time services for IoT devices. However, two major issues remain, namely data privacy and real-world deployment. According to the data privacy rights and principles that stated by General Data Protection Regulation (GDPR), data access control, restriction of data processing and finding inaccuracy data are critical issues that should be tackled in cloud-edge computing. Besides, since there are various types of devices and many of them are resource-constrained, how to efficiently apply deployment in cloud-edge computing is challenging for practice. In this work, we propose a new cryptographic primitive Controllable Outsourced Attribute-Based Proxy Re-Encryption (COAB-PRE) and a universal WebAssembly-based implementation framework for cross-platform deployment. In particular, COAB-PRE achieves bilateral and distributed access control whereby data producers and data consumers can both specify policies the other party must satisfy without a centralized access control server. The property, that we called controllable delegation, restricts the data processing on the edge nodes. COAB-PRE also supports comprehensive verifiability to find out a wrong result produced by the edge nodes and locate the misbehaved one. Moreover, we further discussed the potential property of COAB-PRE and put forward an improved scheme with high efficiency on devices. We also implemented our scheme using the approach and deployed it on different devices for experiment. All theoretical and experimental results indicate that our solution is secure and practical, and our implementation is suitable for cloud-edge computing.
引用
收藏
页码:2234 / 2249
页数:16
相关论文
共 42 条
  • [1] Match Me if You Can: Matchmaking Encryption and Its Applications
    Ateniese, Giuseppe
    Francati, Danilo
    Nunez, David
    Venturi, Daniele
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT II, 2019, 11693 : 701 - 731
  • [2] Efficient Two-level Homomorphic Encryption in Prime-order Bilinear Groups and A Fast Implementation in WebAssembly
    Attrapadung, Nuttapong
    Hanaoka, Goichiro
    Mitsunari, Shigeo
    Sakai, Yusuke
    Shimizu, Kana
    Teruya, Tadanori
    [J]. PROCEEDINGS OF THE 2018 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (ASIACCS'18), 2018, : 685 - 697
  • [3] Barreto PSLM, 2003, LECT NOTES COMPUT SC, V2576, P257
  • [4] Ciphertext-policy attribute-based encryption
    Bethencourt, John
    Sahai, Amit
    Waters, Brent
    [J]. 2007 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2007, : 321 - +
  • [5] Boneh Dan, 2001, Asiacrypt, V2248, P514, DOI [10.1007/3-540-45682-130, DOI 10.1007/S00145-004-0314-9]
  • [6] BytecodeAlliance, 2019, WAMR
  • [7] BytecodeAlliance, 2019, WASMT
  • [8] The random oracle methodology, revisited
    Canetti, R
    Goldreich, O
    Halevi, S
    [J]. JOURNAL OF THE ACM, 2004, 51 (04) : 557 - 594
  • [9] CHAUM D, 1991, LECT NOTES COMPUT SC, V547, P257
  • [10] A Practical and Efficient Bidirectional Access Control Scheme for Cloud-Edge Data Sharing
    Cui, Jie
    Li, Bei
    Zhong, Hong
    Min, Geyong
    Xu, Yan
    Liu, Lu
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2022, 33 (02) : 476 - 488