{'fraction_non_alphanumeric': 0.022128556375131718, 'fraction_numerical': 0.0, 'mean_word_length': 4.9375, '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}}
Public Key Timed-Release Searchable Encryption

This paper introduces and explores a new concept of timed-release searchable encryption (TRSE) which can be used to solve the time-sensitive cipher text retrieval problem. In this paper, we preliminarily focus on the PKTRSE which is a kind of public key TRSE. In our PKTRSE model, the sender encrypts a message so that only the intended receiver can search target cipher text containing specified keywords after a pre-set release time in the future. We begin by explaining what is PKTRSE and introducing the application scenario of PKTRSE. Then, we show the preconditions of timed-release public key encryption combining other asymmetric crypto-graphic mechanisms. Afterwards, we formalize the notion of PKTRSE and its security game model. Finally, we give two construction schemes of PKTRSE: A generic scheme and a concrete scheme which are secure under the BDH assumption in the random oracle model.