{'fraction_non_alphanumeric': 0.012789768185451638, 'fraction_numerical': 0.0031974420463629096, 'mean_word_length': 5.520833333333333, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Zero false positive 2-secure fingerprinting watermarking based on combining hamming distance conditions and parent pair search

Digital transaction watermarking today is a widely accepted mechanism in multimedia security. Here, copies of one work are distributed with individual markings. One major threat on transaction watermarking are collusion attacks. Here multiple individualized copies of the work are mixed in order to create a counterfeited or undetectable watermark.
 One common countermeasure is the usage of so-called fingerprint codes. The important challenge is to provide fingerprints which are highly secure, reliable and, at the same time, provide a sufficiently compact code length according to the typical payload limitations of common watermarking algorithms.
 We present an approach that is collusion-secure against two colluders based on special conditions on the Hamming distances between the user fingerprint. Theoretical and empirical analysis shows that our approach provides the false positive rate to be zero although the false negatives remain similar to other approaches in the literature. The respective code length remains smaller than 100 bit such that our approach is applicable in transaction watermarking scenarios.