Asymmetric Phase Coding Video Watermarking

• URL: http://arxiv.org/abs/2608.29212v1
• Date: Sat, 29 Aug 2026 11:53:25 GMT
• Title: Asymmetric Phase Coding Video Watermarking
• Abstract summary: We present a training-free video watermark that removes the shared secret.<n>The signer embeds a complete Ed25519 signature into the phase spectrum of the chroma plane.<n>On 1000 uncurated real-world clips the system ships a verifying signature for 99.3% of the corpus and accepts a wrong public key zero times in 1000 attempts.
• Score: 4.564848621539382
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Existing video watermarking systems are symmetric: the party that can verify a mark holds the extractor weights or generator secret and can therefore also embed one. Benchmarks confirm the consequence, reporting that white-box forgery defeats all evaluated methods. We present a training-free video watermark that removes the shared secret. The signer embeds a complete Ed25519 signature into the phase spectrum of the chroma plane; any party holding the 32-byte public key and public per-video metadata verifies offline, with no model, no registry, and no network. The payload, 1024 bits of signed message with error correction, is an order of magnitude above common learned payloads and is carried by three design elements: a run-length temporal layout whose decoder identifies payload groups by correlation and never reads a frame index, a payload-free search that recovers scale, rotation, and translation from the carrier itself, and a closed-loop signing procedure that selects each video's embedding strength by self-verification through the unchanged public verifier. On 1000 uncurated real-world clips the system ships a verifying signature for 99.3% of the corpus and accepts a wrong public key zero times in 1000 attempts. An attack-aware acceptance gate yields embeddings that survive H.264 re-encoding at 100% and 50% rescaling at 97.4% on gated clips. The signature also verifies through a real display and capture loop, an axis absent from published evaluations.

Related papers

• TrajMark: Ownership Attribution and Segment-Level Tamper Localization for Coding-Agent Trajectories [6.234219482022044]
  TrajMark is a training-free, symmetric-key, visible-only trajectory watermarking framework.<n>It separates robust ownership attribution from fragile local integrity verification.<n>It recovers the exact owner in all evaluated clean full-watermark batches.
  arXiv  Detail & Related papers  (2026-09-09T16:33:02Z)
• Watermarks Without Verification: AI Text Watermarking After the EU AI Act [49.51124343181601]
  Article 50 of the EU AI Act requires generative AI providers to mark the content their systems produce and ensure it can be detected as AI-generated.<n>Anthropic disclosed that every Claude model released after that date embeds a watermark based on SynthID-Text in all generated text, enabled by default with no user opt-out.<n>We argue that neither the objections nor the assurances can currently be verified and that this unverifiability, rather than watermarking itself, is the substantive governance failure.
  arXiv  Detail & Related papers  (2026-09-09T01:56:17Z)
• VeriPhy: Agentic Physical Reasoning for World Model Evaluation and Refinement [57.86962208273888]
  We present an auditable physical-verification system in which a text-only planner compiles the prompt into typed physical obligations.<n>Each action returns a provenance-carrying evidence record whose payload, when usable, is either a typed measurement or an explicitly tagged learned state.<n>We anchor evaluation in a 1,500-clip corpus of human-annotated flaw records that localize real generation failures in prompt reference, space, and time.
  arXiv  Detail & Related papers  (2026-09-02T20:36:45Z)
• A Reproducibility Protocol for Cross-Implementation Evaluation of Post-Quantum ACVP Test Vectors [0.0]
  This study defines a product-neutral protocol for three public implementations of NIST ML-KEM.<n> Protocol v2 freezes provider-specific capabilities, applies one validation-error symmetrically, preserves every selected case, and separates bytes, validation verdicts, unsupported operations, and adapter errors.
  arXiv  Detail & Related papers  (2026-08-13T21:29:59Z)
• Tracing Provenance and Detecting Tampering with Complementary LLM Watermarks [68.64050157343334]
  Existing watermarks preserve provenance under editing, but this same robustness allows an adversary to alter critical content while retaining attribution.<n>We introduce an innovative watermark that jointly provides provenance and tamper evidence.<n>The signals share the same mechanism but use independent keys and different seeding windows over normalized text, making one resilient to edits and the other sensitive to reader-visible changes.
  arXiv  Detail & Related papers  (2026-08-13T01:55:16Z)
• DHMark: Public-Key Watermarking for LLM-Generated Text via Diffie-Hellman-Guided Rejection Sampling [3.785115615093019]
  DHMark is a public-key watermarking framework for large language model (LLM) generated text.<n>During generation, a Diffie-Hellman-guided token-labeling interface assigns each candidate token a public equation vote.<n>Third-party verifiers use public information to extract token votes, aggregate them into equation-level evidence, and score only signed registry records.
  arXiv  Detail & Related papers  (2026-08-04T04:08:40Z)
• Explaining AI-Image Detection: What the Heatmap Actually Shows [65.01025489527173]
  We build a detector and attach an attribution map as its evidence.<n>We measure what that pair delivers on 186,527 images under controls.<n>Whether an attribution ranking exists at all depends on whether the detector reacts to the image.
  arXiv  Detail & Related papers  (2026-07-31T16:07:05Z)
• 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)
• Multi-Channel Spread-Spectrum Code Watermarking [10.27405810850982]
  We present multi-channel spread-spectrum watermarking with a 24-bit payload and formal robustness guarantees.<n>Across 1,750 Python files from CodeNet and from GPT-4.1 and Llama-4 generations, the watermark achieves 100% clean-detection accuracy with zero false positives.
  arXiv  Detail & Related papers  (2026-07-07T08:50:19Z)
• BitC-3DGS: High-Capacity 3D Gaussian Splatting Watermarking via Bit Compression [68.33622936663876]
  High-capacity watermarking is necessary for 3D Gaussian Splatting (3DGS) assets to embed rich information.<n>Existing bit-to-token watermarking methods are limited to 77-bit messages due to CLIP's fixed 77-token context length.<n>We introduce BitC-3DGS, a bit-compression framework that encodes multiple message bits per token.
  arXiv  Detail & Related papers  (2026-05-28T08:28:04Z)
• An Application-Layer Multi-Modal Covert-Channel Reference Monitor for LLM Agent Egress [0.0]
  A large language model (LLM) agent that sends messages can leak data inside them.<n>A compromised agent encodes bits in zero-width characters, homoglyphs, whitespace, base64, JavaScript Object Notation (JSON) key ordering, message timing or size.<n>Our egress reference monitor has three contributions.
  arXiv  Detail & Related papers  (2026-05-20T05:39:29Z)
• Authenticated Contradictions from Desynchronized Provenance and Watermarking [48.47756819432157]
  This work formalizes and empirically demonstrates the $textitIntegrity Clash$, a condition in which a digital asset carries a cryptographically valid C2PA manifest asserting human authorship.<n>We propose a cross-layer audit protocol that jointly evaluates provenance metadata and watermark detection status, achieving 100% classification accuracy across 3,500 test images.
  arXiv  Detail & Related papers  (2026-03-02T20:42:12Z)
• MerkleSpeech: Public-Key Verifiable, Chunk-Localised Speech Provenance via Perceptual Fingerprints and Merkle Commitments [0.0]
  We propose MerkleSpeech, a system for public-key verifiable, chunk-localised speech provenance.<n>The system computes perceptual fingerprints over short speech chunks, commits them in a Merkle tree whose root is signed with an issuer key.<n>We present experiments targeting very low false positive rates under resampling, bandpass filtering, and additive noise.
  arXiv  Detail & Related papers  (2026-02-10T11:58:19Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)

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.