Authenticating displayed names in telephony
Bibliographic record
Abstract
In both traditional and Internet Protocol (IP) telephony, a caller ID number is subject to control and verification, whereas the displayable caller ID name is a convenience feature which operators have no control over. It may be arbitrarily set by the caller. Voice phishing can exploit this weakness-e.g., make a call spoofing the name of a bank and ask for account information. We present a framework that allows each call participant to authenticate the displayed name of other parties via public name registries and International Telecommunication Union Telecom Standardization Sector (ITU-T) X.509 certificates. The authentication can work end-to-end, on-demand, for both called and calling party's name, for Voice over Internet Protocol (VoIP), landline, or mobile endpoints. The framework is flexible, does not require global public key infrastructure (PKI), and allows concerned financial, medical, and legal institutions to delegate the use of their authenticated names to employees outside the office as well as outsourcing companies. A proof-of-concept implementation is also presented.
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.010 |
| 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.006 |
| Scholarly communication | 0.006 | 0.012 |
| Open science | 0.002 | 0.007 |
| Research integrity | 0.005 | 0.004 |
| Insufficient payload (model declined to judge) | 0.005 | 0.004 |
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".