<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Adversarial Embedding: A robust and elusive Steganography and Watermarking technique · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1912.01487/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1912.01487/feed.xml" rel="self" type="application/rss+xml" /><item><title>Adversarial Embedding: A robust and elusive Steganography and Watermarking technique — mentioned by IncRnd</title><link>https://news.ycombinator.com/item?id=28229618</link><guid isPermaLink="false">urn:hackerpapers:mention:1912.01487:28229618</guid><pubDate>Thu, 19 Aug 2021 02:19:57 GMT</pubDate><description>&lt;p&gt;Nicely done. Thank you for sharing. I&amp;#x27;d like to share the following paper for anyone else who may be interested. It is about watermarking rather than a preimage attack. &amp;quot;Adversarial Embedding: A robust and elusive Steganography and Watermarking technique&amp;quot; https://arxiv.org/abs/1912.01487 Unfortunately, the existence of invisible watermarking demonstrates a separate attack on the hash. Instead of a preimage attack, this might be able to change the hash of an image that is suspected of already being a match. A true-positive would be changed into a false-negative.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1912.01487/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item></channel></rss>
