Phishing remains the dominant initial-access vector in modern cyberattacks, yet Turkish-language resources for benchmarking phishing e-mail detectors are scarce and methodologically fragile. We first show that a publicly released Turkish phishing dataset—our own earlier one (v1; 7504 messages)—is pathological: after entity masking it collapses to seven phishing and one legitimate content templates, and 99.95% of sender addresses share one artificial pattern, so any classifier memorizes artifacts rather than phishing semantics. We introduce TurkPhish v2, a class-balanced corpus of 2653 Turkish e-mails built from a generation matrix crossing phishing themes, persuasion tactics, length bands, and stylistic registers; the matrix is encoded as LLM-ready prompts, while the released corpus is instantiated by a deterministic, anti-leakage template composer. Against the v1 pathologies, the corpus is clean: unique masked templates, no near-duplicates (maximum pairwise cosine 0.808), opening and punctuation views at chance (49.8–52.8%), and matched lengths (p = 0.999). We also report the residual these gates miss: class signal lives in a closed pool of intent sentences, so a zero-learning lookup rule reaches 0.928 macro F1 in distribution and 0.894 out of topic, outscoring five of the ten benchmarked detectors. In-distribution performance is therefore a ceiling artifact, not evidence of learned phishing semantics. Benchmarking ten detectors across classic machine learning, Turkish/multilingual transformers, and an instruction-tuned large language model, eight exceed 0.99 macro F1 in distribution and are statistically indistinguishable (McNemar, p > 0.05), whereas out of topic TF-IDF linear models lead (logistic regression 0.947, 95% CI [0.926, 0.966]; 0.959 under the body-only protocol we recommend to users of the corpus) and mBERT collapses (0.570). Because persuasion phrasing is shared across themes, this protocol measures transfer to unseen theme vocabulary rather than robustness to novel phrasing. The transformer deficit out of topic is, for two of three encoders, a thresholding rather than a ranking failure: mBERT retains 0.960 out-of-topic AUC while its recall at the default 0.5 rule falls to 0.263. The corpus, splits, generation framework, and the full leakage audit, including its negative results, are available for research use.
Osman Can Çetlenbik, Ahmet Ali Süzen· Applied Sciences· 0 citations
Today, Large Language Models (LLMs) perform many tasks in the field of natural language processing with high success, from text generation to translation, semantic analysis to code writing. However, these models have some fundamental limitations that make their reliable use challenging. They can produce factual errors known in the literature as hallucinations and cannot directly access developments after their training period. They also sometimes reproduce biases present in the training data. The Re-trieval-Augmented Generation (RAG) approach aims to produce more up-to-date and verifiable outputs by dynamically feeding the model with external information sources, thereby reducing hallucination and temporal limitations. This study examines distributed learning approaches aimed at protecting data privacy and QLoRA-based fine-tuning strategies within a mathematical framework. It also addresses 4-bit NormalFloat (NF4) quantization techniques used to improve system efficiency. Furthermore, it de-tails morphology-aware hybrid access methods and adaptive routing mechanisms that can make deci-sions based on query complexity to achieve results more suitable for Turkish. The study demonstrates that combining RAG-based systems with federated learning and homomorphic encryption creates a secure, decentralized architecture, and that LLM can be efficiently run on low-resource systems using the NF4-QLoRA combination. However, limitations such as encryption latency, erroneous information from untrusted sources, and the inadequacy of standard evaluation methods for Turkish also exist.
M. Toy, Ahmet Ali Süzen· International journal of 3d...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.