cập nhật 9 phút trước

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

20
Demystifying Information Flow Downgrading using the Real--Ideal Paradigm
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.05695v1 Announce Type: cross Abstract: The real--ideal paradigm, an approach to security specification developed in the cryptography community, has the benefit that it can express sophisticated confidentiality and integrity requirements, even for decentralized systems…

🅲 hạng C
20
Trinetra.Q: Statistical and Behavioral Detection of Attacks on the Quantum-Error-Correction Layer and Classical Control Stack of Quantum Computing Systems
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.05722v1 Announce Type: cross Abstract: Most quantum-computer security work targets physical-layer attacks on qubits, while two surfaces remain inadequately defended: the quantum-error-correction (QEC) syndrome-and-decoder pipeline, and the classical control and softwa…

🅲 hạng C
20
Quantum Key Exchange from Public Quantum Money
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.05985v1 Announce Type: cross Abstract: Two-message quantum key exchange (2QKE) cannot be realized in a statistically secure way, and therefore some computational assumptions are required. So far, the known weakest assumption for 2QKE is the existence of one-way functi…

🅲 hạng C
20
Catastrophic Overfitting is Weight Drift the Training Loss Cannot See
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.06082v1 Announce Type: cross Abstract: Fast adversarial training (FAT) makes robust training affordable by replacing the multi-step attack with a single-step one, but it suffers from catastrophic overfitting (CO): partway through training, robustness to multi-step att…

🅲 hạng C
20
A Post-Quantum Interactive Hashing Theorem
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.06124v1 Announce Type: cross Abstract: Interactive hashing, introduced by Ostrovsky, Venkatesan, and Yung [OVY93], is a building block in many cryptographic protocols, including perfectly hiding commitments from one-way permutations [NOVY92]. Its multi-output generali…

🅲 hạng C
20
When Verification Is Not Agreement: Cross-Agent LLM-to-Dafny Formalization
📄 Paper arXiv cs.AI 13 ngày trước

arXiv:2611.07073v1 Announce Type: new Abstract: A verified Dafny postcondition certifies that a formula holds, but it does not guarantee that the result was reached through genuine independent reasoning. We introduce a cross-agent formalization protocol where a Specifier model t…

🅲 hạng C
20
Synthesizing symbolic models of human and machine reasoning at scale
📄 Paper arXiv cs.AI 13 ngày trước

arXiv:2611.07088v1 Announce Type: new Abstract: Symbolic models offer a powerful account of cognition, but their scope has historically been limited by the need for hand-engineering and computational tractability. We show how advances in artificial intelligence (AI) can scale sy…

🅲 hạng C
20
Graph learning-assisted logic-based Benders decomposition for distributionally robust in-station train rescheduling under disruptions
📄 Paper arXiv cs.AI 13 ngày trước

arXiv:2611.07520v1 Announce Type: new Abstract: Uncertainty in resource reopening times complicates train holding and rerouting decisions when resource closures coincide with arrival delays and processing-time extensions. We develop a rolling-horizon distributionally robust mode…

🅲 hạng C
20
Align Before Aggregation: Basis-Consistent Federated LoRA under Heterogeneous Ranks
📄 Paper arXiv cs.AI 13 ngày trước

arXiv:2611.07598v1 Announce Type: new Abstract: Federated fine-tuning of large language models (LLMs) under heterogeneous client capacities is increasingly important, and low-rank adaptation (LoRA) with heterogeneous ranks makes it practical. Existing server-side aggregators com…

🅲 hạng C
20
Towards Generalist Graph-Level Anomaly Detection
📄 Paper arXiv cs.AI 13 ngày trước

arXiv:2611.07706v1 Announce Type: new Abstract: Graph-level anomaly detection (GLAD) aims to identify graphs that deviate significantly from the majority. While recent advances have achieved competitive performance, existing approaches mainly follow a dataset-specific paradigm, …

🅲 hạng C
20
The Intrusion Pathway: How Non-Evidential Context Degrades Language Model Performance
📄 Paper arXiv cs.AI 13 ngày trước

arXiv:2611.07778v1 Announce Type: new Abstract: Language models lose accuracy when a prompt contains non-evidential context: irrelevant statements from unrelated domains, or random off-distribution tokens, with no competing answer and no semantic overlap with the query. Such noi…

🅲 hạng C
20
When Bigger Becomes Brittle: Why Compression Hurts More as Language Models Scale
📄 Paper arXiv cs.AI 13 ngày trước

arXiv:2611.07891v1 Announce Type: new Abstract: Quantization and pruning reduce the cost of deploying language models, but their effects are usually reported as benchmark scores. Such scores record only the loss that remains at the output. Inside the model, compression damages s…

🅲 hạng C
20
Beyond Proof of Possession: A Relational Theory of Authority
📄 Paper arXiv cs.CR 13 ngày trước

arXiv:2611.07159v1 Announce Type: new Abstract: Proof-of-Possession (PoP) establishes that an executor controls an artifact (key, token, credential, or capability), but such control alone determines neither the executor's relational profile nor the causal history of an execution…

🅲 hạng C
20
Global Surveillance Under the Lens: Reconstructing Passive Dolev-Yao Intruders
📄 Paper arXiv cs.CR 13 ngày trước

arXiv:2611.07170v1 Announce Type: new Abstract: Global surveillance systems record large volumes of network traffic for retrospective analysis, but packet captures alone reveal little about protocol-level semantics. This paper presents an automated, specification-guided methodol…

🅲 hạng C
20
AMORT-V1: Checkpointed Post-Quantum Attestation for Industrial Controllers
📄 Paper arXiv cs.CR 13 ngày trước

arXiv:2611.07476v1 Announce Type: new Abstract: Programmable logic controllers often remain deployed for decades, making post-quantum attestation a long-term requirement. Prior measurements of OpenPLC attestation show that post-quantum signing can consume 88--99% of round-trip l…

🅲 hạng C
20
Decision Models as Retrieval Gates Against Injection and Pollution
📄 Paper arXiv cs.CR 13 ngày trước

arXiv:2611.08325v1 Announce Type: new Abstract: Retrieved web text can carry instructions aimed at the language model, or synthetic pages written to mislead. We test whether released open-weight decision models, which answer typed questions about a text without generating tokens…

🅲 hạng C
20
LABBA: LLM-Assisted Behavioral Biometric Authentication
📄 Paper arXiv cs.CR 13 ngày trước

arXiv:2611.08343v1 Announce Type: new Abstract: Behavioral biometrics have emerged as a promising complement to traditional physiological biometrics by leveraging dynamic human characteristics. These modalities offer advantages including continuous authentication, inherent liven…

🅲 hạng C
20
Quadratic Extractors
📄 Paper arXiv cs.CR 13 ngày trước

arXiv:2611.07266v1 Announce Type: cross Abstract: A quadratic source is a random variable $X\sim\mathbb{F}_2^n$ generated by applying $n$ quadratics to a hidden uniform string. Previously, the best-known explicit extractor for this model required min-entropy roughly $k=n-\sqrt{\…

🅲 hạng C