Biblio

As the China government already putting forward the strategic objectives to peak carbon dioxide emissions before 2030 and achieve carbon neutrality before 2060, social consensus of green low carbon has promoted the development of integrated energy services. As an emerging format, integrated energy services break the trade and technical barriers between different varieties of energy. As a carrier of integrated energy services, integrated energy service companies still have many problems in their own optimized operation. This paper studies the risk mechanism of energy chain considering the risk preference of energy service companies, and analyses the correlation between the risk preference of energy service companies and the risk of energy chain. Based on set pair theory and interval number, the paper establishes an energy chain risk assessment model to overcome the shortcomings of traditional evaluation methods, which is able to characterize risk appetite and uncertainties. Finally, the results of simulation and tests verify the effectiveness of the proposed method of the novel.

In the cloud computing environment, a growing number of users share their own data files through cloud storage. However, there will be some security and privacy problems due to the reason that the cloud is not completely trusted, so it needs to be resolved by access control. Attribute-based encryption (ABE) and searchable encryption (SE) can solve fine-grained access control. At present, researchers combine the two to propose an attribute-based searchable encryption scheme and achieved remarkable results. Nevertheless, most of existing attribute-based searchable encryption schemes cannot resist online/offline keyword guessing attack. To solve the problem, we present an attribute-based (CP-ABE) searchable encryption scheme that supports trapdoor updating (CSES-TU). In this scheme, the data owner can formulate an access strategy for the encrypted data. Only the attributes of the data user are matched with the strategy can the effective trapdoor be generated and the ciphertext be searched, and that this scheme will update trapdoors at the same time. Even if the keywords are the same, new trapdoors will be generated every time when the keyword is searched, thus minimizing the damage caused by online/offline keyword guessing attack. Finally, the performance of the scheme is analyzed, and the proof of correctness and security are given at the same time.