Research Article
Privacy-Guarding Optimal Route Finding with Support for Semantic Search on Encrypted Graph in Cloud Computing Scenario
Input: | Output: | 1: The compound terms set is = , and the chain table set is ; The two secret key sets are = and = ; | 2: for all () do | 3: for alldo | 4: | /loc is the location of members in the index/ | 5: | 6: end for | 7: end for | 8: for all () do | 9: ifthen | 10: for alldo | 11: | 12: ; | 13: end for | 14: end if | 15: end for | 16: return |
|