ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2604.04757v1· 20 results

cs.CRRecentApr 9, 2026

Anamorphic Encryption with CCA Security: A Standard Model Construction

Shujun Wang, Jianting Ning, Qinyi Li, Leo Yu Zhang

The paper proposes a generic, standard model construction for Anamorphic Key Encapsulation Mechanisms (AKEM) that achieves strong IND-CCA security, addressing a major gap in covert communication crypt…

View →
cs.AIcs.CRRecentApr 9, 2026

ACF: A Collaborative Framework for Agent Covert Communication under Cognitive Asymmetry

Wansheng Wu, Kaibo Huang, Yukun Wei, Zhongliang Yang +1 more

The paper introduces the Asymmetric Collaborative Framework (ACF), a novel method that enables robust covert communication between autonomous agents despite inherent cognitive asymmetry caused by dyna…

View →
cs.CRRecentApr 13, 2026

Can we Watermark Low-Entropy LLM Outputs?

Noam Mazor, Andrew Morgan, Rafael Pass

This paper develops provably undetectable and robust watermarking schemes for LLM outputs even when the per-token entropy is only constant, removing previous dependencies on high entropy rates or larg…

View →
cs.CRcs.AIcs.CLRecentApr 7, 2026

Say Something Else: Rethinking Contextual Privacy as Information Sufficiency

Yunze Xiao, Wenkai Li, Xiaoyuan Wu, Ningshan Ma +2 more

The paper proposes Information Sufficiency (IS) as a comprehensive framework for privacy-preserving LLM communication, demonstrating that free-text pseudonymization outperforms existing suppression an…

View →
cs.CRRecentMay 19, 2026

High-Rate Public-Key Pseudorandom Codes for Edit Errors

Shengtang Huang, Xin Li, Songtao Mao, Zhaienhe Zhou

The paper constructs high-rate public-key pseudorandom codes (PRCs) robust against edit errors, providing the first such binary constructions under assumptions that yield Hamming-robust PRCs.

View →
cs.CRcs.AIRecentApr 16, 2026

CAMP: Cumulative Agentic Masking and Pruning for Privacy Protection in Multi-Turn LLM Conversations

Aman Panjwani

The paper proposes CAMP, a cross-turn privacy framework that mitigates Cumulative PII Exposure (CPE) in multi-turn LLM conversations by tracking and masking accumulated personal data across the entire…

View →
cs.CRcs.AIRecentMar 22, 2026

Is Monitoring Enough? Strategic Agent Selection For Stealthy Attack in Multi-Agent Discussions

Qiuchi Xiang, Haoxuan Qu, Hossein Rahmani, Jun Liu

The paper develops a novel attack method for multi-agent discussions under continuous monitoring, demonstrating that monitoring alone is insufficient to secure these systems.

View →
eess.SPcs.CRcs.GTRecentApr 13, 2026

Structural Limits of Soft Fusion in Multi-Warden Covert Communication

Abbas Arghavani, Subhrakanti Dey, Anders Ahlen

The paper demonstrates that soft fusion in multi-warden covert communication has structural limits, showing that the Fusion Center gains no significant detection advantage from randomizing the number…

View →
cs.CRcs.AIcs.DCRecentJun 2, 2026

Notarized Agents: Receiver-Attested Confidential Receipts for AI Agent Actions

Juan Figuera

The paper proposes Sello, a novel protocol that allows an owner to reconstruct a tamper-evident and verifiable record of AI agent actions by having a trusted receiver sign and publish receipts of the…

View →
cs.CRcs.AIcs.HCRecentMay 18, 2026

An Empirical Study of Privacy Leakage Chains via Prompt Injection in Black-Box Chatbot Environments

Hongjang Yang, Hyunsik Na, Daeseon Choi

This paper demonstrates a novel, multi-stage privacy-leakage attack chain against black-box chatbot agents by combining indirect prompt injection with web-tool invocation, showing that such attacks ar…

View →
cs.CRcs.AIRecentMay 6, 2026

On the (In-)Security of the Shuffling Defense in the Transformer Secure Inference

Zhengyi Li, Yakai Wang, Kang Yang, Yu Yu +5 more

This paper demonstrates a novel attack against the shuffling defense used in secure Transformer inference, showing that randomly permuted activations can still be exploited to recover model weights.

View →
cs.CRRecentMay 25, 2026

AgentSecBench: Measuring Prompt Injection, Privacy Leakage, and Tool-Use Integrity in LLM Agents

Faruk Alpay, Taylan Alpay

The paper introduces AgentSecBench, a security evaluation framework that measures prompt injection, privacy leakage, and tool-use integrity in LLM agents by defining formal security games and testing…

View →
cs.CRcs.LGcs.MARecentMay 1, 2026

When Embedding-Based Defenses Fail: Rethinking Safety in LLM-Based Multi-Agent Systems

Lingxi Zhang, Guangtao Zheng, Hanjie Chen

This paper analyzes the failure of current embedding-based defenses in multi-agent LLM systems and proposes using token-level confidence scores (logits) for improved robustness.

View →
cs.CRRecentJun 1, 2026

I-(OT)^2: A Client-optimal Oblivious Transfer Protocol for IoT Devices

Elia Onofri, Andrea Ciccotelli, Roberto Di Pietro

The paper introduces $I$-$(OT)^2$, a novel base 1-out-of-2 Oblivious Transfer (OT) protocol designed to minimize computation and interaction for resource-constrained IoT devices.

View →
cs.CRcs.ITcs.LGRecentApr 8, 2026

Evaluating PQC KEMs, Combiners, and Cascade Encryption via Adaptive IND-CPA Testing Using Deep Learning

Simon Calderon, Niklas Johansson, Onur Günlü

The paper proposes using deep learning to empirically test the indistinguishability of various post-quantum and hybrid cryptographic schemes, finding that no tested combination showed a significant ad…

View →
cs.CRRecentApr 23, 2026

Provably Secure Steganography Based on List Decoding

Kaiyi Pang, Minhao Bai

The paper proposes a provably secure steganography scheme based on list decoding that significantly increases embedding capacity for Large Language Models (LLMs) compared to existing methods.

View →
cs.CLcs.CRRecentApr 9, 2026

Efficient Provably Secure Linguistic Steganography via Range Coding

Ruiyi Yan, Yugo Murawaki

The paper proposes an efficient and provably secure linguistic steganography method using range coding that achieves high embedding capacity and speed, outperforming existing methods.

View →
cs.LGcs.AIcs.CRRecentMay 7, 2026

PACZero: PAC-Private Fine-Tuning of Language Models via Sign Quantization

Murat Bilgehan Ertan, Xiaochen Zhu, Phuong Ha Nguyen, Marten van Dijk +1 more

The paper introduces PACZero, a novel PAC-private fine-tuning mechanism that achieves usable utility for large language models while providing strong resistance against membership-inference attacks.

View →
cs.CRRecentMar 24, 2026

Observable Channels, Not Just Storage: Evaluating Privacy Leakage in LLM Agent Pipelines

Tao Huang, Chen Hou, Guosen Wu, Jiayang Meng

The paper introduces CIPL, a unified channel-oriented framework, demonstrating that privacy leakage in LLM agents is governed by observable data channels and pipeline interactions, rather than being l…

View →
cs.CRcs.AIRecentMay 29, 2026

PrivacyPeek: Auditing What LLM-Based Agents Acquire, Not Just What They Say

Mingxuan Zhang, Jiahui Han, Dadi Guo, Songze Li +4 more

The paper introduces PrivacyPeek, a new benchmark that audits the acquisition stage of LLM-based agents to demonstrate that unnecessary acquisition of sensitive data is a widespread and critical priva…

View →