{'fraction_non_alphanumeric': 0.012027491408934709, 'fraction_numerical': 0.0, 'mean_word_length': 5.010309278350515, '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}}
A novel collusion attack on finite alphabet digital fingerprinting systems

To be considered for an IEEE Jack Keil Wolf ISIT Student Paper Award. This paper proposes a novel, non-linear collusion attack on digital fingerprints from a finite alphabet. We analyze the error probability of this attack for some classes of proposed random and deterministic schemes. We then obtain a threshold on the number of colluders necessary to correctly estimate the host signal. Our simulation results show that our attack is more powerful in practice than predicted by the theoretical threshold.