Skip to content
Conference

FSC-CD: A Feature–Structure Coupled Approach for Community Deception in Networks

Jul 2026 · International Conferences on Human-Machine Systems · pp. 358-365 · 0 citations · 25 references

Abstract

Many real-world networks, such as social and biological networks, exhibit community structures. Community detection algorithms extract valuable insights from these networks by identifying densely connected groups, enabling applications such as recommendation, behavior understanding, and system optimization. However, growing concerns about data privacy and security have led to techniques that protect user information from being over-inferred within communities. This has given rise to community deception (CD), which introduces small, targeted perturbations to a network to obscure sensitive communities from detection algorithms. Most existing community deception approaches focus on modifying network topology, often neglecting the rich feature information embedded within communities. In this paper, we propose FSC-CD (Feature-Structure Coupled Community Deception), which couples feature-derived representations with structural cues to improve community concealment. FSC-CD is effective for both single-community deception and randomized multi-community hiding. A key innovation is a budget allocation strategy that optimizes the distribution of perturbations to maximize deception efficiency. Moreover, by exploiting feature similarity, FSC-CD designs an edge perturbation mechanism that improves stability under small perturbation budgets. Extensive experiments on three real-world network datasets across multiple community detectors show that FSC-CD is more stable and consistently outperforms baseline methods in hiding both single and multiple communities, reducing the detection accuracy by up to 17.6 % compared to state-of-the-art approaches.

View source

Similar papers

Jul 2026

Global community deception via a cooperative evolutionary genetic algorithm based on an elite population

A novel method is designed that disrupts the structure of the original network by adding and deleting edges, ensuring an equal number of additions and deletions, with the aim to enhance concealment and address the issue of inadequate deception.

Guixiang Zhu, Lei Chen, Haobin Cao et al. · 0 citations
Preprint Jul 2026

Comprehensive, Efficient Large-Scale Community Detection via Structural Entropy Game

A novel heuristic community detection algorithm, termed CoDeSEG, which identifies communities by minimizing the network's two-dimensional structural entropy within a potential game framework, and introduces a structural entropy-based node overlapping heuristic for detecting overlapping communities, with a near-linear time complexity.

Pu Li, Yantuan Xian, Hao Peng et al. · 0 citations
2026

ESecDT: Communication-Efficient and Secure Decision Tree Training Framework

Decision trees are widely used in various domains, such as user behavior analysis and financial risk assessment. Recently, increasing concerns about data privacy have driven the development of secure decision tree training frameworks. We propose ESecDT, a novel framework that enables collaborative decision tree training while preserving participants’ training data. ESecDT integrates the computational advantages of Function Secret Sharing (FSS) and Replicated Secret Sharing (RSS) through a co-design approach. We first introduce new protocols based on this co-design for tree training building blocks, including GroupSum, GroupPrefixSum, and VecMMax. Subsequently, we design a bit-width-aware training framework that manages data with different bit-widths and supports FSS key reuse. These designs enable ESecDT to ensure strong privacy guarantees, preserving the training data and all intermediate variables throughout the training process, while maintaining practical efficiency. Extensive experiments on nine real-world and synthetic datasets demonstrate that ESecDT reduces online communication overhead by <inline-formula> <tex-math notation="LaTeX">$4.25\times $ </tex-math></inline-formula>–<inline-formula> <tex-math notation="LaTeX">$5.56\times $ </tex-math></inline-formula> versus state-of-the-art frameworks. In the WAN setting, ESecDT achieves <inline-formula> <tex-math notation="LaTeX">$1.78\times $ </tex-math></inline-formula>–<inline-formula> <tex-math notation="LaTeX">$4.48\times $ </tex-math></inline-formula> speedup in training runtime and completes a 30,000-sample training task in less than half an hour, demonstrating strong potential for practical deployment.

Jingchen Zhao, Kaping Xue, Meng Li et al. · 0 citations
Open access Jun 2026

Optimizing multi-objective strategies for enhanced Tor De-anonymization

This work model joint node–technique selection as a tri-objective problem balancing attack gain (AP), attack impact (AI), and attack cost (AC) and selects a preference-aware compromise with VIKOR to support better de‑anonymization.

Yali Yuan, Yuchen Zhang, Ruolin Ma et al. · 0 citations
Open access Aug 2026

Social Network Privacy Protection Based on Differential Privacy Technology and Community Discovery Algorithm

The integration of differential privacy and community discovery effectively improves the privacy protection strength and structural analysis accuracy of social networks, providing a highly feasible solution for multi-scenario social data security analysis.

Xia Wu · 0 citations
Jul 2026

Understanding User-Generated Content and Communities in Decentralized Web3 Networks: An Empirical Study on Nostr

This paper presents one of the first large-scale empirical analyses of Nostr, based on 22.3 million user events collected from four major publicly accessible relays, and finds that knowledge-oriented content in Clusters 1 and 5 receives higher Zap engagement, suggesting the socialization of a primarily technical infrastructure.

Shutong Qu, Chunyang Li, Hongzhou Chen et al. · 0 citations