RBLPPA Algorithm: Efficient Location-Based Service with Re-Encryption

The processing of integrating three main algorithms shows that the time complexity of the RBLPPA algorithm in terms of algorithm execution is \, and the overall execution time depends on the execution time of the encryption algorithm. In the re-encryption algorithm, the key generation phase can be calculated simultaneously offline by the user and the LBS server, and the central server does not perform any decryption operations during the processing. Instead, it uses the LBS server or the user's provided public key to re-encrypt the obtained encrypted data. All time consumption occurs in the re-encryption process. This process does not require finding cooperating users within a certain range, nor does it require extensive exponential calculations like homomorphic encryption algorithms. Additionally, the encryption keys used can be adjusted in length according to the timeliness of the feedback service required by the user, improving computational efficiency. Therefore, based on the above analysis, it can be concluded that the RBLPPA algorithm can guarantee the efficiency of location-based services.