DACPI: A decentralized access control protocol for information centric networking
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Current Internet architecture is becoming inadequate for new requirements of highly scalable and efficient distribution of contents. Information Centric Networking (ICN) is one of the alternatives for the Next Generation Internet (NGI), which focuses mainly on contents. In-network caching is one of the major attributes of ICN, which allows contents to be cached in any ICN node. Any user can access ICN contents from different distributed locations. This attribute maximizes the problem of unauthorized access to ICN contents. In this paper, we propose a Decentralized Access Control Protocol for ICN architectures (DACPI). In this protocol, fewer public messages are needed for access control enforcement between ICN subscribers and ICN nodes than the existing access control protocols. DACPI depends on ICN self-certifying naming scheme. We perform security analysis on DACPI for the following attacks: man-in-the-middle, forward security, replay attacks, integrity, and privacy violations. According to the security analysis, DACPI prevents unauthorized access to ICN contents with fewer messages passed.
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.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| 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 it