Blockchain-Assisted Personalized Car Insurance With Privacy Preservation and Fraud Resistance
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
It is well known that auto insurance companies (ICs) use personalized car insurance (PCI) to continuously track drivers' behavior to determine their auto premiums. However, drivers inevitably have concerns about the transparency of data collection/processing and the potential privacy leakage. In this paper, we propose a new PCI scheme to achieve privacy preservation and transparency with the assistance of a consortium blockchain. Specifically, a blockchain is first established by a group of consortium members, and each IC can deploy insurance contracts on the blockchain to support public verification of data collection/processing and thus fulfill the transparency requirement. Then a verifiable and privacy-preserving driving behavior evaluation protocol is designed by tailoring partially homomorphic encryption and zero-knowledge proof techniques. Drivers can use the protocol to interact with ICs through the contracts, and ICs can learn drivers' behavior and set corresponding auto premiums by analyzing encrypted driving data. Furthermore, a third-party auditor (TPA) is authorized by drivers and ICs to audit encrypted driving data on the contracts and resist fraud attacks. We model the contract-based auditing as a recursive inspection game where TPA can minimize the number of audits to detect data fraud and penalize malicious drivers according to Nash equilibrium. Therefore, the proposed PCI scheme can guarantee that most of the collected driving data are not biased. Formal simulation-based security analysis is given to prove the security of the proposed scheme, and a proof-of-concept prototype is also developed on an open-source blockchain to demonstrate the feasibility.
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.001 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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