Shariq Bashir Muhammad Bashir Mirza

Dr. Shariq Bashir Muhammad Bashir Mirza

Imam Mohammed bin saud university, Riyadh, Ar Riyāḑ, Saudi Arabia

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 February 2026 in IEEE Access
Verified
Journal Article
Open access
SMShariq Bashir Muhammad Bashir Mirza
Shariq Bashir Muhammad Bashir Mirza
The rapid proliferation of large language models (LLMs) has intensified the need for reliable mechanisms to identify, authenticate, and trace AI-generated text. LLM watermarking addresses this challenge by embedding imperceptible statistical signals into generated content, enabling provenance verification and misuse detection. However, existing watermarking approaches rely on a symmetric secret key shared between watermark embedding and detection, which prevents public verification and introduces a critical single point of failure: key disclosure enables watermark forgery, spoofing, and unauthorized replication. This paper proposes an asymmetric watermarking approach for LLMs that decouples watermark generation from verification using a public–private key pair. In the proposed design, a private key is used exclusively by the LLM to embed the watermark, while a corresponding public key enables anyone to verify the watermark without compromising security. The approach extends probabilistic token biasing by jointly embedding private and public watermark signals, allowing transparent public verification while preserving strong private authentication guarantees. Experimental evaluation demonstrates that the proposed approach closely matches the statistical behavior of the traditional symmetric watermark under the private key, while introducing a robust and independently verifiable public watermark. High correlations in z-scores and p-values confirm equivalent detectability, and BERT-based similarity scores show that semantic quality is preserved across a wide range of watermark strengths. These results demonstrate that the proposed asymmetric approach achieves statistically significant detection, strong robustness against forgery, and practical public verifiability, making it well suited for forensic and real-world deployment of LLM-generated content.

28 April 2026 in IEEE Access
Verified
Journal Article
Open access
SMShariq Bashir Muhammad Bashir Mirza
Shariq Bashir Muhammad Bashir Mirza
AKAkmal Saeed Khattak
Akmal Saeed Khattak
Current watermarking approaches for LLM-generated text typically embed watermarks during the generation process, using a secret key controlled by the LLM. Although this enables verification of LLM-generated content, it may raise copyright and authorship concerns. For instance, when a user relies on an LLM for proofreading, grammar correction, or translation, the model may still embed its own watermark. This can later create disputes regarding ownership, as the text may appear to belong to the AI system rather than the human author. To address this issue, this paper proposes an improved post-hoc watermarking approach that embeds user-controlled watermarks after the text generation is complete. The approach does not require access to the internal architecture of the LLM. It applies a probabilistic watermarking mechanism using a user secret key, and embeds watermark signals across the entire text rather than only on selective terms, as in previous post-hoc approaches. During watermark embedding, the approach regenerates the suffix after each token substitution by interacting with the LLM. This preserves grammatical correctness and contextual coherence, addressing the quality degradation often observed in synonym-based substitution approaches that do not adjust the surrounding text. A BERT-based masked language model is used to ensure that each substitution remains semantically consistent with the original text. Experimental results show that the proposed approach maintains higher similarity and readability than previous post-hoc approaches while producing statistically verifiable watermark signals. The approach provides a practical solution for authorship verification and copyright protection in generative AI, without requiring access to the internal mechanism of the LLM.

23 March 2026 in Neurocomputing
Verified
Journal Article
Closed access
SMShariq Bashir Muhammad Bashir Mirza
Shariq Bashir Muhammad Bashir Mirza

26 August 2025 in IEEE Access
Verified
Journal Article
Open access
SMShariq Bashir Muhammad Bashir Mirza
Shariq Bashir Muhammad Bashir Mirza
This paper proposes a privacy-preserving scheme, PromptMasking, for querying AI chatbots without disclosing users’ sensitive prompts. This scheme enables users to query AI systems without revealing their true intent by transforming sensitive prompts into non-sensitive proxy prompts, selected from a semantically constructed proxy dictionary. The scheme then supplements these with cover prompts, ensuring the original prompt remains indistinguishable during processing. Unlike prior techniques, PromptMasking does not rely on encryption or prompt rewriting, making it compatible with existing large language model APIs. To evaluate its effectiveness, we constructed a dataset comprising 240 topics (40 sensitive and 200 non-sensitive) and generated over 1.2 million high-quality natural language prompts. Experimental results demonstrate that PromptMasking significantly outperforms state-of-the-art baselines in preserving prompt privacy. In particular, it achieves substantial improvements in obfuscating related prompts across both single and multi-session search settings.

23 March 2026 in Scientific Reports
Verified
Journal Article
Open access
PDF file
SMShariq Bashir Muhammad Bashir Mirza
Shariq Bashir Muhammad Bashir Mirza
Mining fault-tolerant (FT) frequent itemsets in noisy datasets is more challenging than conventional frequent itemset mining due to the high cost of evaluating fault-tolerance conditions. Consequently, mining maximal fault-tolerant frequent itemsets (FT-MFIs) is particularly important, as they provide a concise representation of all frequent patterns while eliminating redundancy, which is crucial in noisy datasets where error tolerance must be considered. Existing approaches for mining FT-MFIs are predominantly based on Apriori-style candidate generation and test, which suffer from exponential candidate growth, multiple dataset scans, and limited scalability. As a novel contribution, this work is the first to propose a pattern-growth framework for mining FT-MFIs. We introduce an algorithm that constructs a fault-tolerant FP-tree (FT-FP-tree) to compress transactions with common prefixes and evaluate tolerance conditions in a single pass. Additionally, new techniques for transaction mapping and conditional pattern extraction enhance the efficiency and scalability of the mining process. Experimental results on benchmark datasets demonstrate that the proposed approach achieves substantial reductions in execution time compared to all existing algorithms, while also showing improved memory efficiency relative to other pattern-growth based algorithms. This establishes pattern growth as a practical and scalable solution for fault-tolerant frequent itemset discovery.

13 February 2026 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
ASAnwar Sadad
Anwar Sadad
AKAkmal Saeed Khattak
Akmal Saeed Khattak
RARabeeh Ayaz Abbasi
Rabeeh Ayaz Abbasi
MSMuddassar Azam Sindhu
Muddassar Azam Sindhu
SMShariq Bashir Muhammad Bashir Mirza
Shariq Bashir Muhammad Bashir Mirza