Search Results for author:
Found 2 papers, 2 papers with code
$\mathcal{E}\text{psolute}$: Efficiently Querying Databases While Providing Differential Privacy
In this work we present a model for differentially private outsourced database system and a concrete construction, $\mathcal{E}\text{psolute}$, that provably conceals the aforementioned leakages, while remaining efficient and scalable.
Cryptography and Security
NED: An Inter-Graph Node Metric Based On Edit Distance
The inter-graph node similarity is important in learning a new graph based on the knowledge of an existing graph (transfer learning on graphs) and has applications in biological, communication, and social networks.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
