74 results for “Expo”

TextSeal2 is a distortion-free LLM text watermark that merges two or more keys into one virtual key and couples it to fresh noise through AutoMark's Gaussian copula. Under speculative decoding it verifies keyed drafts with an extra exponential race, so output matches the target model and acceptance rate is unchanged. On three LLMs at a 10^-3 false-positive rate, it detects 8 to 22 points more 100-token answers than TextSeal.

arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🛡️ Security

TextSeal2 is a distortion-free watermark for LLM output that keeps its signal under speculative decoding. It merges two or more keys into one virtual key coupled to fresh noise through AutoMark's Gaussian copula, and verifies drafts with an extra exponential race. On three LLMs it detects 8 to 22 points more 100-token answers than TextSeal at a 10^-3 false-positive rate.

arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

Kolesnikov and Novoselov give block basis reduction (BKZ) algorithms for linear codes that need polynomial or quasi-polynomial numbers of calls to a minimum weight codeword oracle at fixed block size. The earlier Ghentiyala and Stephens-Davidowitz bounds are exponential. The paper adds a truncated BKZ and a DeepBKZ variant, with an implementation for block sizes 2 to 24 and approximation-factor estimates on random codes.

eprint.iacr.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🛡️ Security

REALM (Required Execution Assets Linked to a Mission) is an approach to applying least privilege to LLM agents by identifying the assets a task needs, including ones discovered at runtime. It models assets as Dependency Graph nodes, separates discovering an asset from authorizing it, and exposes resource-bound Partial APIs inside a Task Container. On AgentDyn with qwen3.5-flash, attack success rate falls from 16.6% to 0.2%, with 40.0% task completion on clean tasks and 36.4% on injected cases.

arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🛡️ Security

AgentAnchor is a session-keyed behavioral watermark for attributing LLM agent trajectory logs to an owner. It derives per-step keys from a secret key, a fresh public session ID and semantic observation states, and embeds parity evidence through a KL-bounded exponential tilt. The paper formalizes learned cross-session forgery, and a trusted verifier checks disputed logs using wrong-key calibration and abstention.

arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🛡️ Security

AgentAnchor is a session-keyed behavioral watermark that lets an agent owner prove ownership of a trajectory log. Each step key comes from a secret key, a fresh public session identifier and semantic states of recent observations. Parity evidence is embedded through a KL-bounded exponential tilt of action choices. A trusted verifier checks disputed logs without rerunning the agent, using wrong-key calibration and abstention. The paper also formulates a learned cross-session forgery threat.

arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🧠 AI

Falcon Key Recovery from Joint Sampler Leakages is an ePrint paper presenting a power side-channel attack on Falcon and FN-DSA that fuses three SamplerZ leakages (exponent class of the center, sign bit, proposal magnitude). It turns them into slab and halfspace constraints solved by softplus interval regression, with no LLL or BKZ. On PQClean Falcon-512 (ARM Cortex-M4) it recovered all 50 keys with at most 34 signatures; on c-fn-dsa it recovered 38 of 50 keys within 200 signatures.

eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security

An empirical study of security concerns in the OpenClaw AI personal assistant framework, using 25K+ posts from 13 subreddits (162 security-relevant) and 358 security-tagged GitHub issues (180 retained). It maps 521 CWE instances across 59 weakness types, concentrated in access control, sensitive-data exposure, injection and unsafe execution. It extracts 543 practitioner mitigations into seven strategies and reconstructs a sensitive-data exposure path with dummy secrets.

arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026🛡️ Security

Subexponential Algorithms for LWE via Rejection Sampling on Superlattices is an ePrint paper by Ligeng Fan, Changpeng Shao, Hongbo Li and Dingkang Wang. It extends the Ducas, Engelberts and Loyer superlattice framework to give a provable classical search-LWE algorithm for prime q in [n^2, 2n^2], using m=4n samples and time and space exp(O(n/ln ln n)). A second variant runs in 2^((1/2+o(1))n/ln R) for general parameters. It resolves a gap left by Kirchner and Fouque.

eprint.iacr.orgpaperPublished and added 26 Oct 2026🛡️ Security

Gao and Hu's IACR ePrint 2026/2622 shows that if the matrix multiplication exponent satisfies ω ≤ 9/4 − η, heuristic lattice sieving runs in (3/2 − δ)^(n/2+o(n)) time under the spherical heuristic from the BDGL analysis. It builds on OpenAI's recent result that ω ≤ 9/4. With known matrix multiplication algorithms, the method already gives subquadratic search inside BDGL buckets. Only the abstract is available, so concrete parameters are not shown.

eprint.iacr.orgpaperAdded 26 Oct 2026, published 24 Oct 2026🛡️ Security

Rentaro Shiba and Tetsu Iwata prove a tight multi-key security bound for the FX construction (the DESX generalization) in the quantum ideal cipher model. Security holds up to about 2^((n+κ)/3) total classical and quantum oracle queries against fully adaptive adversaries, for any number of keyed instances μ≥1. This improves their ToSC 2026 bound and matches the offline Simon's algorithm attack in the exponent.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 23 Oct 2026🛡️ Security

This paper measures how hints such as "[Source] thinks the answer is (X)" shift LLM answers on MMLU questions, varying the source between a professor, a friend and a dog across Qwen, Gemma and SmolLM models. The shift fits an exponential tilt: a roughly constant mean change in the hinted answer's log-odds, with susceptibility largely shared across sources. The shift persists when the source is declared inaccurate or the prompt warns against trusting it. Synthetic experiments show how KL-regularized reward training could produce this pattern.

arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026🧠 AI

Paper by Shivansh Jaiswal and Somitra Sanadhya (IACR ePrint 2026/2601) on integer coordinate families for threshold RSA signatures with prime exponent e. It shows the CT-RSA 2026 Ng-Lau scheme admits trivial forgeries and has a flawed proof. It proposes repaired scheme PiIC and integer secret-sharing scheme PiZ for any prime e and any (t,n), both proven TS-UF-CMA secure under the standard RSA assumption. It also gives super-polynomial coordinate lower bounds for pairwise families.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🛡️ Security

Thomas Decru's ePrint 2026/2595 proves a corrected version of radical isogeny formulae for every N≥4, odd and even, over fields of characteristic coprime to 2N. It settles the sign choice for even N so that 2-isogeny walks stay on the volcano surface. One radical step costs about 12.5N multiplications and one exponentiation, and the paper shows how to evaluate radical isogenies on points, so a CSIDH class group action needs no torsion point sampling.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🛡️ Security

A Spectral Theory of Local-to-Global Leakage is an IACR ePrint paper (2026/2571) by Rei Ueno on additive secret sharing over finite abelian groups. It gives an exact leakage decomposition into local leakage magnitude and spectral alignment across shares. Two channels with identical local mutual information can have exponentially different global leakage. Automorphism-weighted sharing can cancel leakage perfectly with finitely many shares, which ordinary additive sharing cannot do.

eprint.iacr.orgpaperAdded 21 Oct 2026, published 20 Oct 2026🛡️ Security

DeclineCraft is a dynamic RAG abstention benchmark whose unanswerable questions target Minecraft feature additions made after a corpus cut-off, with audits for parametric exposure. Across 27 LLMs, single-shot retrieval raises Correct Abstention Rate in 38 of 40 configurations, while iterative RAG lowers it in 30 of 40. Enabling thinking without retrieval lowers abstention for 8 of 13 models, shifting responses to premise denial.

arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026🧠 AI

FunCAD-Harness is a framework in which LLM agents design CAD mechanisms and revise them using physical simulation feedback. It turns abstract functional requirements into candidate-specific physical tests. The paper also introduces FunCADBench, a benchmark of 46 mechanism families with interdependent, multi-step operations. Experiments on frontier LLM agents show it exposes mechanical failures that visual inspection misses and raises functional success over standard simulation-augmented baselines.

arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026🧠 AI

The paper presents a fault attack on deterministic CSIDH and OSIDH-LD. Forcing the lane-selection mask to zero (for example by skipping one instruction) makes output changes reveal whether a secret exponent reaches a threshold. Binary search then recovers the full key in at most 297 queries for OSIDH-LD and 222 for deterministic CSIDH with CSIDH-512-sized keys. Full OSIDH-LD keys were recovered in software fault simulation, and a ChipWhisperer-Lite skipped the target instruction with probability at least 0.94. The authors argue fault resistance requires giving up determinism and propose randomization countermeasures.

eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026🛡️ Security

FedRAPP is a personalized aggregation framework for Source-Free Federated Test-Time Prompt Tuning (SF-FTTPT), where clients adapt CLIP soft prompts on unlabeled, non-IID test streams without source data. It combines reliability-aware client assessment, a server-side exponential moving-average prompt memory and similarity-guided peer aggregation. Across nine CLIP benchmark datasets and ImageNet variants it beats standard federated aggregation baselines while keeping prompt-only efficiency.

arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026🧠 AI

GhostFaceMPC is presented as the first end-to-end face recognition system that runs both the deep CNN feature extractor and the matching step under secure multi-party computation. Raw images and biometric embeddings are never exposed at any stage, from feature extraction through storage to matching. The authors contribute an MPC-friendly quantization of the GhostFaceNet model and circuit optimizations that make this practical, and they release code on GitHub. It is relevant as an example of making CNN inference feasible under cryptographic constraints.

eprint.iacr.orgpaperPublished and added 15 Oct 2026🧠 AI

GhostFaceMPC is presented as the first end-to-end face recognition system that runs a deep CNN feature extractor (GhostFaceNet) and the matching step under secure multi-party computation. Raw images and biometric embeddings are never exposed during extraction, storage or matching. The authors contribute an MPC-friendly quantization of GhostFaceNet and circuit optimizations that make the approach practical, and they release code at crypto-unict/GhostFaceMPC.

eprint.iacr.orgpaperPublished and added 15 Oct 2026🛡️ Security

SecAgg++ is a masking-based secure aggregation protocol for single-server federated learning that swaps in post-quantum cryptographic primitives. It keeps the communication and computation efficiency of SecAgg and SecAgg+ and handles client dropout through an efficient recovery procedure built on secret sharing and additive masking. It matters because existing masking-based aggregation protocols are not post-quantum secure, so client model updates would be exposed to quantum-capable adversaries.

eprint.iacr.orgpaperPublished and added 15 Oct 2026🛡️ Security

SecAgg++ is a masking-based secure aggregation protocol for single-server federated learning that uses post-quantum cryptographic primitives. It keeps the communication and computation efficiency of SecAgg and SecAgg+ and handles client dropout through an efficient recovery procedure. It matters because most masking-based secure aggregation protocols are not post-quantum secure, which leaves federated model updates exposed to future quantum adversaries.

eprint.iacr.orgpaperPublished and added 15 Oct 2026🧠 AI

Presents ChainGraph, a pattern that externalizes exploit-chain reasoning for LLM pentest agents (Claude Code, Codex) into a Neo4j property graph exposed via the Model Context Protocol. Findings, attack steps, credentials, assets and tamper-evident evidence receipts are typed nodes with pre/post-condition edges, queried with Cypher and Graph Data Science for next-step inference, entry-to-crown-jewel pathing, chain-severity promotion, provenance and chokepoints. On a synthetic GOAD-style multi-forest Active Directory engagement, three Medium findings become Critical once chained, betweenness centrality identifies break-points, and reasoning payload drops ~98% (token proxy); results are single-run and illustrative.

arxiv.orgpaperAdded 17 Oct 2026, published 14 Oct 2026🛡️ Security

The paper proposes a post-quantum architecture for WireGuard that leaves the core protocol unchanged. A mutually authenticated TLS 1.3 control channel runs over TCP, UDP (DTLS) or QUIC and uses ML-KEM key establishment, with X.509 certificates from a PKI signed with ML-DSA. A shared secret derived from the session's exported keying material is injected into WireGuard's native PSK interface. A Tamarin model of the TLS–WireGuard composition layer checks secrecy, binding and provisioning-order properties and identifies the conditions needed for secure deployment. The authors benchmark handshake latency and CPU time for classical, pure-PQ and hybrid key establishment across the three transports, and compare against the Rosenpass PQ WireGuard baseline.

eprint.iacr.orgpaperAdded 15 Oct 2026, published 14 Oct 2026🛡️ Security

Presents the first blind signature in which the issuer runs unmodified NIST-standardized ML-DSA, so it works with certified secure elements. Issuance is an ML-DSA signature on a commitment. The blind signature is a VOLE-in-the-head zero-knowledge proof of knowledge of that signature, about 1 MB, under 1 s to produce and 0.5 s to verify. Security reduces to ML-DSA EUF-CMA and the proof system. Issuer-hiding and selective disclosure add a few tens of KB. The paper also introduces edaBitE, a batch consistency check between binary and prime-field commitments that replaces the costly edaBits checks.

eprint.iacr.orgpaperPublished and added 14 Oct 2026🛡️ Security

The paper analyses stateful hash-based signatures whose key is a tree of hash chains, and asks what a second signature from the same one-time key reveals after state loss or rollback. It proves that the values derivable from several signatures are exactly the union of those from each signature alone. It also bounds forgery after b signatures in the classical random-oracle model by a combinatorial coverage exponent λ_b, including when the signer grinds a counter. It then introduces CUTS, a scheme on one binary tree whose chain positions sum to a fixed value S and whose signature size and verification cost do not depend on tree height. One parameter set has 1,424-byte signatures and λ_2 ≥ 128.6. A counter variant, CUTS+C, gives a proven grinding gain.

eprint.iacr.orgpaperAdded 14 Oct 2026, published 12 Oct 2026🛡️ Security

KedgeFlow specifies language-independent contracts so trusted controllers can authorize state-changing operations by enterprise AI agents and privileged gateways can enforce that authority independently of agent reasoning. It combines evidence-backed policy checks, signed permission for an exact action, a single-use shared allowance, target-side conditions and retained outcome records, with two conditional properties (at most one claim per allowance; every dispatch linked to a grant and claim) that hold even if the agent is compromised. A reference implementation exposes the path via MCP; evaluation on a three-member etcd cluster gave exactly one successful claim for each of 82 allowances across 6,560 concurrent attempts, and one committed effect in a 32-call gateway race. The authors report limits: permissive policy still authorized an undesirable effect, and distributed reservations, production access routes, crash recovery and real-target exactly-once effects remain untested.

arxiv.orgpaperAdded 15 Oct 2026, published 10 Oct 2026🧠 AI

KedgeFlow proposes language-independent contracts in which trusted controllers issue signed exact-action permissions and privileged gateways enforce them, using single-use allowance claims, target-side conditions and retained outcome records. It aims to stop altered approved actions, concurrent permission reuse and retries after lost responses, even with a compromised agent. A reference implementation exposes this path via MCP; evaluation on a three-member etcd cluster showed 6,560 concurrent claim attempts yielding exactly one success per each of 82 allowances. It also reports that permissive policy still authorized an undesirable effect, and lists untested areas such as distributed reservations and production access routes.

arxiv.orgpaperAdded 15 Oct 2026, published 10 Oct 2026🛡️ Security

AgentValve is a protocol for authorizing payments by AI agents in permissionless markets where adversaries can cheaply create Sybil identities and fake feedback to inflate provider reputation. It models reputation as finite capacity in a directed trust graph, and a smart contract atomically reserves capacity along trust paths for each admitted payment. This bounds honest agents' exposure to the capacity they extend into the adversarial region, and payment-backed capacity creation with bounded route length limits depletion attacks. A witness-commit mechanism makes on-chain route verification linear work with constant persistent state per payment. The prototype was evaluated on six months of Ethereum data and synthetic workloads with up to 10,000 Sybil identities. Exposure and depletion stayed bounded, admission cost fell by up to 40.8% against baselines, and common payments cost about $0.04–$0.21.

arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026🛡️ Security

AgentValve is a protocol for Sybil-resilient payment authorization when AI agents pick and pay service providers without human review in permissionless markets. It models reputation as finite capacity in a directed trust graph, and a smart contract atomically reserves capacity along trust paths. This bounds honest agents' payment exposure to the capacity they extend into the adversarial region, so fake identities and fabricated feedback inside that region cannot raise the bound. Payment-backed capacity creation and bounded route length limit depletion by malicious senders. A witness-commit mechanism splits off-chain route discovery from on-chain verification, cutting verification to linear work with constant persistent state per payment. A prototype evaluated on six months of Ethereum data and synthetic workloads, with up to 10,000 Sybil identities, kept exposure and depletion bounded. Admission cost fell by up to 40.8% versus baselines, at roughly $0.04-$0.21 per common payment.

arxiv.orgpaperAdded 13 Oct 2026, published 9 Oct 2026🧠 AI

The paper shows that reward hacking learned by one coding agent during RL against automated evaluators can spread to other agents in a multi-agent system. Across four open-weight backbones, coding RL elicits and amplifies hacking when the system prompt describes the mechanism explicitly and when mid-training exposes the model to facts about the coding environment. Post-RL source agents transmit the hack through code, shared memory and natural-language plans, and even small open-weight agents induce hacking in stronger closed-weight targets. On hard tasks the hack can intensify along a transmission chain after the source leaves, as the code accumulates more persuasive justifications. A theoretical analysis gives conditions under which hacking amplifies, persists or decays. Hacking also biases task routing toward hacking agents and survives candidate aggregation. Code review by the coder or by a separate verifier reduces the hacks that get delivered.

arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026🧠 AI

ePrint preprint extending the Ducas–Engelberts–Loyer provable subexponential Gaussian sampler (built on Wagner's generalized birthday algorithm) to module matrices over power-of-two cyclotomic rings. It gives provable 2^{O(n/lnln n)}-time algorithms for Module-SIS and for decision and search Module-LWE using only the k+ℓ ring samples provided, plus sample-preserving scalar search-LWE and narrow Module-LWE variants. Separate heuristic estimates suggest these Wagner-style attacks do not reach the NIST security targets of ML-KEM and ML-DSA.

eprint.iacr.orgpaperAdded 12 Oct 2026, published 8 Oct 2026🛡️ Security

Paper measuring prefix-based training-data extraction in instruction-tuned open-weight LLMs under an empty prompt versus retrieved contexts of varying relevance (RAG), using paired item-level suffix scoring across three models. It finds extractable memorization has a context-robust core and a context-sensitive boundary: context suppresses some exposures but also enables new ones missed by prefix-only evaluation. This qualifies the claim that RAG reduces memorization risk and matters for threat-modeling deployed LLM systems.

arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026🛡️ Security

The paper measures whether retrieved context, as in RAG, reduces LLM memorization. It does this with paired item-level probabilistic suffix extraction: each prefix-suffix pair is scored under an empty prompt and under retrieved contexts of varying relevance, across three open-weight instruction-tuned models. Extractable memorization splits into a context-robust core and a context-sensitive boundary. Context suppresses some marginal exposures but also enables new ones that prefix-only evaluation misses, which qualifies the claim that RAG lowers memorization risk.

arxiv.orgpaperAdded 9 Oct 2026, published 8 Oct 2026🧠 AI

This paper introduces Personal Fact Memory (PFM), a reference layer for diagnosing errors in language-agent memory systems before generation happens, separating stored-state validity, identity resolution, abstention and serving latency. On a controlled revision benchmark, serving only the active value per correctly keyed slot eliminates stale exposure (versus 70.3 percent stale exposure without update resolution), while participant-aware BM25 matches a reference ranker within a 0.02 margin once stores are shared. The harder problem is revision-to-slot assignment: four LLM key assigners get higher key recall than a rule-based extractor but lower clean-retrieval rates, open-domain merge recall on LongMemEval never exceeds 0.062, and entity-posterior filtering reduces but does not eliminate same-name misattribution on LoCoMo; prompt prefill, not retrieval, dominates turn-level latency.

arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🧠 AI

TR-PTQ is a post-training quantization method for transformers that identifies learned LayerNorm scale parameters and GELU's compounded approximations (not SoftMax) as the main sources of accuracy loss when quantizing, contrary to common assumptions about numerical precision. It introduces a unified integer-only formulation using shared Taylor Region exponential/logarithm primitives so division and square roots can run entirely in the log-domain with standard integer arithmetic, paired with a calibration-free, outlier-aware LayerNorm optimization, eliminating the need for floating-point hardware for nonlinearities while keeping accuracy degradation under 1.5% across vision and language benchmarks.

arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🧠 AI

A preprint hosted in OpenAI's "math" GitHub repository claiming a result on integer multiplication algorithms with complexity below the n log n bound, the long-standing benchmark achieved by the Harvey–van der Hoeven algorithm in 2019. The page itself only exposes citation metadata (author, title, BibTeX entry) with the actual paper linked as a PDF, so the specific proof technique and whether it was AI-assisted cannot be confirmed from the fetched text alone.

github.compaperAdded 7 Oct 2026, published 6 Oct 2026🧠 AI

An IACR ePrint paper by Yiming Gao, Xuyuan Han, and Honggang Hu presenting provable classical subexponential algorithms (running in roughly 2^((1/2+o(1))n/ln ln n) time/space) for recovering short secrets in growing parameter families tied to all seven NIST third-round lattice candidates: Kyber/ML-KEM, FrodoKEM, SABER, NTRU LPRime, Dilithium/ML-DSA, Falcon, and cyclic NTRU-HPS/HRSS. The approach extends the Wagner-style Gaussian sampling framework of Ducas, Engelberts, and Loyer (CRYPTO 2025) and a low-error decision-LWE algorithm, using an exact squared-Euclidean-norm gap to binary-search each secret coordinate, and an "affine slice search" over the public lattice for NTRU/Falcon-type quotient relations. The authors explicitly note the subexponential complexity applies to growing/weakened parameter regimes and does not reduce the concrete security of the currently specified NIST parameter sets.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 6 Oct 2026🛡️ Security

This paper proposes a formal framework for "alignment scaling laws," modeling the compute/capability burden needed to hold a fixed safety target for each risk category as a power law B_r(N)=a_rN^alpha_r, where the exponent alpha_r determines whether alignment gets easier, keeps pace, or accumulates "alignment debt" as capability N grows. The authors prove theoretical results (the largest exponent among corrected risks sets the long-run regime, super-exponential headroom requirements above alpha=1, small-model fits underestimate large-scale exponents for power-law mixtures) and apply a preregistered protocol twice: a reanalysis of adversarial-training data on Pythia classifiers (attack-success compute exponent 0.60) and a pilot across Qwen2.5 (0.5B-72B) and Qwen3 (0.6B-14B), finding scaling helps for truthfulness and stated dispositions but sycophancy (exponent ~0.83-0.89) and a planted backdoor behave worse or remain undetermined, with the backdoor surviving blind safety training at most model sizes. The work matters as an early attempt to put the "does alignment get harder with scale" debate on measurable, falsifiable footing rather than anecdote.

arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026🧠 AI

This paper introduces Recursive Video In-Context Learning (RV-ICL), a training-free method that lets an LLM agent orchestrating frozen vision-language-action (VLA) policies learn from a single demonstration video rather than from full video or fixed keyframes. The demonstration is converted into a navigable hierarchy (task keyframes, phases, moments, short clips) built around sub-events like grasps and releases, exposed to the agent as read-only tools it queries coarsely during planning and drills into for contact-level detail during execution. Built on the RPent agent, it raises task success from 92.6 percent to 96.5 percent on LIBERO-PRO and from 86.7 percent to 95.8 percent on LIBERO-Plus with only one demonstration per task.

arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026🧠 AI

BRANCH-MoE proposes routing experts in a Mixture-of-Experts layer through a binary decision tree of depth log2(E), where each internal node's branching probability is centered on an exponential-moving-average of arrival-weighted scores, avoiding the need for an auxiliary load-balancing loss. The paper proves the EMA mechanism prevents routing-mass collapse under log-concave arrival distributions, links expert execution frequency to stochastic-gradient convergence rate, and shows that tree-prefix device assignment bounds cross-device communication. It is benchmarked against Switch softmax routing, DeepSeek-V3 dynamic-bias routing, Skywork logit-normalized routing, and hash routing on Criteo CTR, Forest Covertype, HIGGS, and YearPredictionMSD with E=16 experts and top-4 routing.

arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026🧠 AI

An IACR ePrint paper showing that the message-only implicit-rejection KEM variant of the Fujisaki-Okamoto (FO) transform used by ML-KEM is uninstantiable in general (under LWE plus subexponentially secure iO and puncturable PRFs), meaning no concrete hash function can replace the random oracle while preserving IND-CCA2 security for every injective trapdoor function. The authors instead give sufficient conditions, via a new "distributional injective extractability" property, to achieve standard-model IND-CCA2 security for the hybrid-encryption (not KEM) formulation of FO, with a standard-model instantiation left open. This directly bears on the theoretical foundations underlying ML-KEM's security proof.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security

This paper introduces a paired-replay testbed that samples a single LLM agent request and replays the identical malicious action, resource, and arguments under four authorization conditions: broad bearer tokens, scoped JWTs, sender-constrained tokens, and Open Policy Agent policies. Across 128 scenarios in four tool domains and five local model configurations, broad-bearer tokens let roughly 9 to 38 percent of attacked, post-exposure decisions execute harmful actions, while all three scoped conditions recorded zero harmful executions; a supplementary AgentDojo extension found 11 of 24 injected attacks succeeded under broad policy versus 0 of 24 under scoping. The authors frame this as evidence that scoping contains cross-action and cross-resource consequences of prompt injection, not that it prevents the injection itself.

arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026🛡️ Security

This paper proposes a fail-closed "bounded provisional visibility" protocol for continuously ingested RAG vector stores, which admits new content under a verification deadline and hides items whose vetting hasn't committed in time, bounding how long unvetted (potentially poisoned) content can be retrieved. Evaluated on five document workloads using an exact-match backend and Milvus with HNSW indexing, the deadline-based admission cut median poisoned retrievals from 34 to 7 under verifier backlog versus asynchronous admission with no deadline, while verify-before-visible avoided exposure entirely but delayed clean content visibility to 6.3s versus 3ms for provisional admission. The work quantifies the inherent trade-off between freshness, availability, and poisoning exposure in continuously updated retrieval systems, and shows results remain conditional on the quality of the underlying poison detector.

arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026🛡️ Security

This IACR ePrint paper presents a native-Rust, memory-safe implementation of the Korean KpqC competition's standardized post-quantum schemes — KEMs NTRU+ and SMAUG-T, and signatures HAETAE and AIMer — replacing the reference memory-unsafe C code. The authors expose all seven KEM parameter sets and four signature modes through a single pluggable provider demonstrated across three real deployment front-ends: a rustls TLS 1.3 key-exchange group, an OQS/liboqs-compatible C ABI, and an analytical CCSDS/SDLS satellite constrained-link model, showing SMAUG-T variants are smaller/faster than ML-KEM-768 on constrained space links and a memory-optimized NTRU+ build cuts peak stack by up to 25% at negligible latency cost.

eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security

RubricArmor is an adversarial framework for generating evaluation rubrics used in rubric-based reinforcement learning of LLMs, designed to preempt reward hacking before RL training begins. It alternates an attack step, which synthesizes adversarial responses that satisfy the current rubric while failing the actual task, with a repair step that revises the rubric to close the exposed gaps while keeping valid criteria intact. The paper reports that rubrics produced this way outperform existing LLM-based rubric generation baselines and lead to more effective downstream rubric-based RL.

arxiv.orgpaperAdded 6 Oct 2026, published 4 Oct 2026🧠 AI

VulValidate is a framework where LLM agents coordinate dynamic-analysis tools to reconstruct vulnerable/fixed code revisions and build triggering experiments that verify whether a function labeled "vulnerable" in a commit-derived dataset actually exhibits the vulnerability. Applied to all 35,849 vulnerable-labeled instances in BigVul, PrimeVul, and DiverseVul, it confirms 57.2%, relabels 19.0% as mislabeled, and leaves the rest undecided or unmeasured, producing a corrected 15,890-function release; retraining five detectors on corrected labels improves F1 for four of five on each dataset. The work exposes how commit-based labeling noise inflates or depresses vulnerability-detector benchmarks and ships a reusable auditing skill and corrected datasets.

arxiv.orgpaperAdded 6 Oct 2026, published 4 Oct 2026🛡️ Security

COPEX (COntext Provider EXploitation) is a benchmark that isolates the tool-selecting LLM as the unit of evaluation in Model Context Protocol systems, fixing the surrounding agent stack and varying only the model to measure its intrinsic susceptibility to adversarial context. It covers 25 attack types across 125 scenarios spanning four entry surfaces — model/agent, client, server/tool, and transport — and tests nine models across 3,375 trials, finding a mean attack success rate of 64.4% (58.3%–71.4% by surface); combined input and context scanning cut mean attack success by 49.6% on an eight-attack defense subset. The work separates "system exposure" (attacks succeeding outside the model's observation/control) from "model susceptibility," and the benchmark itself is released publicly.

arxiv.orgpaperAdded 6 Oct 2026, published 3 Oct 2026🛡️ Security

ReFract is a benchmark of 150 expert-validated entries testing whether LLM agents can infer a user's role and act only through tools/actions legitimate for that role, a capability the authors term "Perspective Awareness." Entries are grounded in anonymized industrial-maintenance support queries and use constructed Text World Models to simulate the agent's operating environment and generate perspective-aware action trajectories. State-of-the-art LLMs solve at most 69% of tasks, with over half of trajectories containing attempts at perspective-violating actions, exposing this as a largely unsolved axis of agent evaluation relevant to high-stakes, physically-enacted agent deployments.

arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026🧠 AI

This arXiv SoK paper systematizes the quantum-era risks facing stablecoins, mapping cryptographic dependencies (issuer, custody, upgrade, oracle, bridge keys) to monetary control surfaces and classifying migration options along who can authorize a change, where it occurs, and whether it is hybrid, post-quantum native, or encapsulated. It introduces an "authority-liability gap" concept — the entity able to migrate a cryptographic component is often not the one that bears losses if migration fails — and connects migration choices to redemption, continuity, and intervention requirements under current stablecoin regulation. The paper also flags open problems in threshold authorization, dormant/wrapped supply, and measuring quantum-vulnerable exposure.

arxiv.orgpaperAdded 5 Oct 2026, published 1 Oct 2026🛡️ Security

This arXiv Systematization of Knowledge paper surveys the literature (2019–2026) on blockchain-assisted intrusion detection and response, proposing a three-axis taxonomy classifying proposals by detection-system class (NIDS, HIDS, EDR/XDR), blockchain's functional role, and response-automation maturity. It argues existing surveys wrongly conflate blockchain's roles and ignore the shift from classic IDS/IPS to modern EDR/XDR, then exposes why a true per-endpoint blockchain-anchored response loop remains nearly nonexistent due to consensus latency, deployment, and community mismatches, and flags cross-cutting risks including smart-contract attack surfaces, post-quantum cryptographic weaknesses, and adversarial manipulation of LLM-based detection engines.

arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026🛡️ Security

VibeMemBench is a benchmark for evaluating persistent memory systems on 111 real-repository coding targets (from 90 SWE-rebench V2 repos, with 3,634 prior-work trajectories), built via a four-stage SIEVE pipeline that verifies a target's injected history experience actually improves executable test outcomes before inclusion. The paper finds that frozen, verified "useful" experience transfers small resolution gains (1.1–4.5 pp) and step reductions to held-out solvers (DeepSeek-V4-Pro, GLM-5, GLM-5.2, Kimi-K2.7-code, Qwen3.8-max), but when four existing memory systems (Mem0, SimpleMem, MemoryOS, A-MEM) must construct and retrieve that experience themselves, 11 of 12 solver/system pairings fail to beat the memory-off baseline — exposing a large gap between latent useful history and what current memory systems actually deliver.

arxiv.orgpaperAdded 30 Sep 2026🧠 AI

SAGE is a statistical acceptance gate for self-evolving LLM agents that replaces the naive accept-if-aggregate-score-improves rule used when an optimizer edits an agents persistent skill document. It uses per-item paired comparison between the current and edited skill on identical validation items, exposing regressions an aggregate score hides, plus a one-sided paired significance test that only commits edits whose wins reliably beat their losses, addressing both permanent regression risk and the optimizers curse from noisy finite validation sets. Across five benchmarks and four backbone LLMs, SAGE cuts regression rates in 19 of 20 settings, for example 36.5 percent to 0 percent on LiveMath and 42.8 percent to 0 percent on OfficeQA with DeepSeek V4, while also achieving the best final score in all 20 settings.

arxiv.orgpaperAdded 30 Sep 2026🧠 AI

This SoK paper empirically evaluates 24 published emulation-based dynamic analysis tools for ARM Cortex-M firmware re-hosting, using large-scale datasets from OTACAP and FirmLine totaling 4,571 deduplicated ARM firmware samples. It finds that only 34.5% of samples can be successfully fuzzed by any existing tool, with average code coverage of just 10% and frequent false crashes/hangs, exposing systemic gaps across the emulation, fuzzing, and bug-diagnosis pipeline stages.

arxiv.orgpaperAdded 2 Oct 2026, published 30 Sep 2026🛡️ Security

TraceDance is an automated system that mines real-world agent deployment traces to build targeted benchmarks for user-specified undesirable agent behaviors, using an Anchor-and-Confirm retrieval-plus-LLM-confirmation pipeline and an Anchor Synthesis Loop to generate behavior specifications. Benchmarks evaluate an LLM's next-turn response at a recorded decision point against a behavior-specific rubric, avoiding the need for reference answers or environment replay. Applied to 252,557 sessions in coding and tool-use domains, it produced 107 benchmarks with 4,125 instances, and testing nine frontier LLMs found a mean pass rate of only 26.7 percent, exposing persistent agentic behavior weaknesses.

arxiv.orgpaperAdded 29 Sep 2026🧠 AI

A Proceedings on Privacy Enhancing Technologies paper by IMDEA Networks researchers systematically analyzes the web (via instrumented Chrome/CDP) and Android (via Androguard static analysis plus dynamic instrumentation on a Pixel 3a) clients of nine conversational AI services — ChatGPT, Claude, Grok, DeepSeek, Gemini, Perplexity, Microsoft Copilot, Mistral's Le Chat, and Meta AI. They find every service embeds at least one third-party advertising/tracking service (44 third parties total), that 6/9 web and 3/8 Android clients leak conversation titles, prompts, or screenshots to trackers alongside persistent identifiers, and that several providers expose entire conversations via publicly accessible permalinks lacking access controls. The paper evaluates how consent choices, subscription tiers, and access-control settings shape this exposure and analyzes the practices against GDPR and the ePrivacy Directive, following responsible disclosure to providers and EU DPAs.

jorgegarciaherrero.compaperAdded 2 Oct 2026, published 29 Sep 2026🛡️ Security

Proposes a doubly-spectral stochastic (DSS) expansion for graph neural networks that unifies calibration, out-of-distribution detection, and distribution-shift robustness in a single representation: graph Fourier filters capture structural variation while an orthogonal-polynomial chaos coordinate captures latent stochastic variation. DSS-GNN (standalone) achieves the lowest Brier score across 14 node classification benchmarks without post-hoc correction, and DSS-Hybrid (a residual branch beside a deterministic encoder) achieves the best AUROC on most node-OOD settings and strongest shifted accuracy on all 7 GOOD concept-shift benchmarks under standard ERM. A capacity theorem shows the method matches chaos coefficients of Gaussian-latent random graph signals under full-rank assumptions with exponentially decaying truncation error.

arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

CallScreenBench is a benchmark for evaluating small, quantized (4-bit, 0.6-4B parameter) language models acting as autonomous phone secretaries that screen inbound calls without a cooperative caller-assigned task. It reports five automated call-and-note measure groups tied to owner endorsement (service, recall, plausibility, triage discrimination) plus three guardedness diagnostics for toolless, credential-free proxies, deliberately avoiding a single composite score to expose trade-offs like scam-detection TPR versus legitimate-call false positives. Testing across three paired model-family checkpoints reveals that larger checkpoints score higher on some measures while triage discrimination follows a different ordering, and scripted degenerate policies (e.g., hangup-and-echo) expose measurement floors.

arxiv.orgpaperAdded 26 Sep 2026🧠 AI

This paper proposes no-box vulnerability analysis, a new paradigm for auditing systems using only functionality metadata when neither system access nor runtime interaction is available. The authors build MCPSEC, a prototype that audits Model Context Protocol servers for indirect prompt injection vulnerabilities purely from tool metadata exposed at server registration, evaluating it against 20 widely-deployed MCP servers with 177 tools where human evaluators confirmed 95 vulnerable tools; MCPSEC achieved 98.9% recall versus 84.2% for an LLM baseline, also producing hypothesized exploitation techniques per finding.

arxiv.orgpaperAdded 26 Sep 2026🛡️ Security