Bloom Filter Look-Up Tables for Private and Secure Distributed Databases in Web3 (Revised Version)
- URL: http://arxiv.org/abs/2602.13167v1
- Date: Fri, 13 Feb 2026 18:25:53 GMT
- Title: Bloom Filter Look-Up Tables for Private and Secure Distributed Databases in Web3 (Revised Version)
- Authors: Shlomi Dolev, Ehud Gudes, Daniel Shlomo,
- Abstract summary: Decentralized systems rely heavily on distributed architectures.<n>Key management is essential for encrypting files, securing database segments, and enabling private transactions.<n>This research proposes a decentralized database scheme specifically designed for secure and private key management.
- Score: 3.9762912548964855
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The rapid growth of decentralized systems in theWeb3 ecosystem has introduced numerous challenges, particularly in ensuring data security, privacy, and scalability [3, 8]. These systems rely heavily on distributed architectures, requiring robust mechanisms to manage data and interactions among participants securely. One critical aspect of decentralized systems is key management, which is essential for encrypting files, securing database segments, and enabling private transactions. However, securely managing cryptographic keys in a distributed environment poses significant risks, especially when nodes in the network can be compromised [9]. This research proposes a decentralized database scheme specifically designed for secure and private key management. Our approach ensures that cryptographic keys are not stored explicitly at any location, preventing their discovery even if an attacker gains control of multiple nodes. Instead of traditional storage, keys are encoded and distributed using the BFLUT (Bloom Filter for Private Look-Up Tables) algorithm [7], which enables secure retrieval without direct exposure. The system leverages OrbitDB [4], IPFS [1], and IPNS [10] for decentralized data management, providing robust support for consistency, scalability, and simultaneous updates. By combining these technologies, our scheme enhances both security and privacy while maintaining high performance and reliability. Our findings demonstrate the system's capability to securely manage keys, prevent unauthorized access, and ensure privacy, making it a foundational solution for Web3 applications requiring decentralized security.
Related papers
- From See to Shield: ML-Assisted Fine-Grained Access Control for Visual Data [40.12543056558646]
This work presents a system architecture for trusted data sharing with policy-driven access control.<n>The proposed architecture integrates automated detection of sensitive regions, post-correction, key management, and access control.<n>We show that our system provides effective PSO detection, increases macro-averaged F1 score (5%) and mean Average Precision (10%), and maintains an average policy-enforced decryption time of less than 1 second per image.
arXiv Detail & Related papers (2025-10-22T09:41:31Z) - PWC-MoE: Privacy-Aware Wireless Collaborative Mixture of Experts [59.5243730853157]
Large language models (LLMs) hosted on cloud servers alleviate the computational and storage burdens on local devices but raise privacy concerns.<n>Small language models (SLMs) running locally enhance privacy but suffer from limited performance on complex tasks.<n>We propose a privacy-aware wireless collaborative mixture of experts (PWC-MoE) framework to balance computational cost, performance, and privacy protection under bandwidth constraints.
arXiv Detail & Related papers (2025-05-13T16:27:07Z) - Acurast: Decentralized Serverless Cloud [37.860555651161796]
Acurast is a serverless cloud with a purpose-built orchestrator and reputation engine.<n>Developers can off-load their computations and verify cryptographically.<n>Acurast offers a modular execution layer, taking advantage of secure hardware and trusted execution environments.
arXiv Detail & Related papers (2025-03-19T19:09:21Z) - Efficient and Secure Cross-Domain Data-Sharing for Resource-Constrained Internet of Things [2.5284780091135994]
We propose an efficient, secure blockchain-based data-sharing scheme for the Internet of Things.
First, our scheme adopts a distributed key generation method, which avoids single point of failure.
Also, the scheme provides a complete data-sharing process, covering data uploading, storage, and sharing, while ensuring data traceability, integrity, and privacy.
arXiv Detail & Related papers (2024-11-14T06:53:03Z) - FL-DABE-BC: A Privacy-Enhanced, Decentralized Authentication, and Secure Communication for Federated Learning Framework with Decentralized Attribute-Based Encryption and Blockchain for IoT Scenarios [0.0]
This study proposes an advanced Learning (FL) framework designed to enhance data privacy and security in IoT environments.
We integrate Decentralized Attribute-Based Encryption (DABE), Homomorphic Encryption (HE), Secure Multi-Party Computation (SMPC) and technology.
Unlike traditional FL, our framework enables secure, decentralized authentication and encryption directly on IoT devices.
arXiv Detail & Related papers (2024-10-26T19:30:53Z) - An Integrated Blockchain and IPFS Solution for Secure and Efficient Source Code Repository Hosting using Middleman Approach [0.9895793818721335]
This study introduces a novel hybrid architecture combining the security of the blockchain and the InterPlanetary File System.<n>Our results demonstrate that this architecture achieves a secure, auditable, and resilient platform for source code hosting.
arXiv Detail & Related papers (2024-09-22T16:57:38Z) - 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.<n>Our approach yields a notable 35% improvement in training time compared to conventional Federated Learning.
arXiv Detail & Related papers (2024-07-20T10:45:06Z) - A Trustworthy AIoT-enabled Localization System via Federated Learning and Blockchain [29.968086297894626]
We propose a framework named DFLoc to achieve precise 3D localization tasks.
Specifically, we address the issue of single-point failure for a reliable and accurate indoor localization system.
We introduce an updated model verification mechanism within the blockchain to alleviate the concern of malicious node attacks.
arXiv Detail & Related papers (2024-07-08T04:14:19Z) - Enc2DB: A Hybrid and Adaptive Encrypted Query Processing Framework [47.11111145443189]
We introduce Enc2DB, a novel secure database system following a hybrid strategy on and openGauss.
We present a micro-benchmarking test and self-adaptive mode switch strategy that can choose the best execution path (cryptography or TEE) to answer a given query.
We also design and implement a ciphertext index compatible with native cost model and querys to accelerate query processing.
arXiv Detail & Related papers (2024-04-10T08:11:12Z) - Blockchain-enabled Data Governance for Privacy-Preserved Sharing of Confidential Data [1.6006586061577806]
We propose a blockchain-based data governance system that employs attribute-based encryption to prevent privacy leakage and credential misuse.
First, our ABE encryption system can handle multi-authority use cases while protecting identity privacy and hiding access policy.
Second, applying the Advanced Encryption Standard (AES) for data encryption makes the whole system efficient and responsive to real-world conditions.
arXiv Detail & Related papers (2023-09-08T05:01:59Z) - An Efficient and Multi-private Key Secure Aggregation for Federated Learning [41.29971745967693]
We propose an efficient and multi-private key secure aggregation scheme for federated learning.
Specifically, we skillfully modify the variant ElGamal encryption technique to achieve homomorphic addition operation.
For the high dimensional deep model parameter, we introduce a super-increasing sequence to compress multi-dimensional data into 1-D.
arXiv Detail & Related papers (2023-06-15T09:05:36Z)
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.