Searcharxiv⌕ Search

arXiv subjects

Yue Xiao

Publications and source records attributed to Yue Xiao.

At least 37 records · Page 2Linked to original sources

Understanding Human-AI Collaboration in Cybersecurity Competitions

Capture-the-Flag (CTF) competitions are increasingly becoming a testbed for evaluating AI capabilities at solving security tasks, due to the controlled environments and objective success criteria. Existing evaluations have focused on how successful AI is at solving CTF challenges in isolation from human CTF players. As AI usage increases in both academic and industrial settings, it is equally likely that human players may collaborate with AI agents to solve challenges. This possibility exposes a key knowledge gap: how do humans perceive AI CTF assistance; when assistance is provided, how do they collaborate and is it effective with respect to human performance; how do humans assisted by AI compare to the performance of fully autonomous AI agents on the same challenges. We address this gap with the first empirical study of AI assistance in a live, onsite CTF. In a study with 41 participants, we qualitatively study (i) how participants' perception, trust, and expectations shift before versus after hands-on AI use, and (ii) how participants collaborate with an instrumented AI agent. Moreover, we also (iii) benchmark four autonomous AI agents on the same fresh challenge set to compare outcomes with human teams and analyze agent trajectories. We find that, as the competition progresses, teams increasingly delegate larger subtasks to the AI, giving it more agency. Interestingly, CTF challenges solving rates are often constrained not by model's reasoning capabilities, but rather by the human players: ineffective prompting and poor context specification become the primary bottleneck. Remarkably, autonomous agents that self-direct their prompting and tool use bypass this bottleneck and outperform most human teams, coming in second overall in the competition. We conclude with implications for the future design of CTF challenges and for building effective human-in-the-loop AI systems for security.

cs.CR↗

"Are You Sure?": An Empirical Study of Human Perception Vulnerability in LLM-Driven Agentic Systems

Large language model (LLM) agents are rapidly becoming trusted copilots in high-stakes domains like software development and healthcare. However, this deepening trust introduces a novel attack surface: Agent-Mediated Deception (AMD), where compromised agents are weaponized against their human users. While extensive research focuses on agent-centric threats, human susceptibility to deception by a compromised agent remains unexplored. We present the first large-scale empirical study with 303 participants to measure human susceptibility to AMD. This is based on HAT-Lab (Human-Agent Trust Laboratory), a high-fidelity research platform we develop, featuring nine carefully crafted scenarios spanning everyday and professional domains (e.g., healthcare, software development, human resources). Our 10 key findings reveal significant vulnerabilities and provide future defense perspectives. Specifically, only 8.6% of participants perceive AMD attacks, while domain experts show increased susceptibility in certain scenarios. We identify six cognitive failure modes in users and find that their risk awareness often fails to translate to protective behavior. The defense analysis reveals that effective warnings should interrupt workflows with low verification costs. With experiential learning based on HAT-Lab, over 90% of users who perceive risks report increased caution against AMD. This work provides empirical evidence and a platform for human-centric agent security research.

cs.HC↗

Automating Agent Hijacking via Structural Template Injection

Agent hijacking, highlighted by OWASP as a critical threat to the Large Language Model (LLM) ecosystem, enables adversaries to manipulate execution by injecting malicious instructions into retrieved content. Most existing attacks rely on manually crafted, semantics-driven prompt manipulation, which often yields low attack success rates and limited transferability to closed-source commercial models. In this paper, we propose Phantom, an automated agent hijacking framework built upon Structured Template Injection that targets the fundamental architectural mechanisms of LLM agents. Our key insight is that agents rely on specific chat template tokens to separate system, user, assistant, and tool instructions. By injecting optimized structured templates into the retrieved context, we induce role confusion and cause the agent to misinterpret the injected content as legitimate user instructions or prior tool outputs. To enhance attack transferability against black-box agents, Phantom introduces a novel attack template search framework. We first perform multi-level template augmentation to increase structural diversity and then train a Template Autoencoder (TAE) to embed discrete templates into a continuous, searchable latent space. Subsequently, we apply Bayesian optimization to efficiently identify optimal adversarial vectors that are decoded into high-potency structured templates. Extensive experiments on Qwen, GPT, and Gemini demonstrate that our framework significantly outperforms existing baselines in both Attack Success Rate (ASR) and query efficiency. Moreover, we identified over 70 vulnerabilities in real-world commercial products that have been confirmed by vendors, underscoring the practical severity of structured template-based hijacking and providing an empirical foundation for securing next-generation agentic systems.

cs.AI↗

Ergodic Rate Analysis of Two-State Pinching-Antenna Systems

Flexible Antenna Systems (FAS) are a key enabler of next-generation wireless networks, allowing the antenna aperture to be dynamically reconfigured to adapt to channel conditions and service requirements. In this context, pinching-antenna systems (PASs) implemented on software-controllable dielectric waveguides provide the ability to reconfigure both channel characteristics and path loss by selectively exciting discrete radiation points. Existing works, however, typically assume continuously adjustable pinching positions, neglecting the spatial discreteness imposed by practical implementations. This paper develops a closed-form analytical framework for the ergodic rate of two-state PASs, where pinching antennas are fixed and only their activation states are controlled. To quantify the impact of spatial discretization, pinching discretization efficiency is introduced, characterizing the performance gap relative to the ideal continuous case. Finally, numerical results show that near-continuous performance can be achieved with a limited number of pinching points, providing design insights for scalable PASs.

cs.IT↗

How Many Pinching Antennas Are Enough?

Programmable wireless environments (PWEs) have emerged as a key paradigm for next-generation communication networks, aiming to transform wireless propagation from an uncontrollable phenomenon into a reconfigurable process that can adapt to diverse service requirements. In this framework, pinching-antenna systems (PASs) have recently been proposed as a promising enabling technology, as they allow the radiation location and effective propagation distance to be adjusted by selectively exciting radiating points along a dielectric waveguide. However, most existing studies on PASs rely on the idealized assumption that pinching-antenna (PA) positions can be continuously adjusted along the waveguide, while realistically only a finite set of pinching locations is available. Motivated by this, this paper analyzes the performance of two-state PASs, where the PA positions are fixed and only their activation state can be controlled. By explicitly accounting for the spatial discreteness of the available pinching points, closed-form analytical expressions for the outage probability and the ergodic achievable data rate are derived. In addition, we introduce the pinching discretization efficiency to quantify the performance gap between discrete and continuous pinching configurations, enabling a direct assessment of the number of PAs required to approximate the ideal continuous case. Finally, numerical results validate the analytical framework and show that near-continuous performance can be achieved with a limited number of PAs, offering useful insights for the design and deployment of PASs in PWEs.

cs.NI↗

Joint Channel Estimation and Localization in Pinching-Antenna OFDM Systems: The Blessing of Multipath

Pinching-antenna systems (PASS) have recently attracted considerable attention owing to their capability of flexibly reconfiguring large-scale wireless channels. Motivated by this potential, we investigate the issue of joint localization and channel estimation for the uplink PASS in the presence of multipath dispersion. To this end, a comprehensive multi-user orthogonal frequency division multiplexing (OFDM) uplink PASS model is first established, where the use of a cyclic prefix (CP) enables the multipath-induced time-domain dispersion to be transformed into a set of superimposed sinusoids in the frequency domain. Building upon this model, we propose a hybrid inference framework capable of accurately estimating both channel parameters and user locations. Specifically, expectation propagation is first employed to mitigate multi-user interference, while the path delays are then extracted from noisy channel state information using an orthogonal matching pursuit (OMP) based approach, or a hybrid belief propagation-variational inference (BP-VI) algorithm. Then the estimated delays are subsequently refined through the embedded geometric information via an iterative localization procedure, wherein the estimated channel matrices are recursively fed back to EP. Furthermore, the Cramer-Rao lower bound (CRLB) is derived to characterize the fundamental estimation limits. Finally, simulation results validate that our proposed framework closely approaches the CRLB, with performance comparable to cooperative multi-base station localization, with significantly fewer RF chains and reduced hardware complexity.

eess.SP↗

Two-Dimensional Pinching-Antenna Systems: Modeling and Beamforming Design

Recently, the pinching-antenna system (PASS) has emerged as a promising architecture owing to its ability to reconfigure large-scale path loss and signal phase by activating radiation points along a dielectric waveguide. However, existing studies mainly focus on line-shaped PASS architectures, whose limited spatial flexibility constrains their applicability in multiuser and indoor scenarios. In this paper, we propose a novel two-dimensional (2D) pinching-antenna system (2D-PASS) that extends the conventional line-shaped structure into a continuous dielectric waveguide plane, thereby forming a reconfigurable radiating plane capable of dynamic beam adaptation across a 2D spatial domain. An optimization framework is developed to maximize the minimum received signal-to-noise ratio (SNR) among user equipments (UEs) by adaptively adjusting the spatial configuration of pinching antennas (PAs), serving as an analog beamforming mechanism for dynamic spatial control. For the continuous-position scenario, a particle swarm optimization (PSO)-based algorithm is proposed to efficiently explore the nonconvex search space, while a discrete variant is introduced to accommodate practical hardware constraints with limited PA placement resolution. Simulation results demonstrate that the proposed 2D-PASS substantially improves the minimum SNR compared with conventional line-shaped PASS and fixed-position antenna (FPA) benchmarks, while maintaining robustness under varying user distributions and distances.

eess.SP↗

One Bug, Hundreds Behind: LLMs for Large-Scale Bug Discovery

Fixing bugs in large programs is a challenging task that demands substantial time and effort. Once a bug is found, it is reported to the project maintainers, who work with the reporter to fix it and eventually close the issue. However, across the program, there are often similar code segments, which may also contain the bug, but were missed during discovery. Finding and fixing each recurring bug instance individually is labor intensive. Even more concerning, bug reports can inadvertently widen the attack surface as they provide attackers with an exploitable pattern that may be unresolved in other parts of the program. In this paper, we explore these Recurring Pattern Bugs (RPBs) that appear repeatedly across various code segments of a program or even in different programs, stemming from a same root cause, but are unresolved. Our investigation reveals that RPBs are widespread and can significantly compromise the security of software programs. This paper introduces BugStone, a program analysis system empowered by LLVM and a Large Language Model (LLM). The key observation is that many RPBs have one patched instance, which can be leveraged to identify a consistent error pattern, such as a specific API misuse. By examining the entire program for this pattern, it is possible to identify similar sections of code that may be vulnerable. Starting with 135 unique RPBs, BugStone identified more than 22K new potential issues in the Linux kernel. Manual analysis of 400 of these findings confirmed that 246 were valid. We also created a dataset from over 1.9K security bugs reported by 23 recent top-tier conference works. We manually annotate the dataset, identify 80 recurring patterns and 850 corresponding fixes. Even with a cost-efficient model choice, BugStone achieved 92.2% precision and 79.1% pairwise accuracy on the dataset.

cs.SE↗

Semantic-Driven AI Agent Communications: Challenges and Solutions

With the rapid growth of intelligent services, communication targets are shifting from humans to artificial intelligent (AI) agents, which require new paradigms to enable real-time perception, decision-making, and collaboration. Semantic communication, which conveys task-relevant meaning rather than raw data, offers a promising solution. However, its practical deployment remains constrained by dynamic environments and limited resources. To address these issues, this article proposes a semantic-driven AI agent communication framework and develops three enabling techniques. First, semantic adaptation transmission applies fine-tuning with real or generative samples to efficiently adapt models to varying environments. Second, semantic lightweight transmission incorporates pruning, quantization, and perception-aware sampling to reduce model complexity and alleviate computational burden on edge agents. Third, semantic self-evolution control employs distributed hierarchical decision-making to optimize multi-dimensional resources, enabling robust multi-agent collaboration in dynamic environments. Simulation results show that the proposed solutions achieve faster convergence and stronger robustness, while the proposed distributed hierarchical optimization method significantly outperforms conventional decision-making schemes, highlighting its potential for AI agent communication networks.

cs.AI↗

A Survey on Artificial Noise for Physical Layer Security: Opportunities, Technologies, Guidelines, Advances, and Trends

Due to the broadcast nature of wireless communications, physical-layer security has attracted increasing concerns from both academia and industry. Artificial noise (AN), as one of the promising physical-layer security techniques, is capable of utilizing the spatial degree-of-freedom of channels to effectively enhance the security of wireless communications. In contrast to other physicallayer security techniques, the key distinguishing feature of AN is to generate specific interfering signals according to channel characteristics, increasing the secrecy capacity by reducing the wiretap channel capacity without affecting the legitimate channel capacity. Hence, this paper provides the latest survey of AN, including its evolution, modeling, backgrounds, applications, and future trends. Initially, we introduce the development, fundamentals, and backgrounds of AN. Subsequently, we highlight a comprehensive survey of the current state of research on various AN-empowered scenarios and AN-combined technologies. Finally, we discuss some technical challenges to tackle for AN-aided wireless security in the future.

cs.CR↗

Uplink RSMA for Pinching-Antenna Systems

One of the key goals of next-generation wireless networks is to adapt to changing conditions and meet the growing demand for reliable, high-capacity communications from emerging applications. Overcoming the limitations of conventional technologies, such as fixed antenna positions, is essential to achieving this objective because it mitigates the impact of path loss on the received signal and creates strong line-of-sight links, enhancing system performance. With this in mind, the newly proposed pinching antenna systems (PASs) are a promising solution for indoor applications because they can activate antennas across a waveguide deployed in a room, thus reducing the distance between the transmitter and receiver. In this paper, we investigate a two-user, two-pinching-antenna uplink PAS, in which the transmitters use rate splitting to create a more resilient framework than non-orthogonal multiple access (NOMA). For this network, we derive novel closed-form expressions for the outage probability. Numerical results validate these expressions, proving that the proposed rate-splitting multiple access (RSMA) scheme outperforms NOMA PAS.

eess.SP↗

Beamforming Design for Pinching Antenna Systems with Multiple Receive Antennas

Next-generation networks require intelligent and robust channel conditions to support ultra-high data rates, seamless connectivity, and large-scale device deployments in dynamic environments. While flexible antenna technologies such as fluid and movable antennas offer some degree of adaptability, their limited reconfiguration range and structural rigidity reduce their effectiveness in restoring line-of-sight (LoS) links. As a complementary solution, pinching antenna systems (PASs) enable fine-grained, hardware-free control of radiation locations along a waveguide, offering enhanced flexibility in challenging propagation environments, especially under non-LoS (NLoS) conditions. This paper introduces a general and novel modeling framework for downlink PASs targeting users equipped with multiple receive antennas, addressing a practical yet underexplored scenario in the existing literature. Specifically, we first derive an analytical relationship between the received signal-to-noise ratio and the pinching antenna (PA) positions, and based on this, we propose a two-layer placement strategy. First, we optimize the central radiation point using large-scale channel characteristics, and then we use a heuristic compressed placement algorithm to approximate phase alignment across multiple receive antennas and select a spatially compact set of active elements. Simulation results demonstrate notable performance gains over conventional single-antenna schemes, particularly in short-range scenarios with dense PAs and widely spaced user antennas.

eess.SP↗

Max-Min Beamforming for Large-Scale Cell-Free Massive MIMO: A Randomized ADMM Algorithm

We consider the problem of max-min beamforming (MMB) for cell-free massive multi-input multi-output (MIMO) systems, where the objective is to maximize the minimum achievable rate among all users. Existing MMB methods are mainly based on deterministic optimization methods, which are computationally inefficient when the problem size grows large. To address this issue, we, in this paper, propose a randomized alternating direction method of multiplier (ADMM) algorithm for large-scale MMB problems. We first propose a novel formulation that transforms the highly challenging feasibility-checking problem into a linearly constrained optimization problem. An efficient randomized ADMM is then developed for solving the linearly constrained problem. Unlike standard ADMM, randomized ADMM only needs to solve a small number of subproblems at each iteration to ensure convergence, thus achieving a substantial complexity reduction. Our theoretical analysis reveals that the proposed algorithm exhibits an O(1/\bar{t}) convergence rate (\bar{t} represents the number of iterations), which is on the same order as its deterministic counterpart. Numerical results show that the proposed algorithm offers a significant complexity advantage over existing methods in solving the MMB problem.

eess.SP↗

Pinching-Antenna-Assisted Index Modulation: Channel Modeling, Transceiver Design, and Performance Analysis

In this paper, a novel pinching-antenna assisted index modulation (PA-IM) scheme is proposed for improving the spectral efficiency without increasing the hardware complexity, where the information bits are conveyed not only by the conventional M-ary quadrature amplitude modulation (QAM) symbols but also by the indices of pinching antenna (PA) position patterns. To realize the full potential of this scheme, this paper focuses on the comprehensive transceiver design, addressing key challenges in signal detection at the receiver and performance optimization at thetransmitter. First, a comprehensive channel model is formulated for this architecture, which sophisticatedly integrates the deterministic in-waveguide propagation effects with the stochastic nature of wireless channels, including both largescale path loss and small-scale fading. Next, to overcome the prohibitive complexity of optimal maximum likelihood (ML) detection, a low-complexity box-optimized sphere decoding (BOSD) algorithm is designed, which adaptively prunes the search space whilst preserving optimal ML performance. Furthermore, an analytical upper bound on the bit error rate (BER) is derived and validated by the simulations. Moreover, a new transmit precoding method is designed using manifold optimization, which minimizes the BER by jointly optimizing the complex-valued precoding coefficients across the waveguides for the sake of maximizing the minimum Euclidean distance of all received signal points. Finally, the simulation results demonstrate that the proposed PA-IM scheme attains a significant performance gain over its conventional counterparts and that the overall BER of the pinching-antenna system is substantially improved by the proposed precoding design.

eess.SP↗

Fluid Aerial Networks: UAV Rotation for Inter-Cell Interference Mitigation

With the rapid development of aerial infrastructure, unmanned aerial vehicles (UAVs) that function as aerial base stations (ABSs) extend terrestrial network services into the sky, enabling on-demand connectivity and enhancing emergency communication capabilities in cellular networks by leveraging the flexibility and mobility of UAVs. In such a UAV-assisted network, this paper investigates position-based beamforming between ABSs and ground users (GUs). To mitigate inter-cell interference, we propose a novel fluid aerial network that leverages ABS rotation to increase multi-cell capacity and overall network efficiency. Specifically, considering the line-of-sight channel model, the spatial beamforming weights are determined by the orientation angles of the GUs. In this direction, we examine the beamforming gain of a two-dimensional multiple-input multiple-output (MIMO) array at various ground positions, revealing that ABS rotation significantly affects multi-user channel correlation and inter-cell interference. Based on these findings, we propose an alternative low-complexity algorithm to design the optimal rotation angle for ABSs, aiming to reduce inter-cell interference and thus maximize the sum rate of multi-cell systems. In simulations, exhaustive search serves as a benchmark to validate the optimization performance of the proposed sequential ABS rotation scheme. Moreover, simulation results demonstrate that, in interference-limited regions, the proposed ABS rotation paradigm can significantly reduce inter-cell interference in terrestrial networks and improve the multi-cell sum rate by approximately 10\% compared to fixed-direction ABSs without rotation.

cs.NI↗

Vision-Aided ISAC in Low-Altitude Economy Networks via De-Diffused Visual Priors

Emerging low-altitude economy networks (LAENets) require agile and privacy-preserving resource control under dynamic agent mobility and limited infrastructure support. To meet these challenges, we propose a vision-aided integrated sensing and communication (ISAC) framework for UAV-assisted access systems, where onboard masked De-Diffusion models extract compact semantic tokens, including agent type, activity class, and heading orientation, while explicitly suppressing sensitive visual content. These tokens are fused with mmWave radar measurements to construct a semantic risk heatmap reflecting motion density, occlusion, and scene complexity, which guides access technology selection and resource scheduling. We formulate a multi-objective optimization problem to jointly maximize weighted energy and perception efficiency via radio access technology (RAT) assignment, power control, and beamforming, subject to agent-specific QoS constraints. To solve this, we develop De-Diffusion-driven vision-aided risk-aware resource optimization algorithm DeDiff-VARARO, a novel two-stage cross-modal control algorithm: the first stage reconstructs visual scenes from tokens via De-Diffusion model for semantic parsing, while the second stage employs a deep deterministic policy gradient (DDPG)-based policy to adapt RAT selection, power control, and beam assignment based on fused radar-visual states. Simulation results show that DeDiff-VARARO consistently outperforms baselines in reward convergence, link robustness, and semantic fidelity, achieving within $4\%$ of the performance of a raw-image upper bound while preserving user privacy and scalability in dense environments.

eess.SY↗

Cognitive-Radio Functionality: A Novel Configuration for STAR-RIS assisted RSMA Networks

Cognitive radio rate-splitting multiple access (CR-RSMA) has emerged as a promising multiple access framework that can efficiently manage interference and adapt dynamically to heterogeneous quality-of-service (QoS) requirements. To effectively support such demanding access schemes, programmable wireless environments have attracted considerable attention, especially through simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs), which can enable full-space control of signal propagation in asymmetric user deployments. In this paper, we propose the cognitive radio (CR) functionality for STAR-RIS-assisted CR-RSMA systems, leveraging the unique capability of the STAR-RIS to combine element and power splitting for adaptive control of transmission and reflection in CR scenarios. Specifically, the proposed CR functionality partitions the STAR-RIS into two regions independently controlling the transmission and reflection of signals, simultaneously ensuring the required QoS for the primary user and enhancing the performance of the secondary user. To accurately characterize the system performance, we derive analytical expressions for the ergodic rate of the secondary user and the outage rate of the primary user under Nakagami-m fading. Finally, simulation results show that the proposed approach effectively manages interference, guarantees the QoS of the primary user, and significantly improves the throughput of the secondary user, highlighting STAR-RIS as an efficient solution for CR-RSMA-based services.

cs.ET↗

Autonomous Circular Drift Control for 4WD-4WS Vehicles Without Precomputed Drifting Equilibrium

Under extreme conditions, autonomous drifting enables vehicles to follow predefined paths at large slip angles, significantly enhancing the control system's capability to handle hazardous scenarios. Four-wheel-drive and four-wheel-steering (4WD-4WS) vehicles, which have been extensively studied, offer superior path-following precision and enhanced maneuverability under challenging driving conditions. In this paper, a hierarchical drifting controller is proposed for 4WD-4WS vehicles to track both path and velocity without relying on precomputed drifting equilibrium. The controller is structured into two layers: a trajectory tracking layer and an actuator regulation layer. The first layer generates the desired tire forces in the vehicle body frame, while the second layer converts these desired tire forces into steering angle commands and torque commands for the front and rear motors. The effectiveness and robustness of the proposed controller are validated through simulation.

eess.SY↗