{'fraction_non_alphanumeric': 0.008174386920980926, 'fraction_numerical': 0.0, 'mean_word_length': 4.935483870967742, '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}}
Survey on Complexity of Secure Function Evaluation

In this survey we consider the problem of quantification of the complexity of secure two-party function evaluation in terms of the number of AND black boxes used by the protocols. We specifically prove explicit lower and upper bounds on the number of ANDs required in case of deterministic and randomized protocols.