ABEAT: Efficient and Anonymous Encryption for ABE-based Dynamic Group Communication

• URL: http://arxiv.org/abs/2608.19302v1
• Date: Wed, 19 Aug 2026 17:25:42 GMT
• Title: ABEAT: Efficient and Anonymous Encryption for ABE-based Dynamic Group Communication
• Abstract summary: We leverage attribute-based vector encryption (ABE) for confidential group communication.<n>In this paper, we focus on the important additional need to maintain the anonymity of recipients of a message.<n>We propose ABEAT, an efficient and anonymous dynamic group communication system.
• Score: 8.167919749320266
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Confidential communication among a dynamic group of participants that ensures flexible and efficient many-to- many communication is highly desired capability. We leverage attribute-based encryption (ABE) for confidential group communication and enhance it by a graph-based namespace to create an efficient framework that allows groups to be formed and changed dynamically. In this paper, we focus on the important additional need to maintain the anonymity of recipients of a message, when using ABE for group communication for a variety of usage scenarios (e.g., emergency response). We propose ABEAT, an efficient and anonymous dynamic group communication system that also minimizes overhead on receivers who are not the intended recipients of a message. In ABEAT, we propose a new anonymous KP-ABE approach to maintain recipient anonymity. ABEAT hides the clear attribute in the ciphertext of KP-ABE, and also prevents several attacks that seek to break anonymity. ABEAT provides fast recipient verification, dramatically lowering the decryption overhead for non-recipients by more than a factor of 90 versus the current state of the art such as hidden vector encryption (HVE). In fact, it is even 40% less than FABEO, which offers no anonymity.

Related papers

• Stop Tracking Me! Proactive Defense Against Attribute Inference Attack in LLMs [61.15237978606501]
  Large language models can infer private user attributes from user-generated text.<n>Existing anonymization-based defenses are coarse-grained, lacking word-level precision in anonymizing privacy-leaking elements.<n>We propose a unified defense framework that combines fine-grained anonymization (TRACE) with inference-preventing optimization (RPS)
  arXiv  Detail & Related papers  (2026-02-12T03:37:50Z)
• Federated Anonymous Blocklisting across Service Providers and its Application to Group Messaging [1.7616042687330637]
  In Anonymous Blocklisting schemes, users must prove during authentication that none of their previous pseudonyms has been blocked.<n>We propose an alternative textitFederated Anonymous Blocklisting (FAB) in which the centralised Service Provider is replaced by small distributed Realms.
  arXiv  Detail & Related papers  (2025-11-05T14:11:46Z)
• When UAV Swarm Meets IRS: Collaborative Secure Communications in Low-altitude Wireless Networks [68.45202147860537]
  Low-altitude wireless networks (LAWNs) provide enhanced coverage, reliability, and throughput for diverse applications.<n>These networks face significant security vulnerabilities from both known and potential unknown eavesdroppers.<n>We propose a novel secure communication framework for LAWNs where the selected UAVs within a swarm function as a virtual antenna array.
  arXiv  Detail & Related papers  (2025-10-25T02:02:14Z)
• Lattice-Based Dynamic $k$-Times Anonymous Authentication [12.008179370101539]
  $k$-times anonymous authentication ($k$-TAA) scheme allows members of a group to be authenticated anonymously by application providers up to $k$ times.<n>Considering quantum computing attacks, lattice-based $k$-TAA was introduced.<n>First lattice-based dynamic $k$-TAA offers limited times anonymous authentication, dynamic member management, and post-quantum security.
  arXiv  Detail & Related papers  (2025-09-26T02:42:31Z)
• VoxGuard: Evaluating User and Attribute Privacy in Speech via Membership Inference Attacks [51.68795949691009]
  We introduce VoxGuard, a framework grounded in differential privacy and membership inference.<n>For attributes, we show that simple transparent attacks recover gender and accent with near-perfect accuracy even after anonymization.<n>Our results demonstrate that EER substantially underestimates leakage, highlighting the need for low-FPR evaluation.
  arXiv  Detail & Related papers  (2025-09-22T20:57:48Z)
• AgentStealth: Reinforcing Large Language Model for Anonymizing User-generated Text [8.758843436588297]
  AgentStealth is a self-reinforcing language model for text anonymization.<n>We show that our method outperforms baselines in both anonymization effectiveness and utility.<n>Our lightweight design supports direct deployment on edge devices, avoiding cloud reliance and communication-based privacy risks.
  arXiv  Detail & Related papers  (2025-06-26T02:48:16Z)
• Toward Mixture-of-Experts Enabled Trustworthy Semantic Communication for 6G Networks [82.3753728955968]
  We introduce a novel Mixture-of-Experts (MoE)-based SemCom system. This system comprises a gating network and multiple experts, each specializing in different security challenges. The gating network adaptively selects suitable experts to counter heterogeneous attacks based on user-defined security requirements. A case study in vehicular networks demonstrates the efficacy of the MoE-based SemCom system.
  arXiv  Detail & Related papers  (2024-09-24T03:17:51Z)
• 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)
• Attribute-Based Authentication in Secure Group Messaging for Distributed Environments [2.254434034390528]
  Messaging Layer security (MLS) and its underlying Continuous Group Key Agreement protocol allow a group of users to share a cryptographic secret in a dynamic manner.<n>The use of digital certificates for authentication in a group goes against the group members' privacy.<n>We provide an alternative method of authentication in which the solicitors, instead of revealing their identity, only need to prove possession of certain attributes.
  arXiv  Detail & Related papers  (2024-05-20T14:09:28Z)
• Adversarial Attacks On Multi-Agent Communication [80.4392160849506]
  Modern autonomous systems will soon be deployed at scale, opening up the possibility for cooperative multi-agent systems. Such advantages rely heavily on communication channels which have been shown to be vulnerable to security breaches. In this paper, we explore such adversarial attacks in a novel multi-agent setting where agents communicate by sharing learned intermediate representations.
  arXiv  Detail & Related papers  (2021-01-17T00:35:26Z)

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.