QAE-BAC: Achieving Quantifiable Anonymity and Efficiency in Blockchain-Based Access Control with Attribute

• URL: http://arxiv.org/abs/2510.21124v1
• Date: Fri, 24 Oct 2025 03:28:41 GMT
• Title: QAE-BAC: Achieving Quantifiable Anonymity and Efficiency in Blockchain-Based Access Control with Attribute
• Authors: Jie Zhang, Xiaohong Li, Mengke Zhang, Ruitao Feng, Shanshan Xu, Zhe Hou, Guangdong Bai,
• Abstract summary: This paper introduces a formal (r, t)-anonymity model to quantify the re-identification risk of users based on their access attributes and history.<n>It also features an Entropy-Weighted Path Tree (EWPT) that optimize policy structure based on realtime anonymity metrics.<n> Experimental results show that it effectively mitigates re-identification risks and outperforms state-of-the-art baselines, achieving up to an 11x improvement in throughput and an 87% reduction in latency.
• Score: 15.336260777860462
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Blockchain-based Attribute-Based Access Control (BC-ABAC) offers a decentralized paradigm for secure data governance but faces two inherent challenges: the transparency of blockchain ledgers threatens user privacy by enabling reidentification attacks through attribute analysis, while the computational complexity of policy matching clashes with blockchain's performance constraints. Existing solutions, such as those employing Zero-Knowledge Proofs (ZKPs), often incur high overhead and lack measurable anonymity guarantees, while efficiency optimizations frequently ignore privacy implications. To address these dual challenges, this paper proposes QAEBAC (Quantifiable Anonymity and Efficiency in Blockchain-Based Access Control with Attribute). QAE-BAC introduces a formal (r, t)-anonymity model to dynamically quantify the re-identification risk of users based on their access attributes and history. Furthermore, it features an Entropy-Weighted Path Tree (EWPT) that optimizes policy structure based on realtime anonymity metrics, drastically reducing policy matching complexity. Implemented and evaluated on Hyperledger Fabric, QAE-BAC demonstrates a superior balance between privacy and performance. Experimental results show that it effectively mitigates re-identification risks and outperforms state-of-the-art baselines, achieving up to an 11x improvement in throughput and an 87% reduction in latency, proving its practicality for privacy-sensitive decentralized applications.

Related papers

• RAIN: Secure and Robust Aggregation under Shuffle Model of Differential Privacy [46.52109845749167]
  We present Robust Aggregation in Noise (RAIN), a framework that reconciles privacy, robustness, and verifiability under Shuffle-DP.<n>RAIN adopts sign-space aggregation to robustly measure update consistency and limit malicious influence under noise and anonymization.<n>We show that RAIN maintains strong privacy guarantees under Shuffle-DP and remains robust to poisoning attacks with negligible degradation in accuracy and convergence.
  arXiv  Detail & Related papers  (2026-03-03T15:41:54Z)
• A Critical Look into Threshold Homomorphic Encryption for Private Average Aggregation [45.381652768314375]
  Threshold Homomorphic Encryption (Threshold HE) is a good fit for implementing private federated average aggregation.<n>Recent studies have shown that threshold schemes can introduce unexpected security vulnerabilities if an adversary has access to a restricted decryption oracle.
  arXiv  Detail & Related papers  (2026-02-25T15:45:27Z)
• QDBFT: A Dynamic Consensus Algorithm for Quantum-Secured Blockchain [11.38225673790071]
  Quantum computing poses a significant threat to conventional public-key cryptosystems.<n>We propose QFT, a quantum-secured dynamic consensus algorithm.
  arXiv  Detail & Related papers  (2026-02-12T05:53:51Z)
• A Scalable, Privacy-Preserving Decentralized Identity and Verifiable Data Sharing Framework based on Zero-Knowledge Proofs [9.654506373807852]
  This paper proposes a novel, comprehensive framework that integrates DIDs and VCs with efficient Zero-Knowledge Proof schemes.<n>First, it constructs a set of strong privacy-preserving protocols based on zk-STARKs.<n>Second, it designs a scalable, privacy-preserving credential revocation mechanism based on cryptographic accumulators.<n>Third, it integrates a practical social key recovery scheme, significantly enhancing system usability and security.
  arXiv  Detail & Related papers  (2025-10-10T06:06:05Z)
• Balancing Confidentiality and Transparency for Blockchain-based Process-Aware Information Systems [43.253676241213626]
  We propose an architecture for blockchain-based PAISs to preserve confidentiality and transparency.<n>Smart contracts enact, enforce and store public interactions, while attribute-based encryption techniques are adopted to specify access grants to confidential information.<n>We assess the security of our solution through a systematic threat model analysis and evaluate its practical feasibility.
  arXiv  Detail & Related papers  (2024-12-07T20:18:36Z)
• Robust Utility-Preserving Text Anonymization Based on Large Language Models [80.5266278002083]
  Anonymizing text that contains sensitive information is crucial for a wide range of applications.<n>Existing techniques face the emerging challenges of the re-identification ability of large language models.<n>We propose a framework composed of three key components: a privacy evaluator, a utility evaluator, and an optimization component.
  arXiv  Detail & Related papers  (2024-07-16T14:28:56Z)
• DecTest: A Decentralised Testing Architecture for Improving Data Accuracy of Blockchain Oracle [5.327976961338759]
  We introduce a new Decentralized Testing architecture (DecTest) that aims to improve data accuracy. A blockchain oracle random secret testing mechanism is first proposed to enhance the monitoring and verification of nodes. We successfully reduced the discrete entropy value of the acquired data and the real value of the data by 61.4%.
  arXiv  Detail & Related papers  (2024-04-21T05:10:17Z)
• 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)
• TernaryVote: Differentially Private, Communication Efficient, and Byzantine Resilient Distributed Optimization on Heterogeneous Data [50.797729676285876]
  We propose TernaryVote, which combines a ternary compressor and the majority vote mechanism to realize differential privacy, gradient compression, and Byzantine resilience simultaneously. We theoretically quantify the privacy guarantee through the lens of the emerging f-differential privacy (DP) and the Byzantine resilience of the proposed algorithm.
  arXiv  Detail & Related papers  (2024-02-16T16:41:14Z)
• Generative AI-enabled Blockchain Networks: Fundamentals, Applications, and Case Study [73.87110604150315]
  Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology. In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
  arXiv  Detail & Related papers  (2024-01-28T10:46:17Z)
• 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)
• A lightweight blockchain-based access control scheme for integrated edge computing in the internet of things [4.308257382729074]
  We propose an attribute-based encryption and access control scheme (ABE-ACS) for the Edge-Iot network. For the problems of high resource consumption and difficult deployment of existing blockchain platforms, we design a lightweight blockchain (LBC) Six smart contracts are designed to realize the ABAC and penalty mechanism, with which ABE is outsourced to edge nodes for privacy and integrity.
  arXiv  Detail & Related papers  (2021-11-12T02:56:09Z)
• Identity Inference on Blockchain using Graph Neural Network [5.5927440285709835]
  Identity inference, which aims to make a preliminary inference about account identity, plays a significant role in blockchain security. We present a novel approach to analyze user's behavior from the perspective of the transaction subgraph, which naturally transforms the identity inference task into a graph classification pattern. We also propose a generic end-to-end graph neural network model, named $textI2 textBGNN$, which can accept subgraph as input and learn a function mapping the transaction subgraph pattern to account identity.
  arXiv  Detail & Related papers  (2021-04-14T00:15:38Z)

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.