{'fraction_non_alphanumeric': 0.029469548133595286, 'fraction_numerical': 0.0, 'mean_word_length': 4.890173410404624, '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 Remote Data Possession Checking in Cloud Storage

As cloud storage can achieve the goal that getting all storage resources in a plug-and-play way, it becomes a focus of attention. It has the advantages of high scalability, ease-of-use, cost-effectiveness and simplifying infrastructure planning etc. However, because of security and reliability, cloud storage is not widely adopted. When users store their data in cloud storage, they mostly concern about whether the data is intact. This is the goal of remote data possession checking (RDPC) schemes. This paper proposes an efficient RDPC scheme. It has several advantages as follows. First, it is efficient in terms of computation and communication. Second, it allows verification without the need for the challenger to compare against the original data. Third, it uses only small challenges and responses, and users need to store only two secret keys and several random numbers. Finally, a challenge updating method is proposed based on Euler’s theorem.