- Cryptanalysis and Enhancement of VTBSAE: Provably Secure Verifier-Based PAKE Protocols for the Industrial Internet of Things
Cryptanalysis of VTBSAE, a verifier-based PAKE protocol for the Industrial Internet of Things, showing it fails to resist client impersonation after server compromise. The authors propose E-VTBSAEv1, which binds the client point E1 to fresh server randomness, and prove AKE security and forward secrecy in the random-oracle model under CDH. Raspberry Pi 4B tests show runtime comparable to VTBSAE with the same communication and storage overhead.
eprint.iacr.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🛡️ Security
CRISP: Co-designing Pruning and Scheduling for Efficient MoE Inference on Edge ServersCRISP is a combination-aware framework that co-designs pruning and runtime scheduling for Mixture-of-Experts inference on memory-constrained edge platforms. It reorders neurons by importance so one stored expert supports several execution widths, gives hot, warm and cold expert combinations different widths, and overlaps expert loading with computation. On Mixtral-8x7B and DeepSeek-MoE-16B it raises throughput up to 2.1x at the same memory budget, with accuracy loss limited to 3.6%.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🧠 AI
Alg\{Ossa\}: Decentralized Secure Aggregation with Rotating Committees and Eventual DeliveryAlgOssa is a decentralized secure aggregation protocol built on Ossa, a generic committee-aided, single-server construction for one-shot clients (following OPA and Willow, CRYPTO 2025). Ossa realizes secure aggregation with non-selective abort against a malicious server. AlgOssa adds Algorand-style sortition to rotate leaders and committees, bounds the chance of an honest server, and gives eventual delivery. Classical and post-quantum routes are evaluated.
eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security
Measuring Users' Security and Privacy Concerns About Third-Party Community Bots on DiscordMeasurement study of 23,102 third-party Discord bots and 183,142 user reviews (2021-2026, 49 languages). A fine-tuned DeBERTa classifier plus manual validation yields 8,832 security and privacy reviews, mapped to a 31-theme taxonomy; Data Sharing (30.5%) and Data Collection (16.2%) dominate. Permission count and admin status correlate only weakly with user concerns. The authors build BotLens, an MCP-server auditing framework with six tools.
arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security
Log-To-Leak: Prompt Injection Attacks on Tool-Using LLM Agents via the Model Context ProtocolLog-To-Leak is a prompt-injection attack on tool-using LLM agents that abuses Model Context Protocol tool metadata to trigger an attacker-controlled logging call after the last legitimate call, leaking the user query, server name, server response and agent response. Evaluated on five MCP servers and four agents, it reaches 62.64-100% attack success with 76.55-95.64% logging accuracy. Three defenses leave over 55% residual ASR on GitHub MCP with GPT-4o.
arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026🛡️ Security
LINE-Break: Cryptanalysis and Reverse Engineering of Letter SealingLINE-Break is a security analysis of Letter Sealing v2, the custom end-to-end encryption protocol in the LINE messenger. A TLS man-in-the-middle attacker or malicious server can replay, reorder and block messages undetected, and colluding users can forge message authorship in one-to-one and group chats. Stickers and URL previews leak plaintext. The attacks were verified on the real iOS app and an independent implementation.
eprint.iacr.orgpaperPublished and added 26 Oct 2026🛡️ Security
Private Information Retrieval with Accountability at Erasure-Optimal Server RedundancySynTrace is a single-round compiler that adds accountability to linear private information retrieval (PIR). The client mixes the retrieval query with m audit queries, so audit syndromes identify up to d deviating servers among t colluding ones before reconstruction. The paper proves perfect query privacy and zero false identification within the threshold. For Shamir-based PIR it needs k=t+d+1 servers. For a 32 KiB record from a 1 GiB database it uses 2.25 MiB, against 8.96 MiB for the Eriguchi, Kurosawa and Nuida (TCC 2022) homomorphic-MAC construction.
eprint.iacr.orgpaperPublished and added 26 Oct 2026🛡️ Security
DISCO*: DIstributed and SCalable Oblivious Joins and Oblivious PrimitivesDISCO is a distributed, fully oblivious database system that combines hardware enclaves (TEEs) with oblivious primitives to hide access patterns from side-channel and leakage-abuse attacks. New distributed frameworks and communication optimizations let it run in parallel across servers. It reports 88x speedup over Jodes and 180x over SODA on non-foreign-key joins with 2^25 elements, and the first terabyte-scale results.
eprint.iacr.orgpaperAdded 21 Oct 2026, published 20 Oct 2026🛡️ Security
HERMES: High-Performance Private Decoding for Large Language ModelsHERMES is a privacy-preserving inference (PI) system optimised for multi-token LLM decoding rather than prefill. It swaps high-round nonlinear protocols for compute- and bandwidth-heavy ones with fewer rounds, and adds a homomorphic-encryption matrix-multiplication protocol that keeps the KV cache encrypted on the server and uses grouped-query attention. On Llama 3.1 8B Instruct it cuts TPOT by up to 2.7× and total PI latency by up to 2.1×.
eprint.iacr.orgpaperAdded 19 Oct 2026, published 18 Oct 2026🧠 AI- ToFu: Exploiting and Fuzzing the LLM–Orchestrator–Tool Trust Boundary
ToFu is a tool-aware fuzzing framework for LLM tools, including MCP servers. It maps each tool argument, using its metadata, to one of 74 CWE-guided semantics-aware sanitizers (path, URL, SQL and similar). It then generates schema-valid Atheris harnesses and semantic oracles, using runtime tracers for in-process tools and outcome oracles for opaque ones. The LLM (gpt-4.1) only maps sanitizers and writes seeds; it is never the security judge. The paper also shows a "Repeat-After-Me" trick, where an LLM told to repeat attacker-crafted text emits a tool call the orchestrator executes, reproduced on LangGraph, MAF, ADK 2.0, AutoGen, Strands and CrewAI. Across 273 runnable MCP servers (3,405 tools) it reports 253 verified bugs in 343 tools across 118 servers, such as path traversal, log injection and exfiltration. These are failures a crash-based fuzzer would miss. The result matters because it shows LLM-generated tool arguments cannot be treated as trusted.
arxiv.orgpaperAdded 18 Oct 2026🧠 AI - ToFu: Exploiting and Fuzzing the LLM–Orchestrator–Tool Trust Boundary
ToFu is a tool-aware fuzzing framework that derives semantic security checks for LLM tools (mainly MCP servers) from their metadata and a corpus of 74 CWE-guided sanitizers. It generates schema-valid Atheris harnesses, uses runtime tracers and outcome oracles to catch bugs that don't crash, and uses an LLM only to map sanitizers and seed inputs, never as the judge. It also describes a "Repeat-After-Me" attack, in which the LLM is told to repeat attacker-written text that the orchestrator then dispatches as a tool call. It was reproduced on LangGraph, MAF, ADK, AutoGen, Strands and CrewAI. On 273 MCP servers it reports 253 verified bugs across 343 tools in 118 repositories, including path traversal, log injection, exfiltration and command bypass.
arxiv.orgpaperAdded 18 Oct 2026🛡️ Security
FedRAPP: Federated Test-Time Prompt Tuning for Vision-Language Models with Reliability-Aware Prompt PersonalizationFedRAPP 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
SwiftAuth: Conditional Privacy-Preserving UAV Authentication with Multi-Source Credential Aggregation and Non-Interactive AuthorizationThe paper proposes a traceable and aggregatable tagged witness signature (TA-TWS) and builds SwiftAuth on it, a conditional privacy-preserving anonymous authentication framework for UAVs and other dynamic terminals. Issuers can create authorization components while users are offline. Several credentials compress into one constant-size proof, verifiers can batch-verify across users, and a regulatory trapdoor lets authorities trace misbehaving users. TA-TWS is proven unforgeable and witness-hiding, and benchmarks with the MIRACL Core library on constrained devices and Aliyun servers show it is practical.
eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026🛡️ Security
DK-VLM: Geometry as Position for Spatial Reasoning in Vision-Language ModelsDK-VLM adds Dual-Kernel Attention to a vision-language model. A semantic kernel keeps the pretrained attention and positional encoding. A separate geometric kernel uses estimated 3D points and camera poses to modulate attention through point displacements and relative view transformations, and a learned gate fuses the two outputs. Geometry therefore enters attention as position, not as fused 3D reconstruction features. The paper also adds Reference-Frame Composition (RC) supervision, which gives stepwise turn and heading targets derived from verified single-step annotations, to train multi-step spatial reasoning as the observer moves. DK-VLM-8B reports the highest average score across six spatial benchmarks among the compared methods, with 74.33 on VSI-Bench and 58.28 on ReVSI-32, and it preserves general video understanding.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI
My Credentials, Please: Detecting Filesystem Capability Laundering in MCP Servers at ScaleStudies "filesystem capability laundering" in MCP servers: client approval of a tool call grants the server process broad host filesystem access, so attacker-steered arguments can reach sensitive files outside the tool's declared contract. The authors build MCP-FSD, which infers per-tool least-privilege boundaries, plants credential fixtures outside them, and tests exploitability and sandbox containment by paired dynamic execution. Of 21,097 servers from nine registries, 16.4% of 4,806 triaged servers have filesystem capabilities despite non-filesystem classifications. Dynamic validation confirmed 150 vulnerable instances, and disclosure produced 13 advisories, including two CVEs in Anthropic's Git MCP Server.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🛡️ Security
Efficient KV Cache Migration for Geo-Distributed LLM Inference in Collaborative Edge ComputingProposes EdgeFlow, a hybrid KV cache migration scheme for distributed LLM inference across heterogeneous edge servers in Collaborative Edge Computing. It combines direct KV cache transmission with activation-based recomputation, overlapping computation and communication to cut migration time when servers disconnect or overload. The authors formulate a multi-node KV migration optimization problem and give a 2-approximation algorithm built on improved LP relaxation and bipartite graph techniques. Experiments on a real distributed LLM inference platform show up to 45% lower migration time.
arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI
SecAgg++: A Post-Quantum Privacy Preserving Federated Learning ProtocolSecAgg++ 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++: A Post-Quantum Privacy Preserving Federated Learning ProtocolSecAgg++ 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
Causal Awareness in End-to-End Encrypted Group MessagingCryptography paper that extends Chen and Fischlin's two-user Signal analysis (Eurocrypt 2024) to group chats. It introduces "causal awareness": a receiver can reconstruct part of the causal context in which an accepted message was sent. Network delay or adversarial interference can otherwise show an authentic message in a misleading context. Senders transmit records of what they have sent and received, and receivers verify these records and compare them with their own. The paper gives correctness and security definitions parameterized by how much causal information must be recovered, baseline constructions with proofs, and checkpoint-aided and server-aided variants. It also discusses how to surface this information in a messenger's UI.
eprint.iacr.orgpaperAdded 14 Oct 2026, published 13 Oct 2026🛡️ Security
State of Dependency Management 2025 | Endor LabsEndor Labs' 2025 State of Dependency Management report examines how AI coding agents and MCP servers add supply chain risk. Researchers analysed 10,663 GitHub MCP server repositories and tested AI-generated dependency recommendations across PyPI, npm, Maven and NuGet, finding agents import vulnerable or non-existent packages. MCP servers are immature: 75% are built by individuals, 41% lack license info, and 82% use sensitive APIs. The report advises treating AI-generated code as untrusted third-party input subject to code review, SAST/SCA and dependency governance.
endorlabs.compaperPublished and added 12 Oct 2026🛡️ Security
TokenRouter: Efficient Serving System for Token-Level LLM RoutingTokenRouter is a serving system for token-level routed LLM inference, where different tokens of one request are routed across different models. It uses request-centric programming with model-centric execution: developers write routing logic per request while the runtime launches a subserver per LLM and dispatches requests asynchronously. Each subserver uses a delayed-batching scheduler whose hyperparameters come from a mathematical throughput model, fixing step desynchronization and batch admission delays and giving 2.01-64.15x higher decoding throughput than existing systems.
huggingface.copaperAdded 9 Oct 2026🧠 AI
Reverse-Bleichenbacher: Bleichenbacher Attacks are Practical AgainPresents Reverse-Bleichenbacher, a variant of the Bleichenbacher RSA PKCS#1 v1.5 padding-oracle attack that recovers the least significant bytes first and stops once the TLS PreMasterSecret is found. With improved trimmers and coverage-optimized search, median oracle queries against a 2048-bit key drop from 11,428 to 1,801, and 68.3% of runs finish within a 30s timeout under single-server conditions. The authors find 640 vulnerable domains in the Tranco Top 1M (many behind Alibaba Cloud load balancers) and demonstrate MITM malicious update injection leading to remote code execution.
eprint.iacr.orgpaperAdded 11 Oct 2026, published 8 Oct 2026🛡️ Security
Applying Security by Design at the Point of Execution: How Governed Security Requirements Affect the Security of AI-Generated CodeEvaluates delivering security requirements from a governed security-by-design knowledge base (SbD-ToE) to a code-generating LLM through an MCP server at generation time. On DualGauge (59 Python tasks) the share passing all security tests rose from 44.1% to 78.0%; on BaxBench (28 backend scenarios) the share of functionally correct solutions with no successful exploit rose from 65% to 86%, matching the authors' Oracle Security Reminder (85%). The joint secure-and-functional metric did not improve significantly, since stricter code failed functional tests that fix unstated values. The study used one model and one generation per task, and it proposes measuring conformance with applicable requirements rather than only detecting known weaknesses.
arxiv.orgpaperAdded 9 Oct 2026, published 7 Oct 2026🛡️ Security
Applying Security by Design at the Point of Execution: How Governed Security Requirements Affect the Security of AI-Generated CodeThe preprint tests whether security requirements from a governed security-by-design knowledge base (SbD-ToE), delivered to a code generator through a Model Context Protocol server at generation time, make AI-written code more secure. On DualGauge (59 Python tasks, LLM-judge scoring) the share of tasks passing all security tests rose from 44.1% to 78.0%. On BaxBench (28 backend scenarios with real exploits in containers) the share of functionally correct solutions with no successful exploit rose from 65% to 86%, comparable to the authors' Oracle Security Reminder (85%). The pre-specified joint secure-and-functional metric did not improve significantly, and the stricter code failed functional tests that fix values the task never states. The study used one model and one generation per task. The authors argue that current benchmarks only detect the weaknesses their evaluators were built for, and propose measuring conformance with the requirements that apply.
arxiv.orgpaperAdded 9 Oct 2026, published 7 Oct 2026🧠 AI
Post-Quantum Dropout-Resilient Verifiable Secure Aggregation for Federated LearningPQ-DVSA is a verifiable secure aggregation protocol for federated learning that aims to be post-quantum secure, tolerate client dropouts, let clients verify a server's aggregation result, and resist bounded collusion between the server and clients, while also protecting the aggregation weights, not just model updates. The authors report learning performance comparable to exact weighted aggregation and up to 96 percent lower per-client encrypted-submission runtime than SWAS, the closest prior scheme.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🛡️ Security
Post-Quantum Dropout-Resilient Verifiable Secure Aggregation for Federated LearningPQ-DVSA is a verifiable secure aggregation protocol for federated learning that combines post-quantum cryptography, resilience to client dropouts, and verifiability of the server's aggregation result under bounded server-client collusion. It protects both clients' local model updates and their aggregation weights, lets the server reconstruct the aggregate mask for the active client set after dropouts, and lets clients cryptographically check the aggregation result. Experiments show learning accuracy comparable to exact weighted aggregation while cutting per-client encrypted-submission runtime by up to 96% versus SWAS, the closest prior scheme.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🧠 AI
EntroPrefill: Renyi-Guided Context Pruning with Conditional Stability Guarantees for Retrieval-Augmented GenerationEntroPrefill proposes a Renyi-entropy-guided mechanism for pruning context mid-prefill in retrieval-augmented generation, using sink-isolated regularized head pooling compatible with grouped-query attention to decide which tokens can be safely discarded. It derives a mixture-to-head deletion envelope bounding feasible token removal, a finite-sample observer guarantee valid under adaptive layer selection, and a conditional transformer perturbation bound with explicit Lipschitz constants and a first-token decision-margin corollary, plus a systems-level break-even analysis of KV-transfer payload versus pruning savings. The paper is explicitly theoretical, defining assumptions and formal limits without reporting empirical speedup or accuracy-preservation results.
arxiv.orgpaperAdded 8 Oct 2026, published 7 Oct 2026🧠 AI
Measuring Parallel Execution of Classical–PQC Component Pairs in Hybrid TLS 1.3An IACR ePrint paper benchmarks whether running the classical and post-quantum components of hybrid TLS 1.3 key exchange (ECDHE–ML-KEM) and Composite ML-DSA signatures in parallel on separate pthread worker threads reduces handshake latency versus sequential execution. Across three RFC 10024 ECDHE–ML-KEM groups with server and mutual authentication, parallelism sped up all six tested conditions on a standard ARM and x86 system (1.04×–1.28×), with the largest gains in signature stages where component times are balanced, but slowed every condition on a low-power x86 system (0.80×–0.92×) because thread wake/wait overhead outweighed savings. The authors conclude that component independence alone doesn't guarantee a speedup and that parallelization decisions must be validated per target environment.
eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security
COPEX: Benchmarking LLM Robustness to Adversarial Context Across Model Context Protocol LayersCOPEX (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
The Innocent Courier: Covert Exfiltration Through Legitimate LLM Web FetchingLLMLeak is an attack that abuses an LLM agent's legitimate web-fetching tool as a covert exfiltration channel for malware that cannot itself reach the internet. A local malicious component embeds a secret in a URL disguised as useful reference material (e.g. for a library migration task); when the LLM fetches it, the secret reaches an attacker-controlled DNS or web server, achieving a 79.7% attack success rate across eleven open-parameter models and working against real-world chatbots.
arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026🛡️ Security
Showing 30 of 46
Show more