Towards A Security Framework for Smartphone Operating Systems
Bibliographic record
Abstract
Smartphones have become an integral part of our daily lives that offer a multitude of features in a small form factor. Users store sensitive personal information on their phones and perform financial transactions. Moreover, people use their personal phones to access corporate/government resources and vice versa. We perform tasks on smartphones that require multiple security models to execute the tasks securely. However, most smartphone operating systems need to focus on the usability which compromises security. This thesis presents a security framework for smartphone operating systems. The core idea of the framework resembles the security of a modern smart city. The operating system acts as the government of the city and the applications are the citizens. It has components to protect resources and perform policing (monitor, detect, and control). There are multiple application zones with different security constraints. Smartphones with this framework automatically switch to a different security mode based on the detected context to satisfy the security requirements in different use cases. Installed applications are monitored to identify anomalous behavior as well as certain specific malicious behavior like click-fraud. The operation of the framework is mostly automated and requires no input from users for default operations. We implement a significant portion of the framework for Android and our experiments suggest that the framework improves the overall security of Android increasing its ability to protect user resources as well as to detect and control malware.
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.008 | 0.008 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.001 | 0.003 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.002 | 0.003 |
| Scholarly communication | 0.007 | 0.009 |
| Open science | 0.004 | 0.006 |
| Research integrity | 0.004 | 0.008 |
| Insufficient payload (model declined to judge) | 0.003 | 0.003 |
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".