ZeroHour

Search: “Modal”

5 stories

Cost-Aware Hierarchical Multi-Agent Ransomware Detection and Family Attribution

Researchers propose a hierarchical multi-agent system that cuts ransomware analysis cost by 44% while reaching 96.57% detection accuracy.

An arXiv paper (2609.04820) presents a Cost-Aware Hierarchical Multi-Agent System (HMAS) for adaptive ransomware detection and family attribution. Specialized agents run static analysis first, with dynamic and memory modalities invoked only when confidence is insufficient or specialists disagree; a Meta Orchestrator balances accuracy against computational cost via a cost model, and a locally deployed LLM verifies difficult cases. The system achieved 96.57% accuracy, 0.96 F1-score, and 0.99 ROC-AUC for binary detection, and 0.90 macro-F1 for multiclass family attribution. Average analysis cost dropped 43.97% versus exhaustive analysis, with 56.05% of cases resolved using static evidence alone.

arXiv cs.CR · 12d agoResearch

Deep-Fake CAPTCHA: Mitigating Next-Generation Social Engineering Attacks

Researchers propose DF-CAPTCHA, a challenge-response defense that verifies callers in voice and video to defeat real-time deepfake impersonation in social engineering.

The DF-CAPTCHA framework prompts call participants with simple challenge-response tasks that are easy for humans but hard for real-time deepfake systems to convincingly generate. Responses are verified on four criteria: realism, identity consistency, task completion, and response time. User studies and experiments with real-time deepfake models across audio and video modalities show substantially improved detection over passive artifact-based methods.

arXiv cs.CR · 5d agoResearch1

Don't Send What You Don't Need: Question-Guided Token Pruning as a Privacy Defense for Vision-Language Models

QPriv-VL prunes privacy-sensitive visual tokens in federated/split VQA, cutting membership-inference success on VQA-RAD from 0.99 to 0.76-0.79 using ~40% of tokens.

The paper proposes QPriv-VL, a question-guided token-pruning framework for federated, split, and U-shaped split learning that suppresses privacy-sensitive visual patches before transmission. Its Dynamic Threshold Predictor combines cross-modal question relevance with frozen DINOv2-derived sensitivity to compute a per-sample pruning ratio and retention mask in one forward pass, without sensitivity labels. Evaluated on GQA, OK-VQA, VQAv2, SLAKE, VQA-RAD, and PathVQA against FSHA, FORA, iDLG, and attribute-inference membership inference attacks, it matches or beats fixed-ratio pruning. On VQA-RAD it reduces membership-inference success from 0.99 to 0.76-0.79 while preserving competitive accuracy with about 40% of the original token budget.

arXiv cs.CR · 1d agoResearch