{'fraction_non_alphanumeric': 0.012252591894439209, 'fraction_numerical': 0.0, 'mean_word_length': 5.397590361445783, '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 lightweight protocol for privacy preserving division

Homomorphic encryption is a well established means for performing operations on encrypted data. In many real-world applications however, the need arises to perform division over integers and yield a floating point result. This cannot be performed in the encrypted domain of most homomorphic encryption schemes. Thus, one has to resort to Secure Two Party Computation which suffers from high communication costs or to a Fully Homomorphic encryption scheme which is still inefficient. In this work, we present a lightweight and flexible protocol that takes as input two homomorphically encrypted integers, privately divides them and returns the result in floating point format. Our tool is designed to support both additive and multiplicative homomorphic schemes. We measure the privacy offered using a well established privacy metric and provide timings for the operations. We evaluate our protocol on a real world application scenario conducting simulations of attacks and present our encouraging results.