- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes TempoMark, a generative audio watermarking method based on temporal structure. The core idea allocates each watermark bit to an independent time slice, spreads information across multiple chips via spread-spectrum coding, injects the watermark during the intermediate denoising stages of diffusion models, and recovers the message using matched filtering, avoiding the inter-bit interference common in traditional generative watermarking. The authors conducted experiments across DiffWave, PriorGrad, and four speech datasets, achieving a watermark recovery accuracy of 98%–100% while maintaining high accuracy under various audio perturbations and neural denoising attacks.
Critical strengths
-
The proposed method is straightforward to understand and easy to implement.
-
Across four datasets and two diffusion models, the bit recovery accuracy reaches 98%–100% while maintaining high robustness under various signal-processing and neural denoising attacks.
-
The authors evaluated the individual contributions of temporal structure, chip alignment, the decoder, and the injection mechanism, showing that temporal structure and matched decoding are the primary drivers of performance improvement.
Critical weaknesses
-
Appendix Table 6 shows that a mere 10 ms time shift drops the WSR from nearly 100% to roughly 50%. This poses a severe practical limitation and undermines the paper's claims of robustness.
-
I suggest that this paper should apply the same temporal spread-spectrum encoding and matched filtering to a post-hoc watermarking baseline and compare it with generative injection, to disentangle whether the performance gains stem from temporal coding or from in-process generative injection.
-
This paper primarily evaluates bit-level WSR rather than full payload recovery or end-to-end provenance verification. Furthermore, the empirical evidence is insufficient to demonstrate robustness against time-shifting, clipping, and adaptive watermark removal attacks.
Questions for authors
-
Appendix Table 6 shows that a about 10 ms time shift drops the watermark recovery accuracy from nearly 100% to roughly 50%. How can the watermark be recovered if the audio is being cropped, spliced, or has unknown temporal offsets? Could this issue be addressed by searching over candidate time shifts?
-
Both spread-spectrum encoding and matched filtering are textbook techniques in classical communications. Compared to traditional spread-spectrum watermarking, what is the technical novelty here? Could you include a traditional post-hoc watermarking baseline using the same encoding and decoding scheme?
-
It is unclear whether the improvements stem from temporal coding or in-process diffusion injection. Can the authors test a post-hoc variant where the same watermark signal is added directly to the generated audio and evaluate it? Such an ablation would directly show whether generative injection is truly needed.
-
The paper mainly reports bit-level WSR, but real-world provenance or copyright verification usually requires recovering the entire payload intact. Could you also report the full message recovery rate? If an attacker knows the watermarking method but not the secret key, can they remove the watermark using targeted audio processing?
5 comments
Dear Reviewer PD9C:
Thanks for your effort in reviewing our work. As the rebuttal period is nearing the end, please let us know if there are any further concerns or questions. Should there be any outstanding issues or further inquiries, we are eager to address them during the remaining time of the discussion period. If you are satisfied with the clarifications provided in our previous communications, we kindly request you to consider updating your score to reflect the newly added results and discussion, in particular the shift and cropping experiments, the extended payload-recovery results, the ablation against a same-code post-hoc baseline with a cross-clip collusion attack, and the alignment discussion.
Your time and effort are greatly appreciated.
Sincerely,
Authors of Submission 2488
Dear Authors,
I thank the authors for the detailed response. However, I still have several concerns.
(1) Under the independence relation (EPR ≈ WSR^L), the lag-searched WSR of 0.94–0.97 at ±10/20 ms implies an EPR of roughly 2–14% at 64 bits, and a 10% middle cut leaves essentially no clip fully recoverable. The search range, its cost, larger offsets, and its effect on the false-positive rate are not reported.
(2) The key-unaware attack considered (nulling part of each slot) is weak. An attacker who knows the grid can simply desynchronize the signal by small shifts, sample insertions or deletions, or a slight rate change, which is the method’s main weakness and is not evaluated.
Thus, I plan to maintain my original score.
Shift, cropping, and post-hoc comparison
We thank the reviewer for the constructive suggestions. The revision sets out the alignment precondition and the offset estimate in Sec. 5, reports EPR alongside WSR, adds cropping and splicing, and states in the Table 10 caption what it is a negative control for.
Q1&W1: 10 ms shift, cropping or unknown offsets.
Yes, and Discussion and Limitations sets out this precondition with the offset estimate. Despreading applies the chip signs at absolute positions, so a shift beyond one chip applies the wrong signs, which Table 10 is the negative control for, while the operators in Table 5 do not displace the signal. Estimating the lag restores the payload:
λQ2&W2: Technical novelty and post-hoc baseline.
Spreading and matched filtering are the vehicle, not the contribution. Our finding is that the correspondence between payload bits and time slots governs decoding accuracy, which prior work did not treat as a design variable: structure without alignment sits at chance (0.50), alignment without structure at chance (0.52), and only aligned structure recovers (1.00). The contribution realises that correspondence through chip-aligned injection, a slot partition giving per-bit readout and known erasures, and matched hybrid decoding with the lag estimated. Each element matters:
w/o CHIP(global remap)w/o TSS(no structure)Q3&W3.1: Temporal coding or in-process injection.
Decoding accuracy comes from the temporal coding, since removing or misaligning the structure drops WSR to chance (Q2). In-process injection is not needed for accuracy, and the same code added to finished audio is no worse under classical distortions or denoisers; it matters under cross-clip collusion, where the additive mark falls to chance and ours keeps 0.73. The
w/o INJrow of Table 6 setsinjection_mode = latent_init, so it isolates mid-trajectory re-injection rather than in-process placement.Q4&W3.2: Full payload recovery, and key-unaware removal.
We keep WSR (Eq. 10) and add EPR, the fraction of clips whose whole payload is recovered (released 64-bit checkpoint, 50 clips):