| Summary: | 碩士 === 國立臺灣科技大學 === 資訊工程系 === 99 === In recent years, the research of privacy protection for spatial query is getting more and more important. No matter snap shot query or continuous query, both of them have request on privacy protection. Since the privacy protection under continuous query has its own difficulty to breakthrough recently, few studies are proposed in this certain area. Besides, most of studies are not focused on the real situation as network constrained model, but rather on random way point model. This thesis proposes a new path privacy based on network constrained model environment as the extension of location privacy under continuous query, and also presents a new type of privacy requirement, named M-cut. We hope every CSR can manipulate these m paths to confuse adversaries to prevent a segment or a route from being linked to a specific user, or inferring some segment that the user will pass through. This thesis proposes two methods to create CSR, one is so-called random way, another is junction sharing. The former focus on random selection on CSR creation, the latter can cut down the transporting cost of the server.
|
|---|
