Journal of Computing Theories and Applications https://publikasi.dinus.ac.id/jcta <div style="border: 3px #086338 Dashed; padding: 10px; background-color: #ffffff; text-align: left;"> <ol> <li><strong>Journal Title </strong>: Journal of Computing Theories and Applications</li> <li><strong>Online ISSN </strong>: <a href="https://portal.issn.org/resource/ISSN/3024-9104">3024-9104</a> </li> <li><strong>Frequency </strong>: Quarterly (February, May, August, and November) </li> <li><strong>DOI Prefix</strong>: 10.62411/jcta</li> <li><strong>Publisher </strong>: Universitas Dian Nuswantoro</li> </ol> </div> <div id="focusAndScope"> <p><strong data-start="133" data-end="190">Journal of Computing Theories and Applications (JCTA)</strong> is a peer-reviewed international journal that covers all aspects of foundations, theories, and practical applications in computer science. All accepted articles are published online, assigned a <strong data-start="527" data-end="547">DOI via Crossref</strong>, and made <strong data-start="558" data-end="593" data-is-only-node="">freely accessible (Open Access)</strong>. The journal follows a <strong>rapid peer-review</strong> process, with the first decision typically provided within two to four weeks. JCTA welcomes original research papers in, but not limited to:</p> <p>Artificial Intelligence<br />Big Data<br />Bioinformatics<br />Biometrics<br />Cloud Computing<br />Computer Graphics<br />Computer Vision<br />Cryptography<br />Data Mining<br />Fuzzy Systems<br />Game Technology<br />Image Processing<br />Information Security<br />Internet of Things<br />Intelligent Systems<br />Machine Learning<br />Mobile Computing<br />Multimedia Technology<br />Natural Language Processing<br />Network Security<br />Pattern Recognition<br />Quantum Informatics<br />Signal Processing<br />Soft Computing<br />Speech Processing</p> <p><br />Special emphasis is given to recent trends related to cutting-edge research within the domain.</p> </div> <div id="peerReviewProcess"> </div> <div id="sponsors"> <p> </p> </div> en-US editorial.jcta@dinus.id (JTCA Editorial) editorial.jcta@gmail.com (JTCA Editorial Support Team) Sat, 28 Feb 2026 00:00:00 +0000 OJS 3.2.1.4 http://blogs.law.harvard.edu/tech/rss 60 The Llama–ARCS Adaptive Learning framework: AI–VR Integration System for Real-Time Motivational Feedback in Higher Education https://publikasi.dinus.ac.id/jcta/article/view/15031 <p>This study developed and evaluated an AI-integrated Virtual Reality (VR) system designed to enhance personalized learning in higher education. While VR improves engagement, existing systems often lack adaptivity or experience high latency during AI interactions. To address these limitations, this research introduces a novel integration of a cache-optimized Llama 2 Large Language Model (LLM) that delivers real-time, motivationally grounded feedback. The system was implemented using Unity 3D and validated with 50 undergraduate students. Technical validation showed that the cache layer reduced interaction latency from 17.7 ms to 14.2 ms and maintained zero system crashes throughout the pilot. Learner motivation was assessed using Keller’s ARCS model, yielding mean scores ranging from 4.08 to 4.69 across all dimensions. Independent t-tests (p &gt; 0.05) and negligible effect sizes (Cohen’s d &lt; 0.2) revealed no significant difference between technical (ICT) and non-technical (Physics) students. These findings confirm that the proposed system effectively bridges technological and motivational gaps, providing a robust model for adaptive, immersive education.</p> Abraham Eseoghene Evwiekpaefe, Darius Tienhus Chinyio, Loreta Katok Tohomdet Copyright (c) 2025 Abraham Eseoghene Evwiekpaefe, Darius Tienhus Chinyio, Loreta Katok Tohomdet https://creativecommons.org/licenses/by/4.0 https://publikasi.dinus.ac.id/jcta/article/view/15031 Sun, 14 Dec 2025 00:00:00 +0000 Integrating Fully Homomorphic Encryption and Zero-Knowledge Proofs for Efficient Verifiable Computation https://publikasi.dinus.ac.id/jcta/article/view/14181 <p>Fully Homomorphic Encryption (FHE) enables computation on encrypted data with end-to-end confidentiality; however, its practical adoption remains limited by substantial computational costs, including long encryption and decryption times, high memory consumption, and operational latency. Zero-Knowledge Proofs (ZKPs) complement FHE by enabling correctness verification without revealing sensitive information, although they do not support encrypted computation independently. This study integrates both techniques to enable encrypted computation with verifiably consistent results. A prototype system is implemented in Python using Microsoft SEAL for homomorphic encryption and PySNARK for Zero-Knowledge Proof verification. Experiments are conducted on standard consumer-grade hardware (Intel i5, 8 GB RAM, Ubuntu 22.04) using datasets ranging from 100 MB to 1 GB. The evaluation focuses on encryption and decryption time, homomorphic computation latency, memory usage, and proof generation overhead. Experimental results show that integrating ZKPs introduces a moderate and stable runtime overhead of approximately 15–20%, as analyzed in Section 4, while enabling verification without plaintext disclosure. Ciphertext expansion remains a notable limitation, with observed growth of approximately 30–40× relative to plaintext size, consistent with prior FHE implementations. Despite these overheads, the system demonstrates feasible scalability for datasets up to 1 GB on mid-level hardware. Overall, the results indicate that the integrated FHE+ZKP approach provides a practical balance between confidentiality, verifiability, and performance, supporting its applicability to privacy-preserving scenarios such as secure cloud computation, encrypted data analytics, and confidential data processing under realistic resource constraints.</p> UmmeAmmara Qureshi, Bhumika Doshi, Aditya More, Kashyap Joshi, Kapil Kumar Copyright (c) 2025 UmmeAmmara Qureshi, Bhumika Doshi, Aditya More, Kashyap Joshi, Kapil Kumar https://creativecommons.org/licenses/by/4.0 https://publikasi.dinus.ac.id/jcta/article/view/14181 Sat, 27 Dec 2025 00:00:00 +0000 Hybrid Real-time Framework for Detecting Adaptive Prompt Injection Attacks in Large Language Models https://publikasi.dinus.ac.id/jcta/article/view/15254 <p>Prompt injection has emerged as a critical security threat for Large Language Models (LLMs), exploiting their inability to separate instructions from data within application contexts reliably. This paper provides a structured review of current attack vectors, including direct and indirect prompt injection, and highlights the limitations of existing defenses, with particular attention to the fragility of Known-Answer Detection (KAD) against adaptive attacks such as DataFlip. To address these gaps, we propose a novel, hybrid, multi-layered detection framework that operates in real-time. The architecture integrates heuristic pre-filtering for rapid elimination of obvious threats, semantic analysis using fine-tuned transformer embeddings for detecting obfuscated prompts, and behavioral pattern recognition to capture subtle manipulations that evade earlier layers. Our hybrid model achieved an accuracy of 0.974, precision of 1.000, recall of 0.950, and an F1 score of 0.974, indicating strong and balanced detection performance. Unlike prior siloed defenses, the framework proposes coverage across input, semantic, and behavioral dimensions. This layered approach offers a resilient and practical defense, advancing the state of security for LLM-integrated applications.</p> Chandra Prakash, Mary Lind, Elyson De La Cruz Copyright (c) 2026 Chandra Prakash, Mary Lind, Elyson De La Cruz https://creativecommons.org/licenses/by/4.0 https://publikasi.dinus.ac.id/jcta/article/view/15254 Fri, 09 Jan 2026 00:00:00 +0000 Android Malware Detection Using Machine Learning with SMOTE-Tomek Data Balancing https://publikasi.dinus.ac.id/jcta/article/view/15084 <p>This study presents a comprehensive comparative analysis of four traditional machine learning algorithms Decision Tree, Random Forest, K-Nearest Neighbors, and Support Vector Machine for Android malware detection using the preprocessed TUANDROMD dataset comprising 4,465 instances and 241 features representing both static and dynamic application characteristics. Motivated by the limitations of conventional signature-based and hybrid detection methods, especially in managing imbalanced datasets and detecting emerging malware variants, the study employed SMOTE to ensure balanced training data and fair model evaluation. The dataset was divided into 80% training and 20% testing subsets, and models were assessed using key performance metrics including accuracy, precision, recall, F1-score, and ROC AUC. The findings revealed that the proposed Random Forest model outperformed the other classifiers, achieving an accuracy of 0.993, precision of 0.992, recall of 1.000, F1-score of 0.996, and a near-perfect ROC AUC of 0.9998 surpassing state-of-the-art approaches. These results affirm the superior predictive capability, consistency, and robustness of the Random Forest algorithm in Android malware detection. The study concludes that base models, when integrated with class-balancing techniques, provide reliable and efficient malware detection across imbalanced datasets. For future research, the study recommends exploring advanced hybrid or ensemble frameworks that integrate Random Forest with deep learning architectures or other meta-heuristic optimization techniques to further enhance detection accuracy, adaptability, and resilience against rapidly evolving Android malware threats.</p> Maryam Sufiyanu Masari, Maiauduga Abdullahi Danladi, Ilori Loretta Onyinye, Loreta Katok Tohomdet Copyright (c) 2026 Maryam Sufiyanu Masari, Maiauduga Abdullahi Danladi, Ilori Loretta Onyinye, Loreta Katok Tohomdet https://creativecommons.org/licenses/by/4.0 https://publikasi.dinus.ac.id/jcta/article/view/15084 Sun, 18 Jan 2026 00:00:00 +0000