Bibliographic record
Abstract
Electronic business or on-line cooperation transactions happen regularly over the internet. Such a transaction usually involves a service provider who provides a certain service (i.e., perform an on-line purchase) and a service requester who requests the service. In order to decide whether a service requester can access a service, a distributed access control system can be used. Traditional identity-based access control systems usually require pre-register, which is too rigid to adapt to the rapid developing on-line cooperation. Trust-based access control provides open authentication and access control. The flexibility that it introduces could boost the on-line cooperation significantly. However, it is vulnerable to attacks that lead to leakage of sensitive information. Furthermore, certain credentials (such as, credit card number) are too sensitive to release for some people even through proper release policies. This paper introduces the Zero-knowledge protocol for credential verification, and presents a trust-based access control framework that incorporates this protocol. This system keeps the highly sensitive credentials secret; while at the same time proceed with the trust negotiation.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.009 | 0.024 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.003 | 0.005 |
| Scholarly communication | 0.007 | 0.011 |
| Open science | 0.003 | 0.007 |
| Research integrity | 0.004 | 0.004 |
| Insufficient payload (model declined to judge) | 0.006 | 0.002 |
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 source (direct Gemma or distilled Codex), 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".