Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

low complexity dummy location selection scheme

biblio

Visible to the public Dummy Location Selection Scheme for K-Anonymity in Location Based Services

Submitted by grigby1 on Mon, 04/02/2018 - 12:31pm
  • mobile computing
  • Servers
  • security of data
  • Security analysis
  • security
  • Resiliency
  • resilience
  • query processing
  • query probability
  • pubcrawl
  • probability
  • privacy concerns
  • privacy
  • optimization
  • optimisation
  • multiobjective optimization problem
  • anonymity
  • Metrics
  • low complexity dummy location selection scheme
  • location based services
  • localization information
  • LBS
  • k-anonymity
  • K-1 dummy locations
  • Human behavior
  • Geometry
  • dummy location
  • data privacy
  • composability
  • Complexity theory
  • cloaking area based algorithm
  • Artificial Intelligence

Terms of Use  |  ©2023. CPS-VO