{'fraction_non_alphanumeric': 0.014672686230248307, 'fraction_numerical': 0.0, 'mean_word_length': 5.427536231884058, '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}}
Public key watermarking by eigenvectors of linear transforms

Digital watermarks are signals embedded in multimedia data to allow copyright enforcement. In most watermarking schemes the embedded signal must be known for watermark detection, which leads to severe security risks. Van Schyndel et al. proposed a public watermark detection principle that works without explicit reference to the embedded signal. In this paper, extensions of this scheme are considered, and the applicability in practice is investigated. The new approaches are significantly less complex than the previously proposed scheme. Further, they are more robust against attacks via exhaustive search for the embedded watermark and against attacks that intend to confuse the public watermark detector. However, one drawback of all discussed schemes is the large signal length that is necessary for robust detection.