{'fraction_non_alphanumeric': 0.019880715705765408, 'fraction_numerical': 0.0, 'mean_word_length': 4.721590909090909, '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}}
Decryptable Public Key Encryption with Keyword Search Schemes

A public key encryption with keyword search (PEKS) scheme does not allow the user to decrypt the encrypted keyword or decrypt the encrypted massage. This "no-decryption" property also limits the applicability of a PEKS scheme. Fuhr and Paillier also left an open problem on how to come up with a decryptable PEKS which security does not rely on random oracles. In this paper, we first enhance the security model of searchable encryption with decryption scheme (PEKSD) by allowing the test query, and present an efficient PEKSD scheme in the enhanced model without random oracle. And then, we extend our scheme to obtain PEKSD with independent decryption key and trapdoor derivation key. Finally, we also modify our scheme to achieve a PKE/PEKS scheme in which it allows to retrieve both the PEKS keyword and the message. To the best of our knowledge, this is the first PEKS scheme that allows to retrieve both the PEKS keyword and the message.