cập nhật 7 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
The Power of Interaction in Locally Edge-Private Subgraph Counting
📄 Paper arXiv cs.CR 15 ngày trước

arXiv:2611.05038v1 Announce Type: cross Abstract: We study (non-induced) subgraph counting under interactive local edge differential privacy (LEDP). Given a fixed pattern graph $H$ with $k$ vertices, $\ell\ge1$ edges, and $q$ connected components, our goal is to approximately co…

🅲 hạng C
20
Quantum Advantage has Few Complexity Implications
📄 Paper arXiv cs.CR 15 ngày trước

arXiv:2611.05303v1 Announce Type: cross Abstract: We consider the complexity implications of proofs of quantumness and (quantum verifier) oblivious state preparation. We show that both of these objects can coexist with the easiness of nondeterministic computation. That is, we gi…

🅲 hạng C
20
Conformal-DP: A Density-Aware Mechanism for Differential Privacy over Riemannian Manifolds via Conformal Transformation
📄 Paper arXiv cs.CR 15 ngày trước

arXiv:2504.20941v5 Announce Type: replace Abstract: Differential Privacy (DP) is being increasingly adopted for non-Euclidean data that lie on complex, high-dimensional manifolds. Existing DP mechanisms for manifold data consider geometric properties when calibrating privacy per…

🅲 hạng C
20
Cryptanalysis of Isogeny-Based Quantum Money with Rational Points
📄 Paper arXiv cs.CR 15 ngày trước

arXiv:2508.00351v2 Announce Type: replace Abstract: Quantum money is a representative application in cryptography that utilizes quantum technology to achieve security that is unattainable with classical systems. Since the theoretical proposal by Wiesner in 1983, the most recent …

🅲 hạng C
20
Recursa: Toward Recursively Self-Improving Foundation Model Systems
📄 Paper arXiv cs.AI 15 ngày trước

arXiv:2611.04035v1 Announce Type: new Abstract: Foundation models in changing environments can encounter unfamiliar domain knowledge that their original training did not cover. However, new domains rarely provide large amounts of expert-created training data or reliable supervis…

🅲 hạng C
20
Towards Efficient Whole Page Ranking with One-Pass Inference
📄 Paper arXiv cs.AI 14 ngày trước

arXiv:2611.05542v1 Announce Type: new Abstract: Whole-page ranking jointly optimizes advertisements and organic content to balance business outcomes and user engagement under complex layout and business constraints. Existing non-autoregressive (NAR) approaches enable efficient p…

🅲 hạng C
20
Consistency Is Not Understanding: Orbit Audits for Neural Field Weight Readers
📄 Paper arXiv cs.AI 14 ngày trước

arXiv:2611.05798v1 Announce Type: new Abstract: Recognizing visual content from neural-network weights requires separating functional information from arbitrary parameter coordinates. We audit this separation with hidden-neuron permutations and positive ReLU rescalings that pres…

🅲 hạng C
20
Auditable Unlearning for LLMs
📄 Paper arXiv cs.AI 14 ngày trước

arXiv:2611.05866v1 Announce Type: new Abstract: Machine unlearning aims to remove a user's data from a trained model after a deletion request. Existing methods are majorly evaluated on three axes - how well they forget, how much capability they retain, and how robust they are to…

🅲 hạng C
20
EchoKV: Self-Corrective KV Cache Eviction via Iterative Query Feedback
📄 Paper arXiv cs.AI 14 ngày trước

arXiv:2611.05903v1 Announce Type: new Abstract: KV cache eviction is not merely a token-ranking problem: the workspace retained for generating eviction queries also determines the quality of those queries. Consequently, an early workspace error can distort later query observatio…

🅲 hạng C
20
Optimal Marginal Mixing for Transvection-Based Trapdoored Matrices over Large Fields
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.05573v1 Announce Type: new Abstract: \emph{Trapdoored matrices} are pseudorandom matrices admitting a fast matrix-vector multiplication algorithm given the secret key. We study a candidate family of such matrices: matrices generated by short random \emph{transvection …

🅲 hạng C
20
AQUA - A Modular Authentication Quality Modeling Framework
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.05660v1 Announce Type: new Abstract: Authentication solutions are the key design, architectural, and implementation decisions that implement authentication security controls. An example is a password-based authentication solution. While researchers often examine authe…

🅲 hạng C
20
A Hybrid Approach for Automated Security Pattern Recovery
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.05823v1 Announce Type: new Abstract: Security-by-design emphasises integrating security into software design and development. Security pattern catalogues operationalise this principle by prescribing reusable architectural solutions to recurring security problems. Howe…

🅲 hạng C
20
Enforcing Accountable Disclosure in Confidential AI
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.05971v1 Announce Type: new Abstract: Advances in CPU and GPU confidential computing enable confidential AI, allowing LLMs to process user prompts without exposing them to service providers or infrastructure operators. However, AI agents often need to send prompt-deriv…

🅲 hạng C
20
CoordX Protocol: Peer to Peer Cryptographically Verified Shared Records
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.06034v1 Announce Type: new Abstract: People, companies and software agents often must work on shared records even when they do not trust each other. Today they usually give those records to a central server. The server keeps the canonical copy, authenticates users, an…

🅲 hạng C
20
Reconciling Privacy with Provenance for Language Model Watermarks
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.06100v1 Announce Type: new Abstract: Watermarking has great potential for regulating the use of language models (LMs), but its deployment has been marred by controversy, as many users argue that fine-grained tracking of LM usage violates their privacy. This tension re…

🅲 hạng C
20
Beyond Identity Creation: Bilinear Sybil Cost in Identities and Time
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.06268v1 Announce Type: new Abstract: Sybil defenses price the creation of an identity, yet influence goes, again and again, to active identities. We study the cost of maintaining influence. A defense has a bilinear Sybil cost with ratio $A$ if keeping $s$ identities a…

🅲 hạng C
20
Clear Human Web: Where a Person Vouches for Every Client
📄 Paper arXiv cs.CR 14 ngày trước

arXiv:2611.06286v1 Announce Type: new Abstract: The web cannot tell whether a request comes from a person or from a program. Sites have checked the network address and puzzles in its place, and both have given way: automated traffic exceeds human traffic, and puzzles are solved …

🅲 hạng C