Security & Cryptography · Computer Science & AI
Cryptography & Security
The newest papers in Cryptography & Security that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
1,372 papers, from 4 September 2026 to 5 November 2026: 1,372 arXiv preprints.
Get the few papers worth your time in Cryptography & Security every morning.
Follow Cryptography & Security and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 43
Hiding in Plain Sight: Decoupling Pretext from Actuation for Skill Poisoning in LLM Agents
LLM agents increasingly rely on reusable Skills for complex, multi-step tasks, creating a critical supply-chain attack surface where poisoned Skill content steers agent decision loops under benign…ActionGuard: Tool Call Authorization under Poisoned Skills
LLM-based agents extend their capabilities through third-party skills that provide task-specific instructions, scripts, and tool-use procedures.On quantum interactive proofs with a laconic prover
Interactive proof systems with a laconic prover, studied by Goldreich, Vadhan, and Wigderson (CC, 2002), capture problems verifiable with logarithmic prover communication in the classical setting.Learning Normal Diffusion Dynamics for Backdoor Defense in Text-to-Image Models
Backdoor attacks pose a serious threat to the secure deployment of text-to-image (T2I) diffusion models.Speculative Safety Honeypot: Toward Proactive Defense Against Multi-turn Agent Attacks
As Large Language Model (LLM) agents are increasingly deployed in complex environments, multi-turn interaction attacks have become a significant security challenge.Cybersecurity in Edge Computing: A Trust-Aware Federated Hybrid Intrusion Detection Framework
Edge computing has emerged as a critical computing paradigm in modern distributed systems by migrating data processing closer to end users and Internet of Things (IoT) devices.Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering
We construct efficient information-theoretic non-malleable codes for classical messages that are secure against two noncommunicating local quantum tampering operations with arbitrary pre-shared…Pretext: Defeating Malicious Skill Detection Frameworks for AI Agents
Skills extend an agent's capabilities by injecting instructions and information into the context, and are widely used by agents such as OpenClaw and Claude Code.Aletheia: Permission-Minimality Testing for Coding-Agent Rules
Repository instruction files guide coding agents, but also expose them to prompt injection.Security Properties of Neural Networks as Decision Problems
Certifying a deployed neural network raises decision problems that the verification literature has not classified: whether the model carries a backdoor planted in its training data, whether a fault…Natural Barriers to Quantum Extraction: On the Post-Quantum (In)security of (O)EKE and Masny-Rindal OT
Encrypted key exchange (EKE), introduced by Bellovin and Merritt (IEEE S\&P 1992), and Masny-Rindal OT, introduced by Masny and Rindal (ACM CCS 2019), are highly-efficient methods for compiling…PassGPT+: Leveraging Linguistic Priors for Password Modeling
Passwords remain the dominant online authentication mechanism, and understanding how humans choose them is essential for defensive strength estimation and attack simulation alike.CodeMimicry: Exploiting Safety Generalization Lag in Large Language Models via Structured Code Completion
Large language models have achieved remarkable capabilities across diverse domains, yet their safety alignment remains vulnerable to jailbreak attacks.Verifiable quantum advantage based on polynomials with planted structures
A central question in the theory of quantum advantage is whether there are quantum advantage protocols with similar resource requirements as random circuit sampling that are also verifiable just…A Fourier-Label Information-Loss Barrier for Dihedral Coset Algorithms
We establish a no-go theorem for a broad class of quantum algorithms for the dihedral coset problem (DCP).Query-Limited RAM Programs and their Applications
Quantum one-time programs (Broadbent, Gutoski and Stebila, CRYPTO 2013) or OTPs for short, enable a functionality to be encoded into a quantum token that can be evaluated on a single chosen input…Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation
We construct protocols for classically verifiable quantum advantage and classical verification of $\mathsf{BQP}$ computations using \emph{quantum indistinguishability obfuscation} (qiO).Need for Coherent Access in Constructing Quantum Cryptography
We construct quantum oracles relative to which quantum-secure one-way functions (OWFs) exist but pseudorandom states (PRSs) with superlogarithmic output length do not.Exponential quantum speedup for $\mathbb{F}_3^n$-Subset-Sum? Or, rigorous classical algorithms for Binary-Error LWE
We study vector subset sum over $\mathbb{F}_3^n$: given $m$ random vectors from $\mathbb{F}_3^n$, find a nonempty subset that sums to zero; the smaller $m$, the more difficult it is to find such a…On The Simplest Quantum-Secure Block Cipher
Pseudorandom permutations are ubiquitous in theoretical and applied cryptography.