Secure personal data servers: a vision paper
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
An increasing amount of personal data is automatically gathered and stored on servers by administrations, hospitals, insurance companies, etc. Citizen themselves often count on internet companies to store their data and make them reliable and highly available through the internet. However, these benefits must be weighed against privacy risks incurred by centralization. This paper suggests a radically different way of considering the management of personal data. It builds upon the emergence of new portable and secure devices combining the security of smart cards and the storage capacity of NAND Flash chips. By embedding a full-fledged Personal Data Server in such devices, user control of how her sensitive data is shared by others (by whom, for how long, according to which rule, for which purpose) can be fully reestablished and convincingly enforced. To give sense to this vision, Personal Data Servers must be able to interoperate with external servers and must provide traditional database services like durability, availability, query facilities, transactions. This paper proposes an initial design for the Personal Data Server approach, identifies the main technical challenges associated with it and sketches preliminary solutions. We expect that this paper will open exciting perspectives for future database research.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 1×
“We suggested a preliminary solution [5] for a sanitization algorithm preventing record linkages through k-anonymity [22].”
MethodTor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704 · cited 2×
“If threshold p is reached, the querier sends messages back tagged with the pseudonym of the individual at risk to the Supporting Servers.”
BackgroundMethodNew Stream Cipher Designs: The eSTREAM Finalists
(2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3 · Cited by 263
Cited by
Security and privacy in electronic health records: a systematic literature review.
Fernández-Alemán, J. L., Señor, I. C., Lozoya, P. Á. O., & Toval, A. (2013) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2012.12.003 · Cited by 675
Security and privacy of electronic health records: Concerns and challenges
Keshta, I., & Odeh, A. (2021) · Egyptian Informatics Journal · doi:10.1016/j.eij.2020.07.003 · Cited by 498
Wearable devices in healthcare: Privacy and information security issues
Cilliers, L. (2020) · Health Information Management Journal · doi:10.1177/1833358319851684 · Cited by 169
“Security threats can typically be divided into external threats such as hackers, viruses and worms and internal threats such as accidental loss of the data (Allard et al., 2010).”
Background
Metadata
- Authors
- Allard, T., Anciaux, N., Bouganim, L., Guo, Y., Le Folgoc, L., Nguyen, B., Pucheral, P., Ray, I., Ray, I., & Yin, S.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2010-09
- Volume
- 3
- Issue
- 1-2
- Pages
- 25-35
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2011119785
- Cited by
- 65
- References
- 4
- FWCI
- 16.26
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Secure personal data servers: a vision paper. https://app.cochat.ai/papers/10.14778/1920841.1920850
- The paper
- Allard, T., Anciaux, N., Bouganim, L., Guo, Y., Le Folgoc, L., Nguyen, B., Pucheral, P., Ray, I., Ray, I., & Yin, S. (2010). Secure personal data servers: a vision paper. Proceedings of the VLDB Endowment. https://doi.org/10.14778/1920841.1920850
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.