{'fraction_non_alphanumeric': 0.02702702702702703, 'fraction_numerical': 0.0, 'mean_word_length': 5.591623036649215, '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}}
An Efficient Private Set Intersection Protocol for the Cloud Computing Environments

Private set intersection (PSI) is a hot topic in cryptography and has a wide range of applications such as privacy preserving personal properties matching and data mining. Many PSI protocols have been presented, which discussed the efficiency and formal security. However, there are few PSI protocols for the cloud computing environments, where the cloud server offers effective computations and storage capabilities to clients and performs the PSI computations for clients. In this paper, we propose an efficient PSI protocol for the cloud computing environments, which is based on homomorphic encryption, pseudorandom function, set polynomial representation, and point-value form of polynomials. Our PSI protocol enjoys the following advantages: (a) our protocol gives a natural secure data storage; (b) normal channels are suitable to our protocol; (c) the communication and computation complexity are linear to the dataset size; (d) our protocol provides a formal detailed simulated-based security proof; (e) our protocol is a scalable protocol that could be extended to multiple clients conveniently, and a formal simulated-based security proof is provided in details.