Share and Export
Share and Export
Stokes, Klara (2019) Cover-up: a probabilistic privacy-preserving graph database model. Journal of Ambient Intelligence and Humanized Computing. ISSN 1868-5137
Preview
KS_cover-up.pdf
Download (834kB) | Preview
Abstract
A new graph database model is introduced that allows for an efficient and straightforward privacy-preserving mechanism.
A probabilistic graph database model is also proposed, perhaps less suitable for lossless storage, but adapted for the use of
statistical analysis that preserves the privacy of the individuals behind the data. Parallels are drawn to concepts in combinatorics
such as clique complexes and incidence geometries.
| Item Type: | Article |
|---|---|
| Additional Information: | Cite as: Stokes, K. Cover-up: a probabilistic privacy-preserving graph database model. J Ambient Intell Human Comput (2019). https://doi.org/10.1007/s12652-019-01515-8 |
| Keywords: | Privacy; Graph database; Clique complex; Incidence geometry; |
| Academic Unit: | Faculty of Science and Engineering > Electronic Engineering |
| Item ID: | 14073 |
| Identification Number: | 10.1007/s12652-019-01515-8 |
| Depositing User: | Klara Stokes |
| Date Deposited: | 24 Feb 2021 17:28 |
| Journal or Publication Title: | Journal of Ambient Intelligence and Humanized Computing |
| Publisher: | Springer |
| Refereed: | Yes |
| Related URLs: | |
| URI: | https://mu.eprints-hosting.org/id/eprint/14073 |
| Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
- Item control page
Downloads
Downloads per month over past year
