Privacy-Preserving Public Route Planning Based on Passenger Capacity

Precise route planning needs huge amounts of trajectory data recorded in multimedia devices. The data, including each user’s location privacy, are stored as cipher text. ability to plan routes on an encrypted database is urgent necessity. In this paper, order a public while protecting we design hybrid random bloom filter (RBF) tree databases, named the (eRBF) tree, which supports pruning and secure, fast k nearest neighbor search. Based secure computation distance, first propose reverse search databases (RkNNToE). It returns all transitions, takes query one its trajectories database. results can be indicator new route’s capacity planning. security proven via simulation proof technique. When number points transition 1174 18,670, respectively, time cost R2NNToE about 1200 s.