ZK-Trace: Certified Collusion Tracing with Zero-Knowledge Credentials for Federated GNSS Interference Monitoring

• URL: http://arxiv.org/abs/2609.08763v1
• Date: Tue, 08 Sep 2026 14:00:29 GMT
• Title: ZK-Trace: Certified Collusion Tracing with Zero-Knowledge Credentials for Federated GNSS Interference Monitoring
• Abstract summary: ZK-Trace combines public identity marks, recipient-specific Tardos fingerprints, and zero-knowledge credential verification.<n> registry supports offline tracing without the leaker's cooperation.
• Score: 2.611390035495907
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Federated global navigation satellite system (GNSS) monitoring distributes a proprietary classifier to partly trusted stations, any of which may leak its copy. ZK-Trace combines public identity marks, recipient-specific Tardos fingerprints, and zero-knowledge credential verification. The registry supports offline tracing without the leaker's cooperation. We establish conditional false-accusation bounds for arbitrary recovered bit patterns, a finite completeness bound under a hidden-bias residual channel, and a deterministic tracing-score bound for correlated feature-distillation errors. An interval-arithmetic checker makes the conditional bound executable and allocates a common budget across accusation and tamper decisions. Under innocent-row independence, the certificate-based evaluation uses a false-naming budget of 0.001 per investigation. It isolates all 160 single-owner copies and traces 712 of 720 two-owner mixtures without naming an innocent. Experiments use a simulated GNSS federation and CIFAR-10. Feature matching preserves the feature mark in 20/20 runs and cross-architecture transfer in 19/20, at copy-accuracy costs of 4.8 and 6.1 percentage points on GNSS and CIFAR-10. Function-only distillation erases the feature mark, and distillation also removes weight-space marks. These results support verifiable tracing under explicit statistical and cryptographic assumptions. Credential knowledge and recipient evidence serve distinct roles.

Related papers

• SoK: Where Do Flow Labels Come From? Auditing Label Provenance in Encrypted Traffic Benchmarks [5.044786941116112]
  Encrypted traffic classification infers semantics beyond the flow record from transport-layer observables.<n>Recent systematizations scrutinize model in- puts and data splits; we systematize the complementary label side.<n>Across 14 benchmark entries, we identify two recurring label-side strategies.
  arXiv  Detail & Related papers  (2026-09-02T05:51:42Z)
• CUSTOS: Toward Forensic-Ready Zero Trust at the Capture-Containment Boundary [1.1458853556386797]
  CUSTOS is a forensic-ready ZT reference architecture centered on a Forensic Management Point (FMP)<n>An always-on decision record is captured and hash-chained on the gateway at a 1.9-3.0% throughput cost.<n>Results show that forensic-ready ZT requires both an always-on evidentiary floor and bounded reactive capture.
  arXiv  Detail & Related papers  (2026-08-17T19:17:15Z)
• Level, Sharpness, and Corpus: Why Zero-Shot OOD Detector Rankings Do Not Transfer [36.02174685737611]
  We find that detector rankings reverse across deployments, every detector exceeds $80%$ FPR95 on at least one domain, and the preferred detector depends on both the in-distribution data and the underlying VLM.<n>We introduce the Complementary Evidence Guard (CEG), a detector-agnostic wrapper that preserves complementary evidence through a non-compensatory fusion of the base detector, level, and sharpness.
  arXiv  Detail & Related papers  (2026-07-29T08:00:49Z)
• Looping Is Not Reliability: State-Bound Evidence and Typed Revision Contracts for Agentic Code Repair [36.56438114281786]
  We study the gap between finding a correct patch and retaining, verifying, and submitting it.<n>We derive an evidence-bound typed loop contract and instantiate its mechanically enforceable subset in a reference implementation.
  arXiv  Detail & Related papers  (2026-07-27T16:05:23Z)
• TRACE-CTI: Auditable Post-Extraction Governance of TTP Claims with Knowledge Graphs [4.960649631468518]
  TRACE-CTI is a post-extraction claim-governance framework.<n>It aggregates run-level Predictions into configuration-level GraphAssertions.<n>It materializes setup-deduplicated corroboration as ConsensusAssertions.
  arXiv  Detail & Related papers  (2026-07-27T15:33:18Z)
• Consistent Evidence, Robust Recognition: Faithful Attribution Regularization under Geometric Transformations [42.90321348046055]
  We propose an annotation-free attribution regularization framework based on submodular search over image regions.<n>By measuring how candidate subsets affect model outputs, the search extracts compact, class-discriminative evidence as search-derived supervision.<n> Experiments on ImageNet-100 show that our method substantially improves attribution stability, Insertion, and Deletion on ViT-B/16 with only a 0.28-point accuracy drop.
  arXiv  Detail & Related papers  (2026-07-26T20:41:38Z)
• Fantastic Adaptive Taxonomies and How to Use Them [100.20614173157708]
  AdaMAST converts execution traces into a compact, evidence-grounded failure taxonomy.<n>No code is hand-authored, no trace human-annotated.<n>In agent-system search, taxonomy-coded diagnoses of failed candidates outperform free-form.
  arXiv  Detail & Related papers  (2026-07-17T17:41:16Z)
• Beyond Logprobs: A Multi-Signal Confidence Engine for LLM-Based Document Field Extraction [2.1997815944423516]
  ExtractConf is a cross-domain, field-agnostic confidence engine.<n>It grounds confidence estimation in two structurally different readings of the same document.<n>It achieves 0.928 ROC AUC and reduces selective prediction risk by 70% over logprob-mean.
  arXiv  Detail & Related papers  (2026-06-23T10:58:08Z)
• SentinelRAG: Synthetic Sentinel Knowledge for RAG Database Copyright Protection [44.7327467106684]
  SentinelRAG embeds style-consistent but fictitious knowledge entries into the RAG database.<n>Our key insight is that synthetic knowledge describing fictitious entities is unlikely to be retrieved by legitimate queries.<n>Our method significantly reduces the false detection rate while maintaining negligible interference with legitimate user queries.
  arXiv  Detail & Related papers  (2026-06-04T07:19:56Z)
• Distributional Energy-Based Models for Uncertainty-Aware Structured LLM Reasoning [40.342912574072024]
  Large Language Models produce structured outputs such as travel plans or code solutions.<n>Individual reasoning steps may appear correct while the output as a whole violates budgets, fails test cases, or contradicts earlier deductions.<n>We propose a learned quality scorer with deterministic analytical constraint penalties for verifying structured LLM outputs.
  arXiv  Detail & Related papers  (2026-05-15T17:08:27Z)
• Beyond Code Reasoning: Specification-Anchored Auditing of Multi-Implementation Distributed Protocols [1.5229705287183657]
  SPECA is an audit framework that derives explicit, categorized security properties from natural-language specifications and reuses them across implementations.<n>On the RepoAudit benchmark, SPECA reaches 88.9% precision at 100% recall (F1=0.94) and surfaces 12 author-validated bugs beyond ground truth.<n>On the Sherlock Fusaka Audit Contest (10 targets, 366 submissions), SPECA recovers all 15 vulnerabilities expert-augmented and surfaces 4 fix-confirmed bugs.
  arXiv  Detail & Related papers  (2026-04-29T09:57:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.