{'fraction_non_alphanumeric': 0.015254237288135594, 'fraction_numerical': 0.011864406779661017, 'mean_word_length': 4.628571428571429, '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}}
Randomness in Cryptography January 21 , 2013 Lecture 7 : Privacy ⇒ Extraction Continued

These steps will be useful when we consider other privacy primitives. We can use this proof as a blueprint with other primitives, as long as they have similar properties we can use in the security and correctness steps. The main question we will answer today is: to what extent can we generalize this result from encryption to other privacy primitives? We will also explore the limits of this proof and show that it is possible to have encryption on a small number of bits without implying extraction.