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

graph data necessitates

biblio

Visible to the public Improving Privacy in Graphs Through Node Addition

Submitted by aekwall on Mon, 04/20/2020 - 10:32am
  • Privacy-Preserving Mechanism (PPM)
  • k- automorohism
  • k- isomorphism
  • Measurement
  • Metrics
  • naïve ID removal
  • node addition
  • Peer-to-peer computing
  • Predictive Metrics
  • privacy
  • privacy models and measurement
  • k- anonymity
  • privacy-preserving mechanisms
  • pubcrawl
  • Resiliency
  • Routing
  • Scalability
  • seed-based attack
  • strongest attacks
  • structural attack
  • structure-based attack
  • structure-based de-anonymization attacks
  • edge addition
  • anonymity privacy
  • anonymization and de-anonymization
  • attack graphs
  • Autonomous System (AS)level graph
  • composability
  • computer security
  • Control Theory and Privacy
  • cyber-physical systems
  • data privacy
  • degree attacks
  • Computing Theory and Privacy
  • fake edges
  • fake nodes
  • graph data
  • graph data necessitates
  • graph privacy
  • graph theory
  • Human behavior
  • Inter-domain routing
  • internet

Terms of Use  |  ©2023. CPS-VO