Haina Storage: A Decentralized Secure Storage Framework Based on Improved Blockchain Structure

• URL: http://arxiv.org/abs/2404.01606v1
• Date: Tue, 2 Apr 2024 02:56:27 GMT
• Title: Haina Storage: A Decentralized Secure Storage Framework Based on Improved Blockchain Structure
• Authors: Zijian Zhou, Caimei Wang, Xiaoheng Deng, Jianhao Lu, Qilue Wen, Chen Zhang, Hong Li,
• Abstract summary: Decentralized storage based on the blockchain can effectively realize secure data storage on cloud services. However, there are still some problems in the existing schemes, such as low storage capacity and low efficiency. We propose a novel decentralized storage framework, which mainly includes four aspects.
• Score: 8.876894626151797
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Although the decentralized storage technology based on the blockchain can effectively realize secure data storage on cloud services. However, there are still some problems in the existing schemes, such as low storage capacity and low efficiency. To address related issues, we propose a novel decentralized storage framework, which mainly includes four aspects: (1) we proposed a Bi-direction Circular Linked Chain Structure (BCLCS), which improves data's storage capacity and applicability in decentralized storage. (2) A Proof of Resources (PoR) decision model is proposed. By introducing the network environment as an essential evaluation parameter of storage right decision, the energy and time consumption of decision-making are reduced, and the fairness of decision-making is improved. (3) A chain structure dynamic locking mechanism (CSDLM) is designed to realize anti-traverse and access control. (4) A Bi-directional data Access Mechanism (BDAM) is proposed, which improves the efficiency of data access and acquisition in decentralized storage mode. The experimental results show that the framework has significantly improved the shortcomings of the current decentralized storage.

Related papers

• DBNode: A Decentralized Storage System for Big Data Storage in Consortium Blockchains [2.474908349649168]
  This paper proposes a decentralized storage system for Hyperledger Fabric. We employ erasure coding to partition files, then organize these chunks into a hierarchical structure. We design a two-layer hash-slots mechanism and a mirror strategy, enabling high data availability.
  arXiv  Detail & Related papers  (2024-09-30T09:22:15Z)
• Verifiable Decentralized IPFS Cluster: Unlocking Trustworthy Data Permanency for Off-Chain Storage [0.0]
  This paper introduces Verifiable Decentralized IPFS Clusters (VDICs) to enhance off-chain storage reliability with verifiable data permanency guarantees. Performance evaluations demonstrate that VDICs are competitive with traditional pinning services.
  arXiv  Detail & Related papers  (2024-08-09T08:26:55Z)
• Decentralized Federated Anomaly Detection in Smart Grids: A P2P Gossip Approach [0.44328715570014865]
  This paper introduces a novel decentralized federated anomaly detection scheme based on two main gossip protocols namely Random Walk and Epidemic. Our approach yields a notable 35% improvement in training time compared to conventional Federated Learning.
  arXiv  Detail & Related papers  (2024-07-20T10:45:06Z)
• Digital Twin-Assisted Data-Driven Optimization for Reliable Edge Caching in Wireless Networks [60.54852710216738]
  We introduce a novel digital twin-assisted optimization framework, called D-REC, to ensure reliable caching in nextG wireless networks. By incorporating reliability modules into a constrained decision process, D-REC can adaptively adjust actions, rewards, and states to comply with advantageous constraints.
  arXiv  Detail & Related papers  (2024-06-29T02:40:28Z)
• FileDES: A Secure Scalable and Succinct Decentralized Encrypted Storage Network [30.775493810737192]
  Decentralized Storage Network (DSN) is an emerging technology that challenges traditional cloud-based storage systems. We propose FileDES, which incorporates three essential elements: privacy preservation, scalable storage proof, and batch verification. Our protocol outperforms the others in terms of proof generation/verification efficiency, storage costs, and scalability.
  arXiv  Detail & Related papers  (2024-03-22T06:41:30Z)
• Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0 [59.94605620983965]
  We design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0. To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model. Considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory.
  arXiv  Detail & Related papers  (2024-03-20T01:58:38Z)
• Decentralized Stochastic Optimization with Inherent Privacy Protection [103.62463469366557]
  Decentralized optimization is the basic building block of modern collaborative machine learning, distributed estimation and control, and large-scale sensing. Since involved data, privacy protection has become an increasingly pressing need in the implementation of decentralized optimization algorithms.
  arXiv  Detail & Related papers  (2022-05-08T14:38:23Z)
• Distributed Reinforcement Learning for Privacy-Preserving Dynamic Edge Caching [91.50631418179331]
  A privacy-preserving distributed deep policy gradient (P2D3PG) is proposed to maximize the cache hit rates of devices in the MEC networks. We convert the distributed optimizations into model-free Markov decision process problems and then introduce a privacy-preserving federated learning method for popularity prediction.
  arXiv  Detail & Related papers  (2021-10-20T02:48:27Z)
• Neural Network Compression for Noisy Storage Devices [71.4102472611862]
  Conventionally, model compression and physical storage are decoupled. This approach forces the storage to treat each bit of the compressed model equally, and to dedicate the same amount of resources to each bit. We propose a radically different approach that: (i) employs analog memories to maximize the capacity of each memory cell, and (ii) jointly optimize model compression and physical storage to maximize memory utility.
  arXiv  Detail & Related papers  (2021-02-15T18:19:07Z)
• Topology-aware Differential Privacy for Decentralized Image Classification [81.2202290003513]
  Top-DP is a novel solution to optimize the differential privacy protection of decentralized image classification systems. We leverage the unique features of decentralized communication topologies to reduce the noise scale and improve the model usability.
  arXiv  Detail & Related papers  (2020-06-14T06:42:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.