cập nhật 1 giờ trước

⏱ Độ trễ thật của tab này: trung bình 7.3 giờ sau khi CVE được công bố (n = 5335, sớm nhất 0.1 giờ). Số âm nghĩa là ta thấy trước ngày công bố.

24
Intent-Aware Protection for AI Agents
📄 Paper arXiv cs.CR 3 ngày trước

arXiv:2611.16122v1 Announce Type: new Abstract: AI agents increasingly access enterprise data, invoke powerful tools, and act with limited human oversight. Existing security defenses primarily detect prompt injection, harmful outputs, or suspicious behavior, but do not determine…

🅲 hạng C
24
Tractable Importance Sampling for Monte Carlo Privacy Accounting
📄 Paper arXiv cs.CR 14 giờ trước

arXiv:2611.17596v1 Announce Type: new Abstract: Evaluating tight Differential Privacy (DP) parameters for DP matrix factorization with privacy amplification by sampling requires analyzing high-dimensional, correlated Gaussian mixtures. Because integrating these mixture distribut…

🅲 hạng C
24
DeCompCert: A Verified Decompiler for CompCert-Generated AArch64
📄 Paper arXiv cs.CR 14 giờ trước

arXiv:2611.18055v1 Announce Type: cross Abstract: DeCompCert is a Rocq-verified decompiler for AArch64 assembly generated by CompCert. It reconstructs CompCert C through nine reverse passes, combining deductively verified transformations with translation validation. Untrusted OC…

🅲 hạng C
23
AutoAssumption: Searching over Assumptions Discovers ML-Systems Algorithms
📄 Paper arXiv cs.AI 3 ngày trước

arXiv:2611.14844v1 Announce Type: new Abstract: Many advances in ML systems came from breaking an assumption that earlier methods took for granted: speculative decoding dropped the assumption that a model needs one forward pass per token. Yet algorithms rarely state their assump…

🅲 hạng C
21
When Should Semantic Priors Enter Partially-Identified Causal Discovery?
📄 Paper arXiv cs.AI 3 ngày trước

arXiv:2611.14736v1 Announce Type: new Abstract: Observational causal discovery often leaves causal di- rections unresolved or unstable. Large language mod- els (LLMs) can provide semantic information to resolve these directions, but incorrect proposals can exclude the true causa…

🅲 hạng C
20
Counting Under Disagreement: Dollar-Weighted Measurement, Selective Machine Labelling and Budgeted Human Review from Disagreeing AI Readers of Administrative Text
📄 Paper arXiv cs.AI 5 ngày trước

arXiv:2611.13215v1 Announce Type: new Abstract: We study AI-assisted measurement when one text label applies to many administrative records, the target is a monetary total, and the human readings that anchor the machines disagree. The testbed is 121,070 grant-purpose texts from …

🅲 hạng C
20
How wide must an eavesdropper be? Leakage of a toric-code logical bit to a strip and the Nishimori point
📄 Paper arXiv cs.CR 5 ngày trước

arXiv:2611.13174v1 Announce Type: cross Abstract: Fault-tolerant quantum computers hand pieces of each logical qubit to separate decoder modules and shared readout lines. How much does a piece reveal? We prove that for any region and any Pauli noise, including correlated noise, …

🅲 hạng C
20
Analyzing Linear Layers in Related-Differential Cryptanalysis
📄 Paper arXiv cs.CR 5 ngày trước

arXiv:2605.27535v2 Announce Type: replace Abstract: In AES-like ciphers, diffusion layers are commonly instantiated using MDS matrices, since their optimal branch number yields strong diffusion guarantees and underpins classical resistance arguments against differential and line…

🅲 hạng C
20
Governed Self-Improvement for a Local-First Security Analyzer: Baseline Measurements and a Preregistered Evaluation Protocol for Tantular Cyber
📄 Paper arXiv cs.CR 6 ngày trước

arXiv:2611.10425v1 Announce Type: new Abstract: Local-first security tools let organizations analyze code without sending it to third-party services, but the small language models they can run locally are weaker than hosted ones and are hard to improve without breaching the priv…

🅲 hạng C