SearcharxivSearch

arXiv subjects

Mingjin Li

Publications and source records attributed to Mingjin Li.

6 recordsLinked to original sources

CoTDeceptor:Adversarial Code Obfuscation Against CoT-Enhanced LLM Code Agents

LLM-based code agents(e.g., ChatGPT Codex) are increasingly deployed as detector for code review and security auditing tasks. Although CoT-enhanced LLM vulnerability detectors are believed to provide improved robustness against obfuscated malicious code, we find that their reasoning chains and semantic abstraction processes exhibit exploitable systematic weaknesses.This allows attackers to covertly embed malicious logic, bypass code review, and propagate backdoored components throughout real-world software supply chains.To investigate this issue, we present CoTDeceptor, the first adversarial code obfuscation framework targeting CoT-enhanced LLM detectors. CoTDeceptor autonomously constructs evolving, hard-to-reverse multi-stage obfuscation strategy chains that effectively disrupt CoT-driven detection logic.We obtained malicious code provided by security enterprise, experimental results demonstrate that CoTDeceptor achieves stable and transferable evasion performance against state-of-the-art LLMs and vulnerability detection agents. CoTDeceptor bypasses 14 out of 15 vulnerability categories, compared to only 2 bypassed by prior methods. Our findings highlight potential risks in real-world software supply chains and underscore the need for more robust and interpretable LLM-powered security analysis systems.

cs.CR

A note for Carleson measure on bounded $\mathbb{C}$-convex domains

Let \(0<q<p<\infty\), \(\Omega\) be a bounded \(\bbC\)-convex domains in \(\bbC^n\). We establish several equivalent characterizations for the boundedness of Carleson embedding \(J_\mu:A_\alpha^p\hookrightarrow L^q(\mu)\) on \(\Omega\) with sharp \(\cB\) condition. Furthermore, we prove that the boundedness of \(J_\mu\) is equivalent to its compactness.

math.CV

MADS: Multi-Agent Dialogue Simulation for Diverse Persuasion Data Generation

We propose MADS (Multi-Agent Dialogue Simulation), a scalable framework for generating persuasive multi-turn dialogues via agent self-play. MADS employs three coordinated agents: User Agents designed to simulate diverse persona-driven behaviors by leveraging personality signifiers such as Zodiac Signs and MBTI types, a Dialog Agent executing task-oriented persuasion strategies and an Optimization Agent evaluating and refining dialogue outcomes. We further validate its effectiveness through users' Chain-of-Attitude (CoA) modeling and dedicated LLMs' persuasion assessment. This approach enables low-cost generation of training data without human annotation, addressing key industry challenges such as lack of user data, cold-start evaluation difficulties, and prompt inefficiency. Applied to a real-world marketing scenario, MADS significantly improved the persuasion capacity of small LLMs, increasing the organic traffic conversion rate by 22.4% (from 1.83% to 2.24%) , demonstrating clear business value.

cs.CL

Summing Carleson measure on radial weighted Begman spaces

For $\mu$ is a positive Borel measure on $\mathbb{D}$, The $r$ summing Carleson embdedding $J_\mu: A_w^p\to L^q(\mu)$ are characterized in this paper, some conditions which ensure that the Carleson embedding for $J_\mu: A_w^p\to L^q(\mu)$ is $r$ summing are obtained for all $0<p,q<\infty.$

math.CV

Fractional order derivative characterizations of Besov-Morrey type spaces with applications

On the one hand, the fractional order derivative characterization of the Besov-Morrey type space $B_{p}^{K}(s)$ is established by $K$-Carleson measures, and it was also shown that $f \in B_{p}^{K}(s_1) \Leftrightarrow f^{\left(\frac{s_2 - s_1}{p}\right)} \in B_{p}^{K}(s_2)$, which extended the results of Sun et al. on the fractional derivative of Morrey type space. On the other hand, some sufficient conditions for the growth of solutions to linear complex differential equations have been obtained by using $n$th derivative criterion.

math.CV