Impact of 5G SA Logical Vulnerabilities on UAV Communications: Threat Models and Testbed Evaluation

This paper evaluates the impact of logical vulnerabilities in 5G Standalone networks on UAV communications by utilizing a Kubernetes-based testbed to demonstrate how attacks from malicious UEs, compromised gNodeBs, or the 5G core can disrupt operations, thereby highlighting the critical need for user plane isolation and protocol integrity.

Wagner Comin Sonaglio, Ágney Lopes Roth Ferraz, Lourenço Alves Pereira Júnior2026-03-06🔒 cs.CR

When Denoising Becomes Unsigning: Theoretical and Empirical Analysis of Watermark Fragility Under Diffusion-Based Image Editing

This paper demonstrates that diffusion-based image editing inherently compromises robust invisible watermarks by treating embedded payloads as noise to be removed during the denoising process, leading to a theoretical and empirical analysis of this fragility and proposing guidelines for future watermarking designs.

Fai Gu, Qiyu Tang, Te Wen, Emily Davis, Finn Carter2026-03-06🔒 cs.CR

Efficient Privacy-Preserving Sparse Matrix-Vector Multiplication Using Homomorphic Encryption

This paper introduces the first efficient framework for privacy-preserving sparse matrix-vector multiplication using homomorphic encryption, featuring a novel Compressed Sparse Sorted Column (CSSC) format that significantly reduces computational and storage overhead while enabling secure applications in fields like federated learning and scientific computing.

Yang Gao, Gang Quan, Wujie Wen, Scott Piersall, Qian Lou, Liqiang Wang2026-03-06🔒 cs.CR

AgentSCOPE: Evaluating Contextual Privacy Across Agentic Workflows

This paper introduces AgentSCOPE, a benchmark and Privacy Flow Graph framework that reveals how agentic systems frequently violate contextual privacy at intermediate pipeline stages—particularly during tool responses—demonstrating that current output-focused evaluations significantly underestimate the true privacy risks of multi-step AI workflows.

Ivoline C. Ngong, Keerthiram Murugesan, Swanand Kadhe, Justin D. Weisz, Amit Dhurandhar, Karthikeyan Natesan Ramamurthy2026-03-06🔒 cs.CR

EVMbench: Evaluating AI Agents on Smart Contract Security

The paper introduces EVMbench, a benchmarking framework that evaluates the capabilities of frontier AI agents in detecting, patching, and exploiting smart contract vulnerabilities within a realistic local Ethereum environment, revealing their ability to successfully execute end-to-end attacks against live blockchain instances.

Justin Wang, Andreas Bigger, Xiaohai Xu, Justin W. Lin, Andy Applebaum, Tejal Patwardhan, Alpin Yukseloglu, Olivia Watkins2026-03-06🔒 cs.CR

A Practical Post-Quantum Distributed Ledger Protocol for Financial Institutions

This paper proposes a practical, post-quantum, lattice-based distributed ledger protocol tailored for financial institutions that ensures transaction confidentiality and auditability through novel zero-knowledge proofs, a new commitment equating method, and an efficient compact range-proof for single or multi-asset transactions.

Yeoh Wei Zhu, Naresh Goud Boddu, Yao Ma, Shaltiel Eloul, Giulio Golinelli, Yash Satsangi, Rob Otter, Kaushik Chakraborty2026-03-06🔒 cs.CR

Cyber Threat Intelligence for Artificial Intelligence Systems

This paper investigates the evolution of cyber threat intelligence to address AI-specific security threats by analyzing current gaps, proposing a structured knowledge base with concrete indicators of compromise across the AI supply chain, and outlining techniques for measuring artifact similarity to support a practical, AI-tailored defense framework.

Natalia Krawczyk, Mateusz Szczepkowski, Adrian Brodzik, Krzysztof Bocianiak2026-03-06🔒 cs.CR

Robust Single-message Shuffle Differential Privacy Protocol for Accurate Distribution Estimation

This paper proposes a novel single-message adaptive shuffler-based piecewise (ASP) protocol for robust distribution estimation under pure shuffle differential privacy, which outperforms existing baselines by simultaneously achieving superior utility, minimal message complexity, and enhanced resilience against data poisoning attacks through an optimized randomizer and an Expectation Maximization with Adaptive Smoothing (EMAS) recovery algorithm.

Xiaoguang Li, Hanyi Wang, Yaowei Huang, Jungang Yang, Qingqing Ye, Haonan Yan, Ke Pan, Zhe Sun, Hui Li2026-03-06🔒 cs.CR

Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity

This paper presents a sample-optimal, locally differentially private algorithm for hypothesis selection that achieves the information-theoretic lower bound of Θ(k/(α2min{ε2,1}))\Theta(k/(\alpha^2 \min\{\varepsilon^2, 1\})) using only O(loglogk)O(\log \log k) rounds of interaction, thereby demonstrating the provable power of interactivity to overcome the Ω(klogk)\Omega(k \log k) sample complexity barrier inherent in non-interactive approaches.

Alireza F. Pour, Hassan Ashtiani, Shahab Asoodeh2026-03-05🤖 cs.LG