How nituyadav0109/privacy-preserving-graph-storage works
This is a minimal privacy-preserving graph library with an interactive demo: users provide node IDs, the graph anonymizes identities and stores relationships internally, and the public API exposes degree and aggregate analytics rather than neighbor or path access. The graph implementation delegates anonymization to PrivacyEncoder; AnalyticsService computes average degree from the implementation’s internal snapshot. The README documents the privacy boundary and intentionally excluded operations; the map reflects the shown runtime code, not tests or build tooling.
Main entry points: PrivacyPreservingGraph.java Privacy graph · Demo.java Interactive demo · AnalyticsService.java Average degree · Graph.java Degree interface
Components 6
Graph API
- Interactive demo
src/main/java/org/core/Demo.java - Degree interface
src/main/java/org/core/Graph.java
Private Graph
- Privacy graph
src/main/java/org/core/PrivacyPreservingGraph.java - Identity encoder
src/main/java/org/core/PrivacyEncoder.java
Safe Analytics
- Average degree
src/main/java/org/core/AnalyticsService.java
Other components
- Demo user
Connections 6
- Demo user → Interactive demo: queries
src/main/java/org/core/Demo.java - Interactive demo → Privacy graph: creates and queries
src/main/java/org/core/Demo.java - Privacy graph → Degree interface: implements
src/main/java/org/core/PrivacyPreservingGraph.java - Privacy graph → Identity encoder: anonymizes IDs
src/main/java/org/core/PrivacyPreservingGraph.java - Interactive demo → Average degree: requests average
src/main/java/org/core/Demo.java - Average degree → Privacy graph: reads snapshot
src/main/java/org/core/AnalyticsService.java