New Attribute-Based Encryption Schemes with Anonymous Authentication and Time Limitation on Fog computing

Abstract

Fog computing faces threats that pose security and privacy challenges to users. Despite the many advantages that cloud computing has, it has many disadvantages and problems that can be partially covered by applying fog computing and its advantages such as increasing security and reducing bandwidth, and reducing network latency. Using the various advantages and features of fog computing, fog computing can be considered a suitable platform for IoT applications and services. Despite all of the above, fog calculations face security issues, threats, and privacy challenges. In this paper, we proposed two new schemes on ABE schemes. New schemes called CP-ABE-AA and KP-ABE-AA are based on CP-ABE and KP-ABE. New schemes have more secure steps and anonymous timed communications. In the communication stage, the server and the user each apply for registration to the RC separately. This request can be at any time and in general. On these schemes, we have more secured communication with timed and anonymous knowing between servers and users. the two schemes are faster than all schemes in key generation, encryption, and decryption in ABE types. CP-ABE-AA in comparison to 5 schemes average for key generation shows less time (5.48%) but in encryption shows more time, 11.28%, at last in decryption again shows less time, 11.33%. Also, KP-ABE-AA in comparison to 2 other schemes average for key generation shows more time (17.31%) but encryption and decryption show fewer times, 17.31% and 9.57%. so, we can say these new schemes are almost fast in some areas and they are more secure too.