Skip to main content
Peer-Reviewed Open Access · CC BY-NC 4.0
Home › Issues › Volume 5 · Issue 1 › Article V5-I1-J-2026-0115
🔬 Original Research 🔓 Open Access ✓ Peer-Reviewed Vol. 5 · Issue 1 · Oct 2026 · Pages 20-28

An OSINT pathway for Tracking SMS Fraud (Smishing)

NR
Neeraj Ram✉️
National Forensic Sciences University (NFSU), Dharwad Campus
9
Downloads
23
Views
9
Pages

DOI

📄

Abstract

Abstract: SMS phishing also called as “Smishing” has become a massive loophole in mobile networks. Currently, attackers exploit bulk SMS services and fake caller IDs to send malicious links containing scripts and attacking application APK’s which are therefore directly installed into the devices. Because these are highly organized and fast-moving, local authorities and security teams are facing a significant roadblock when trying to track down the attackers or attacking infrastructure behind them. This paper offers a practical step by step guide using the Open-Source Intelligence techniques to investigate these scams. Instead of relying solely on expensive commercial software, this paper demonstrates how security analysts can use publicly available tools to track digital footprints, analyze spoofed sender identities, and uncover hidden payloads or technique used to carry out the attack and details like spoofing sender names and hidden payloads (registration of the fake website used for the attack), By this we can trace the path of the attack from the start to end. This research provides a fast, accessible ways to investigate a telecom fraud and therefore helping the respective authorities to quickly block the scams.

🏷️

Keywords

📖

Full Article

🖼️

Figures & Tables

📚

References

Showing 0 of 0 references · APA 7 format
👥

Author Information

Authors and Affiliations

NR
Neeraj Ram ORCIDCorresponding Author
National Forensic Sciences University (NFSU), Dharwad Campus

Contributions

Conceptualization, Data Curation, Formal Analysis, Funding Acquisition, Investigation, Methodology, Project Administration, Resources, Software, Supervision, Validation, Visualization, Writing – Original Draft, Writing – Review & Editing

⚖️

Ethics Declarations

Ethics Approval and Consent to Participate

Users can freely download, share, and reuse the article for any purpose (even commercially), as long as they give proper credit to the original author.

Competing Interests

Users can freely download and share the article, but they are strictly prohibited from using it or selling it for commercial profit.

Consent for Publication

Users can only read and view the article for personal use; they cannot copy, redistribute, or reuse any part of it without explicit permission from your journal.

📋

Editorial Lifecycle

Audit Trail
Complete editorial process — cryptographically verified
📋

Editorial Process Audit Trail

Chain ID: NFSU-2026-V5-I1-J-2026-0115-CHAIN ✓ Verified · 0 blocks · Genesis 0x9f2b

No History Found

This manuscript has no status history yet.

📅 Total editorial timeline: 0 blocks tracked Genesis Hash: 0x9f2b3c7d8e4a5f1b · Verified ✓
🔐

Verification & Trust

Compliant
COPE · ICMJE · FAIR · ORCID · CLOCKSS
🛡️

Article Integrity Verified

All editorial chain blocks cryptographically verified · Compliant with COPE, ICMJE, and FAIR standards

🔗 Chain Integrity
✓ 0 blocks verified
🌳 Genesis Hash (Merkle Root)
0x00000000c341559089528db934857078f52c3d96
📝 Plagiarism Screening
% similarity · ✓
🤖 AI Content Detection
% probability · ✓
👥 Peer Reviewer Verification
1 verified reviewers (sealed)
🆔 ORCID Verification
0/1 authors verified
🔗 Crossref DOI Registration
Pending registration
📦 Preservation Archives
CLOCKSS ✓ Portico ✓
⚖️ Ethics Approval
💼 Conflict of Interest Declaration
🔐 Verification Standards: This article complies with COPE, ICMJE, FAIR data principles, iThenticate plagiarism screening, GPTZero AI content detection, and ORCID author identification. The audit trail is permanently preserved and independently verifiable.
ℹ️

About this article

📝 Cite this article · How to Cite

View all citation formats in sidebar →
📥 Received
12 October 2026
✏️ Revised
✅ Accepted
12 October 2026
📅 Published
30 June 2026
📄 Version of Record
30 June 2026
📖 Issue
Volume 5, Issue 1 (June 2026)
📃 Pages
20-28 (9 pages)
🔢 Article Number
NFSU-V5-I1-V5-I1-J-2026-0115
📜 License
CC BY-NC 4.0
🔗

Share this article

Anyone you share the following link with will be able to read this content:

Provide free access to colleagues, peers, and your professional network — no subscription required for them to view the full article.

An unhandled error has occurred. Reload 🗙