https://publikasi.dinus.ac.id/jcta/issue/feedJournal of Computing Theories and Applications2026-02-28T00:00:00+00:00JTCA Editorialeditorial.jcta@dinus.idOpen Journal Systems<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>https://publikasi.dinus.ac.id/jcta/article/view/15031The Llama–ARCS Adaptive Learning framework: AI–VR Integration System for Real-Time Motivational Feedback in Higher Education2025-11-04T01:08:33+00:00Abraham Eseoghene Evwiekpaefeaeevwiekpaefe@nda.edu.ngDarius Tienhus Chinyiodtchinyio@nda.edu.ngLoreta Katok Tohomdetloretatohomdet@gmail.com<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 > 0.05) and negligible effect sizes (Cohen’s d < 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>2025-12-14T00:00:00+00:00Copyright (c) 2025 Abraham Eseoghene Evwiekpaefe, Darius Tienhus Chinyio, Loreta Katok Tohomdethttps://publikasi.dinus.ac.id/jcta/article/view/14181Integrating Fully Homomorphic Encryption and Zero-Knowledge Proofs for Efficient Verifiable Computation2025-08-13T16:27:12+00:00UmmeAmmara Qureshiqureshiammara084@gmail.comBhumika Doshibhumikasdoshi@gmail.comAditya Moremoreadityarajesh@gmail.comKashyap Joshikashyapjoshi.it@gmail.comKapil Kumarkkforensic@gmail.com<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>2025-12-27T00:00:00+00:00Copyright (c) 2025 UmmeAmmara Qureshi, Bhumika Doshi, Aditya More, Kashyap Joshi, Kapil Kumar