1
|
Chen Y, Dong G, Xu C, Hao Y, Zhao Y. EStore: A User-Friendly Encrypted Storage Scheme for Distributed File Systems. SENSORS (BASEL, SWITZERLAND) 2023; 23:8526. [PMID: 37896619 PMCID: PMC10610803 DOI: 10.3390/s23208526] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Received: 08/11/2023] [Revised: 10/03/2023] [Accepted: 10/12/2023] [Indexed: 10/29/2023]
Abstract
In this paper, we propose a user-friendly encrypted storage scheme named EStore, which is based on the Hadoop distributed file system. Users can make use of cloud-based distributed file systems to collaborate with each other. However, most data are processed and stored in plaintext, which is out of the owner's control after it has been uploaded and shared. Meanwhile, simple encryption guarantees the confidentiality of uploaded data but reduces availability. Furthermore, it is difficult to deal with complex key management as there is the problem whereby a single key encrypts different files, thus increasing the risk of leakage. In order to solve the issues above, we put forward an encrypted storage model and a threat model, designed with corresponding system architecture to cope with these requirements. Further, we designed and implemented six sets of protocols to meet users' requirements for security and use. EStore manages users and their keys through registration and authentication, and we developed a searchable encryption module and encryption/decryption module to support ciphertext retrieval and secure data outsourcing, which will only minimally increase the calculation overhead of the client and storage redundancy. Users are invulnerable compared to the original file system. Finally, we conducted a security analysis of the protocols to demonstrate that EStore is feasible and secure.
Collapse
Affiliation(s)
- Yuxiang Chen
- School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China; (Y.C.)
- Science and Technology on Communication Security Laboratory, Chengdu 610041, China; (Y.H.); (Y.Z.)
- No. 30 Institute, China Electronics Technology Group Corporation, Chengdu 610041, China; (G.D.)
| | - Guishan Dong
- School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China; (Y.C.)
- No. 30 Institute, China Electronics Technology Group Corporation, Chengdu 610041, China; (G.D.)
| | - Chunxiang Xu
- School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China; (Y.C.)
| | - Yao Hao
- Science and Technology on Communication Security Laboratory, Chengdu 610041, China; (Y.H.); (Y.Z.)
- No. 30 Institute, China Electronics Technology Group Corporation, Chengdu 610041, China; (G.D.)
| | - Yue Zhao
- Science and Technology on Communication Security Laboratory, Chengdu 610041, China; (Y.H.); (Y.Z.)
- No. 30 Institute, China Electronics Technology Group Corporation, Chengdu 610041, China; (G.D.)
| |
Collapse
|
2
|
Abstract
In recent years, there has been a dramatic change in attitude towards computers and the use of computer resources in general. Cloud and Edge computing have emerged as the most widely used technologies, including fog computing and the Internet of Things (IoT). There are several benefits in exploiting Cloud and Edge computing paradigms, such as lower costs and higher efficiency. It provides data computation and storage where data are processed, enables better data control, faster understanding and actions, and continuous operation. However, though these benefits seem to be appealing, their effects on computer forensics are somewhat undesirable. The complexity of the Cloud and Edge environments and their key features present many technical challenges from multiple stakeholders. This paper seeks to establish an in-depth understanding of the impact of Cloud and Edge computing-based environmental factors. Software and hardware tools used in the digital forensic process, forensic methods for handling tampered sound files, hidden files, image files, or images with steganography, etc. The technical/legal challenges and the open design problems (such as distributed maintenance, multitasking and practicality) highlight the various challenges for the digital forensics process.
Collapse
|
3
|
Zhu B, Susilo W, Qin J, Guo F, Zhao Z, Ma J. A Secure and Efficient Data Sharing and Searching Scheme in Wireless Sensor Networks. SENSORS 2019; 19:s19112583. [PMID: 31174350 PMCID: PMC6603739 DOI: 10.3390/s19112583] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 05/11/2019] [Revised: 06/02/2019] [Accepted: 06/03/2019] [Indexed: 11/16/2022]
Abstract
Wireless sensor networks (WSN) generally utilize cloud computing to store and process sensing data in real time, namely, cloud-assisted WSN. However, the cloud-assisted WSN faces new security challenges, particularly outsourced data confidentiality. Data Encryption is a fundamental approach but it limits target data retrieval in massive encrypted data. Public key encryption with keyword search (PEKS) enables a data receiver to retrieve encrypted data containing some specific keyword in cloud-assisted WSN. However, the traditional PEKS schemes suffer from an inherent problem, namely, the keyword guessing attack (KGA). KGA includes off-line KGA and on-line KGA. To date, the existing literature on PEKS cannot simultaneously resist both off-line KGA and on-line KGA performed by an external adversary and an internal adversary. In this work, we propose a secure and efficient data sharing and searching scheme to address the aforementioned problem such that our scheme is secure against both off-line KGA and on-line KGA performed by external and internal adversaries. We would like to stress that our scheme simultaneously achieves document encryption/decryption and keyword search functions. We also prove our scheme achieves keyword security and document security. Furthermore, our scheme is more efficient than previous schemes by eliminating the pairing computation.
Collapse
Affiliation(s)
- Binrui Zhu
- School of Mathematics, Shandong University, Jinan 250100, China.
| | - Willy Susilo
- School of Computing and Information Technology, University of Wollongong, Wollongong 2522, Australia.
| | - Jing Qin
- School of Mathematics, Shandong University, Jinan 250100, China.
- State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China.
| | - Fuchun Guo
- School of Computing and Information Technology, University of Wollongong, Wollongong 2522, Australia.
| | - Zhen Zhao
- School of Computing and Information Technology, University of Wollongong, Wollongong 2522, Australia.
| | - Jixin Ma
- Centre for Computer and Computational Science at School of Computing and Mathematical Sciences, University of Greenwich, London SE10 9LS, UK.
| |
Collapse
|
4
|
|
5
|
Differentiated Data Aggregation Routing Scheme for Energy Conserving and Delay Sensitive Wireless Sensor Networks. SENSORS 2018; 18:s18072349. [PMID: 30029552 PMCID: PMC6069584 DOI: 10.3390/s18072349] [Citation(s) in RCA: 32] [Impact Index Per Article: 5.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 06/09/2018] [Revised: 07/12/2018] [Accepted: 07/17/2018] [Indexed: 11/17/2022]
Abstract
Data aggregation is a widely adopted method to effectively reduce the data transmission volume and improve the lifetime of wireless sensor networks (WSNs). In the data aggregation networks, some parameters directly determine the delay of aggregation. In industrial applications, the data generated by different sensors have different requirements for delay or other QoS performance. In the previous study, a common strategy is that all kinds of data is aggregated into one frame when the condition is satisfied with a QoS requirement, which causes excessive energy consumption and severely impairs the lifetime of network. A Differentiated Data Aggregation Routing (DDAR) scheme is proposed to reduce energy consumption and guarantee that the delay could be controlled within the corresponding QoS requirement constraint. The primary contributions of the DDAR scheme are the following: (a) The DDAR scheme makes data with different QoS requirement route to the sink along the different paths. The parameters of the aggregators in each path, such as aggregation deadline (Tt) and the aggregation threshold (Nt), are configured according to the QoS requirements. Accordingly, energy consumption can be reduced without degrading the performance of data transmission. (b) Based on DDAR scheme, an improved DDAR scheme is proposed to further improve performance through fully utilize the residual energy in the nodes which are far from the sink. The frequency of aggregation of these nodes increases by reducing the value of Tt and Nt so as to further improve the energy efficiency and reduce delay. Simulation results demonstrate that compared with the previous scheme, this scheme reduces the delay by 25.01%, improves the lifetime by 55.45%, and increases energy efficiency by 83.99%. The improved DDAR scheme improves the energy efficiency by 33.97% and service guarantee rate by 10.11%.
Collapse
|
6
|
Huang B, Liu A, Zhang C, Xiong N, Zeng Z, Cai Z. Caching Joint Shortcut Routing to Improve Quality of Service for Information-Centric Networking. SENSORS 2018; 18:s18061750. [PMID: 29844285 PMCID: PMC6021837 DOI: 10.3390/s18061750] [Citation(s) in RCA: 20] [Impact Index Per Article: 3.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 03/07/2018] [Revised: 05/17/2018] [Accepted: 05/24/2018] [Indexed: 11/16/2022]
Abstract
Hundreds of thousands of ubiquitous sensing (US) devices have provided an enormous number of data for Information-Centric Networking (ICN), which is an emerging network architecture that has the potential to solve a great variety of issues faced by the traditional network. A Caching Joint Shortcut Routing (CJSR) scheme is proposed in this paper to improve the Quality of service (QoS) for ICN. The CJSR scheme mainly has two innovations which are different from other in-network caching schemes: (1) Two routing shortcuts are set up to reduce the length of routing paths. Because of some inconvenient transmission processes, the routing paths of previous schemes are prolonged, and users can only request data from Data Centers (DCs) until the data have been uploaded from Data Producers (DPs) to DCs. Hence, the first kind of shortcut is built from DPs to users directly. This shortcut could release the burden of whole network and reduce delay. Moreover, in the second shortcut routing method, a Content Router (CR) which could yield shorter length of uploading routing path from DPs to DCs is chosen, and then data packets are uploaded through this chosen CR. In this method, the uploading path shares some segments with the pre-caching path, thus the overall length of routing paths is reduced. (2) The second innovation of the CJSR scheme is that a cooperative pre-caching mechanism is proposed so that QoS could have a further increase. Besides being used in downloading routing, the pre-caching mechanism can also be used when data packets are uploaded towards DCs. Combining uploading and downloading pre-caching, the cooperative pre-caching mechanism exhibits high performance in different situations. Furthermore, to address the scarcity of storage size, an algorithm that could make use of storage from idle CRs is proposed. After comparing the proposed scheme with five existing schemes via simulations, experiments results reveal that the CJSR scheme could reduce the total number of processed interest packets by 54.8%, enhance the cache hits of each CR and reduce the number of total hop counts by 51.6% and cut down the length of routing path for users to obtain their interested data by 28.6⁻85.7% compared with the traditional NDN scheme. Moreover, the length of uploading routing path could be decreased by 8.3⁻33.3%.
Collapse
Affiliation(s)
- Baixiang Huang
- School of Information Science and Engineering, Central South University, Changsha 410083, China.
| | - Anfeng Liu
- School of Information Science and Engineering, Central South University, Changsha 410083, China.
- The State Key Laboratory of Industrial Control Technology, Zhejiang University, Hangzhou 310027, China.
| | - Chengyuan Zhang
- School of Information Science and Engineering, Central South University, Changsha 410083, China.
| | - Naixue Xiong
- Department of Mathematics and Computer Science, Northeastern State University, Tahlequah, OK 74464, USA.
| | - Zhiwen Zeng
- School of Information Science and Engineering, Central South University, Changsha 410083, China.
| | - Zhiping Cai
- Department of Network Engineering, School of Computer, National University of Defense Technology, Changsha 410073, China.
| |
Collapse
|
7
|
Wu M, Wu Y, Liu C, Cai Z, Xiong NN, Liu A, Ma M. An Effective Delay Reduction Approach through a Portion of Nodes with a Larger Duty Cycle for Industrial WSNs. SENSORS 2018; 18:s18051535. [PMID: 29757236 PMCID: PMC5982409 DOI: 10.3390/s18051535] [Citation(s) in RCA: 21] [Impact Index Per Article: 3.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 03/31/2018] [Revised: 05/05/2018] [Accepted: 05/05/2018] [Indexed: 11/25/2022]
Abstract
For Industrial Wireless Sensor Networks (IWSNs), sending data with timely style to the stink (or control center, CC) that is monitored by sensor nodes is a challenging issue. However, in order to save energy, wireless sensor networks based on a duty cycle are widely used in the industrial field, which can bring great delay to data transmission. We observe that if the duty cycle of a small number of nodes in the network is set to 1, the sleep delay caused by the duty cycle can be effectively reduced. Thus, in this paper, a novel Portion of Nodes with Larger Duty Cycle (PNLDC) scheme is proposed to reduce delay and optimize energy efficiency for IWSNs. In the PNLDC scheme, a portion of nodes are selected to set their duty cycle to 1, and the proportion of nodes with the duty cycle of 1 is determined according to the energy abundance of the area in which the node is located. The more the residual energy in the region, the greater the proportion of the selected nodes. Because there are a certain proportion of nodes with the duty cycle of 1 in the network, the PNLDC scheme can effectively reduce delay in IWSNs. The performance analysis and experimental results show that the proposed scheme significantly reduces the delay for forwarding data by 8.9~26.4% and delay for detection by 2.1~24.6% without reducing the network lifetime when compared with the fixed duty cycle method. Meanwhile, compared with the dynamic duty cycle strategy, the proposed scheme has certain advantages in terms of energy utilization and delay reduction.
Collapse
Affiliation(s)
- Minrui Wu
- School of Information Science and Engineering, Central South University, Changsha 410083, China.
| | - Yanhui Wu
- College of computer and information engineering, Hunan University of Commerce, Changsha 410205, China.
| | - Chuyao Liu
- School of Software, Central South University, Changsha 410075, China.
| | - Zhiping Cai
- College of Computer, National University of Defense Technology, Changsha 410073, China.
| | - Neal N Xiong
- Department of Mathematics and Computer Science, Northeastern State University, Tahlequah, OK 74464, USA.
| | - Anfeng Liu
- School of Information Science and Engineering, Central South University, Changsha 410083, China.
- The State Key Laboratory of Industrial Control Technology, Zhejiang University, Hangzhou 310027, China.
| | - Ming Ma
- Department of Computer Science, Stony Brook University, Stony Brook, NY 11794, USA.
| |
Collapse
|
8
|
Yu S, Liu X, Liu A, Xiong N, Cai Z, Wang T. An Adaption Broadcast Radius-Based Code Dissemination Scheme for Low Energy Wireless Sensor Networks. SENSORS 2018; 18:s18051509. [PMID: 29748525 PMCID: PMC5982939 DOI: 10.3390/s18051509] [Citation(s) in RCA: 22] [Impact Index Per Article: 3.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 03/24/2018] [Revised: 04/30/2018] [Accepted: 05/07/2018] [Indexed: 11/16/2022]
Abstract
Due to the Software Defined Network (SDN) technology, Wireless Sensor Networks (WSNs) are getting wider application prospects for sensor nodes that can get new functions after updating program codes. The issue of disseminating program codes to every node in the network with minimum delay and energy consumption have been formulated and investigated in the literature. The minimum-transmission broadcast (MTB) problem, which aims to reduce broadcast redundancy, has been well studied in WSNs where the broadcast radius is assumed to be fixed in the whole network. In this paper, an Adaption Broadcast Radius-based Code Dissemination (ABRCD) scheme is proposed to reduce delay and improve energy efficiency in duty cycle-based WSNs. In the ABCRD scheme, a larger broadcast radius is set in areas with more energy left, generating more optimized performance than previous schemes. Thus: (1) with a larger broadcast radius, program codes can reach the edge of network from the source in fewer hops, decreasing the number of broadcasts and at the same time, delay. (2) As the ABRCD scheme adopts a larger broadcast radius for some nodes, program codes can be transmitted to more nodes in one broadcast transmission, diminishing the number of broadcasts. (3) The larger radius in the ABRCD scheme causes more energy consumption of some transmitting nodes, but radius enlarging is only conducted in areas with an energy surplus, and energy consumption in the hot-spots can be reduced instead due to some nodes transmitting data directly to sink without forwarding by nodes in the original hot-spot, thus energy consumption can almost reach a balance and network lifetime can be prolonged. The proposed ABRCD scheme first assigns a broadcast radius, which doesn’t affect the network lifetime, to nodes having different distance to the code source, then provides an algorithm to construct a broadcast backbone. In the end, a comprehensive performance analysis and simulation result shows that the proposed ABRCD scheme shows better performance in different broadcast situations. Compared to previous schemes, the transmission delay is reduced by 41.11~78.42%, the number of broadcasts is reduced by 36.18~94.27% and the energy utilization ratio is improved up to 583.42%, while the network lifetime can be prolonged up to 274.99%.
Collapse
Affiliation(s)
- Shidi Yu
- School of Information Science and Engineering, Central South University, Changsha 410083, China.
| | - Xiao Liu
- School of Information Science and Engineering, Central South University, Changsha 410083, China.
| | - Anfeng Liu
- School of Information Science and Engineering, Central South University, Changsha 410083, China.
- The State Key Laboratory of Industrial Control Technology, Zhejiang University, Hangzhou 310027, China.
| | - Naixue Xiong
- Department of Mathematics and Computer Science, Northeastern State University, Tahlequah, OK 74464, USA.
| | - Zhiping Cai
- Department of Network Engineering, School of Computer, National University of Defense Technology, Changsha 410073, China.
| | - Tian Wang
- School of Computer Science, National Huaqiao University, Quanzhou 362000, China.
| |
Collapse
|
9
|
A Cross-Layer Optimized Opportunistic Routing Scheme for Loss-and-Delay Sensitive WSNs. SENSORS 2018; 18:s18051422. [PMID: 29751589 PMCID: PMC5982429 DOI: 10.3390/s18051422] [Citation(s) in RCA: 21] [Impact Index Per Article: 3.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 04/02/2018] [Revised: 04/29/2018] [Accepted: 05/01/2018] [Indexed: 11/17/2022]
Abstract
In wireless sensor networks (WSNs), communication links are typically error-prone and unreliable, so providing reliable and timely data routing for loss- and delay-sensitive applications in WSNs it is a challenge issue. Additionally, with specific thresholds in practical applications, the loss and delay sensitivity implies requirements for high reliability and low delay. Opportunistic Routing (OR) has been well studied in WSNs to improve reliability for error-prone and unreliable wireless communication links where the transmission power is assumed to be identical in the whole network. In this paper, a Cross-layer Optimized Opportunistic Routing (COOR) scheme is proposed to improve the communication link reliability and reduce delay for loss-and-delay sensitive WSNs. The main contribution of the COOR scheme is making full use of the remaining energy in networks to increase the transmission power of most nodes, which will provide a higher communication reliability or further transmission distance. Two optimization strategies referred to as COOR(R) and COOR(P) of the COOR scheme are proposed to improve network performance. In the case of increasing the transmission power, the COOR(R) strategy chooses a node that has a higher communication reliability with same distance in comparison to the traditional opportunistic routing when selecting the next hop candidate node. Since the reliability of data transmission is improved, the delay of the data reaching the sink is reduced by shortening the time of communication between candidate nodes. On the other hand, the COOR(P) strategy prefers a node that has the same communication reliability with longer distance. As a result, network performance can be improved for the following reasons: (a) the delay is reduced as fewer hops are needed while the packet reaches the sink in longer transmission distance circumstances; (b) the reliability can be improved since it is the product of the reliability of every hop of the routing path, and the count is reduced while the reliability of each hop is the same as the traditional method. After analyzing the energy consumption of the network in detail, the value of optimized transmission power in different areas is given. On the basis of a large number of experimental and theoretical analyses, the results show that the COOR scheme will increase communication reliability by 36.62–87.77%, decrease delay by 21.09–52.48%, and balance the energy consumption of 86.97% of the nodes in the WSNs.
Collapse
|