Graph Automorphism-Based, Semantics-Preserving Security for the Resource Description Framework (RDF)
Bibliographic record
Abstract
We address security in the context of the Resource Description Framework (RDF), a graph-like data model for the web. One of RDF's compelling features is a precise, model-theoretic semantics. We first propose a threat model, and under it, observe that the technical challenge is really in hiding information that may be revealed by the structure of an RDF graph. We choose two quantitative, unconditional notions for securing graph-structure from the literature that address the threat model, and adapt them for RDF. We then consider the problem of devising algorithms for achieving a certain level of security while preserving the semantics of the input RDF graph. We observe that there are operations we can perform on an RDF graph that both provide such security and preserve semantics. We observe, further, that there is a natural way to quantify information-loss under these operations, and that there appears to be a natural trade-off between security and information-quality. We study this trade-off and establish fundamental results. We show that the RDF graphs that result from applying the operations induce a lattice that leads to a natural quantification of information-quality. We show also that achieving a certain level of security while retaining a certain level of information-quality is NP-complete under polynomial-time Turing reductions. Finally, towards an empirical assessment, we discuss our design and implementation of a reduction to CNF-SAT, and empirical results for two classes of RDF graphs. In summary, our work makes fundamental and practical contributions to semantics-preserving security for RDF.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.005 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".