AhsayCBS Flaws Exploited to Deploy Web Shells Get New Fixes After Incomplete Patches

CVE-2026-105133 · CVE-2026-105134

Singapore-based Ahsay Backup has released security updates to address two security flaws in AhsayCBS that have been expl

历史摘要 · 未重新核验 · The Hacker News

My Credentials, Please: Detecting Filesystem Capability Laundering in MCP Servers at Scale

The Model Context Protocol (MCP) standardizes how AI agents invoke external tools. MCP servers expose tools through a de

历史摘要 · 未重新核验 · arXiv cs.CR

Subgraph Counting with Local Node Differential Privacy

We study the problem of approximately counting subgraphs under local node differential privacy (LNDP), a recently introd

历史摘要 · 未重新核验 · arXiv cs.CR

Language Is a Security Surface for Agent Guards

Step-level guards decide, before each tool call, whether an agent's next action is safe given the user's request and the

历史摘要 · 未重新核验 · arXiv cs.CR

Shortcut Sensitivity in Agent-Safety Evaluations

AI agents take actions through tools. Some actions are sensitive, so guards that supervise them must themselves be evalu

历史摘要 · 未重新核验 · arXiv cs.CR

MAppPrint: Robust and Real-time Mobile App Fingerprinting via Traffic Behavior Correlation Graphs

Mobile apps have become ubiquitous in daily life. Despite communication encryption, app fingerprinting (AF) attacks can

历史摘要 · 未重新核验 · arXiv cs.CR

SMT-Boosted Security Types and Correctness for Low-Level MPC

Secure Multi-Party Computation (MPC) is an important enabling technology for data privacy in modern distributed applicat

历史摘要 · 未重新核验 · arXiv cs.CR

Encoded but Exposed: Language Embeddings can Reveal More Than They Should in Recommender Systems

Language embeddings are increasingly used in recommenders to represent item content, but their privacy risks remain poor

历史摘要 · 未重新核验 · arXiv cs.CR

Federated Art Chase: Privacy Leakage and Data Poisoning in Federated Fine-Tuning

Federated learning (FL) is increasingly used to adapt a pretrained, centrally fine-tuned model to data that remain on us

历史摘要 · 未重新核验 · arXiv cs.CR

Pricing the Unprovable: Ambiguity, Turnstile Runs, and the Verifiability Discount in Crypto Protocols

Privacy-preserving protocols can repair a vulnerability without establishing whether it was exploited beforehand, even w

历史摘要 · 未重新核验 · arXiv cs.CR

On the Robustness of Gossip Protocols in Modern Blockchains

Modern platforms such as Ethereum and Polkadot nowadays execute Byzantine fault-tolerant consensus protocols over large

历史摘要 · 未重新核验 · arXiv cs.CR

NEST: Stale-Robust Tokenized-Stock Measurement for a Crypto-Treasury LETF Stack

Tokenized equities trade while listed markets are closed, so their marks could improve off-hours measurement along layer

历史摘要 · 未重新核验 · arXiv cs.CR

Smoothness of Shortest Isogenies to Frobenius Conjugates

Let $E$ be chosen uniformly from the geometric isomorphism classes of supersingular elliptic curves over $\overline{\mat

历史摘要 · 未重新核验 · arXiv cs.CR

Matoi: Selective Revalidation of Consequence Evidence for Agent Authorization

Matoi separates reusable consequence evidence from current execution authority and durable occurrence history. Its finit

历史摘要 · 未重新核验 · arXiv cs.CR

When Rotation Bounds Nothing: Streaming Image Classifiers to Field Nodes Under Physical Capture

Field nodes run image classifiers locally, exposing a first-class asset, the trained model, to theft. Trusted-execution

历史摘要 · 未重新核验 · arXiv cs.CR

Trigger Value Selection in Clean-Label Malware Backdoors: An Effectiveness-Detectability Analysis

Clean-label backdoor poisoning is a threat to machine learning-based malware classifiers because poisoned samples can be

历史摘要 · 未重新核验 · arXiv cs.CR

On the Complexity of Symmetric Boolean Functions in Multiparty Private Simultaneous Messages

Multiparty Private Simultaneous Messages (PSM), also known as Decomposable Randomized Encoding (DRE) or information-theo

历史摘要 · 未重新核验 · arXiv cs.CR

FedSumUp: User-Auditable Privacy-Aware Representation Sharing for Resource-Constrained Federated Intelligence

Existing federated data condensation methods face privacy risks, as uploaded synthetic data may preserve sensitive infor

历史摘要 · 未重新核验 · arXiv cs.CR

Explicit reduced APN permutations: ramification and optimal Galois-ring lifts

Let $m\ge5$ be odd and $q=2^m$. For every odd $r$ with $3\le r<m$ and $\gcd(r,m)=1$ we give the reduced polynomial $P_{m

历史摘要 · 未重新核验 · arXiv cs.CR

Amora: Communication-Efficient Private Approximate Nearest Neighbors Search

Approximate nearest neighbors search (ANNS) over cloud-hosted vector databases raises a critical privacy concern: the qu

历史摘要 · 未重新核验 · arXiv cs.CR