Bibliographic record
Abstract
As Radio Frequency Identification (RFID) devices become ever more ubiquitous it is very likely that demands on them to provide certain types of security such as authentication, confidentiality, and privacy and encryption for security, depending on the application, will increase. This chapter gives a brief overview of cryptographic techniques and protocols. Given the often limited complexity and power of RFID devices, much effort has been devoted to devising so-called “lightweight” cryptographic techniques for such devices, and a few of these are considered in this chapter. Even public key techniques to provide services such as identification and digital signatures have been proposed for some scenarios involving RFID devices, although such devices will obviously require significant computing power. While such applications are seemingly beyond currently available technology, given the speed at which technology is able to yield computational increases at reasonable cost and device size, it seems prudent to consider such protocols at this point.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.005 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.005 | 0.009 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.003 | 0.005 |
| Insufficient payload (model declined to judge) | 0.034 | 0.036 |
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".