Privacy-Enhancing Preferential LBS Query for Mobile Social Network Users

Algorithm 1

Trusted leader election.

Input: global trust score values stored at the server, list of users in the area, public encryption key generated using the Paillier system;

Output: Leader;

1: ;

2: Leader;

3: fordo

4:  Compute for user ‘i’ based on its computation power and the trust score;

5:  ;

6:  PE SMIN(PE,CE)

7:  if PE == CE then

8:   Leader;

9:  end if

10: end for

11: At the server: : Compute (Leader) to get the leader;

12: Server informs all the users in the area about the leader’

13: return;