International Journal of Advanced Computer Technology

International Journal of Advanced Computer Technology http://ijact.org/index.php/ijact <center> <h3 style="font-family: georgia,serif; font-size: 20px; color: #0066ff;">A Peer reviewed, Open access, Bimonthly, International Journal since 2012</h3> </center> <section class="additional_content"> ISSN : 2319-7900 | DOI : 10.18535/ijact | <a href="https://ijact.org/revista/index.php/ijact/gateway/plugin/WebFeedGatewayPlugin/rss">RSS</a> <a href="https://ijact.org/revista/index.php/ijact/about/submissions">Submission</a>  Call For Paper Volume 8 issue 2 December 2019 Submission Deadlines Volume / Issue / Month : Volume 08 Issue 2, 25 December 2019 Read More  Submit Article at : <a href="mailto:editor@ijact.org">submitpaper@ijact.org</a> International Journal of Advanced Computer Technology (IJACT) ISSN - 2319-7900 is a leading international online journal for publication of new ideas. It's a peer-reviewed, open access scholarly journal that publishes research works and review articles in all research domains (Engineering, Technology). This is an open access journal which means that all content is freely available to the Researcher /users of any institution with vision spreading and sharing knowledge. These published articles/papers are accessible to the research scholars through a wide indexing policy adopted by this online international journal. Hence, they can freely be accessed and used by everyone for the improvement of current trends in science and technology. This Journal favors and promotes online publication of papers to truly present itself as an online journal. </section> <center></center> IJACT follows publication ethics during phases of online publication inline with the guidelines and standards developed by the Committee on Publication Ethics (COPE) to avoid any malpractices by all concerned including authors, reviewers, editors and publishers. This is in accordance with the BOAI definition of open access. We are committed and promise to take this journal to greater heights. We invites authors for the guest editorship, reviewers, program for improving the journal quality and also sharing the innovative ideas. Frequency : Six issues/year Submit Article at submitpaper@ijact.org en-US editor@ijact.org (Dr. Amrendra Singh Yadav) editor@ijact.org (Himanshu Ojha) Fri, 25 Apr 2025 00:00:00 +0000 OJS 3.1.1.4 http://blogs.law.harvard.edu/tech/rss 60 Enhanced Reversible Data Hiding for Encrypted Image Based on Block Mean Difference Histogram Shifting and BPHST http://ijact.org/index.php/ijact/article/view/157 This paper proposes an improved reversible data hiding method for encrypted images, utilizing Block Prediction Histogram Shifting Technique (BPHST). Reversible data hiding (RDH) ensures both secure data embedding and complete recovery of the original image post-extraction. Our proposed BPHST approach is based on bit-level shifting and histogram manipulation of block mean differences within encrypted image segments. The method extracts the mean difference from encrypted blocks and constructs a histogram using additive homomorphic properties, allowing precise data embedding via histogram shifting. This technique ensures that data extraction is separable from image decryption by preserving the difference prediction before and after encryption. Compared to previous methods relying on sorting, prediction, and histogram adjustment, BPHST achieves better error rate management, enhanced robustness, and secure data embedding. The proposed method effectively balances high data security, imperceptibility, and reversibility, making it suitable for sensitive multimedia applications. Furthermore, BPHST demonstrates improved Peak Signal-to-Noise Ratio (PSNR) and lower Mean Squared Error (MSE), ensuring high fidelity in image recovery. This makes BPHST a promising technique for secure, reversible information hiding in encrypted images. Jigisha Mehra, Amit Jha, Kamini Maheshwar ##submission.copyrightStatement## http://ijact.org/index.php/ijact/article/view/157 Mon, 07 Jul 2025 18:42:11 +0000