{'fraction_non_alphanumeric': 0.026836158192090395, 'fraction_numerical': 0.0, 'mean_word_length': 4.717741935483871, '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 general secure sum protocol

Secure Multiparty Computation - SMC is one of two main methods for building Privacy - Preserving Data Mining - PPDM. Among SMC techniques, Secure Sum Protocol - SSP is the most basic one. For SMC solutions in general and SSPs in particular, the problem of optimizing three parameters: accuracy, performance, and privacy still poses many challenges for researchers. However, most of the SSP solutions proposed in the past have poor performance or can not preserve privacy. In this paper, I present a new SSP solution that more effectively balances the two above parameters. Besides, in this paper, I build a general mathematical constraint model between performance and privacy.