{'fraction_non_alphanumeric': 0.014130434782608696, 'fraction_numerical': 0.0, 'mean_word_length': 6.251968503937008, '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}}
On the Communication Complexity of Privacy-Preserving Information Sharing Protocols

We address issues related to privacy protection in distributed information sharing systems where multiple autonomous entities share data across their private databases. Most existing solutions place restrictions on adversarial behavior in order to enable communication-efficient privacy-preserving information sharing. These restrictions substantially underestimate the capabilities of adversaries in reality, and do not always suffice for real systems. We consider a threat space containing more powerful adversaries, including not only semi-honest but also malicious ones, and analyze the tradeoff between privacy protection and communication complexity in information sharing. In particular, we use Kolmogorov complexity to derive lower bounds on the communication complexity required to defend against various kinds of adversaries.