A spatial cloaking framework based on range search for nearest neighbor search

Add to your list(s) Download to your calendar using vCal

• Hyoungschick Kim, University of Cambridge
• Friday 18 September 2009, 16:00-16:30
• Computer Laboratory, William Gates Building, Room FW11.

If you have a question about this talk, please contact Joseph Bonneau.

For nearest neighbor search, a user queries a server for nearby points of interest (POIs) with his/her location information. Our aim is to protect the user’s sensitive information against adversaries including the location-based service itself. Most research efforts have elaborated on reasonable trade-offs between privacy and utility. We propose a framework based on range search query without a trusted middleware. We design a query processing algorithm for the minimum set of candidate POIs by computing the local Voronoi diagram relevant to the cloaked region. Contrary to common belief that cloaking approaches using range search incur expensive processing and communication cost, experimental results show that the framework incurs reasonable processing and communication overhead even for large cloaked regions.

This talk is part of the Computer Laboratory Security Group meeting presentations series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Security Group meeting presentations
• Computer Laboratory, William Gates Building, Room FW11
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Security-related talks
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.