Monalisa Sahu

Dr. Monalisa Sahu

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
3 March 2023 in Electronics
Verified
Journal Article
Open access
PDF file
SKSamar Kamil
Samar Kamil
MSMonalisa Sahu
Monalisa Sahu
RRRaghunandan K R
Raghunandan K R
Aditya Kumar SahuAditya Kumar Sahu
Aditya Kumar Sahu
Reversible data hiding (RDH) techniques recover the original cover image after data extraction. Thus, they have gained popularity in e-healthcare, law forensics, and military applications. However, histogram shifting using a reversible data embedding technique suffers from low embedding capacity and high variability. This work proposes a technique in which the distribution obtained from the cover image determines the pixels that attain a peak or zero distribution. Afterward, adjacent histogram bins of the peak point are shifted, and data embedding is performed using the least significant bit (LSB) technique in the peak pixels. Furthermore, the robustness and embedding capacity are improved using the proposed dynamic block-wise reversible embedding strategy. Besides, the secret data are encrypted before embedding to further strengthen security. The experimental evaluation suggests that the proposed work attains superior stego images with a peak signal-to-noise ratio (PSNR) of more than 58 dB for 0.9 bits per pixel (BPP). Additionally, the results of the two-sample t-test and the Kolmogorov–Smirnov test reveal that the proposed work is resistant to attacks.

16 August 2022 in CAAI Transactions on Intelligence Technology
Verified
Journal Article
Open access
MSMonalisa Sahu
Monalisa Sahu
NPNeelamadhab Padhy
Neelamadhab Padhy
SGSasanko Sekhar Gantayat
Sasanko Sekhar Gantayat
Aditya Kumar SahuAditya Kumar Sahu
Aditya Kumar Sahu
A novel local binary pattern‐based reversible data hiding (LBP‐RDH) technique has been suggested to maintain a fair symmetry between the perceptual transparency and hiding capacity. During embedding, the image is divided into various 3×3 blocks. Then, using the LBP‐based image descriptor, the LBP codes for each block are computed. Next, the obtained LBP codes are XORed with the embedding bits and are concealed in the respective blocks using the proposed pixel readjustment process. Further, each cover image (CI) pixel produces two different stego‐image pixels. Likewise, during extraction, the CI pixels are restored without the loss of a single bit of information. The outcome of the proposed technique with respect to perceptual transparency measures, such as peak signal‐to‐noise ratio and structural similarity index, is found to be superior to that of some of the recent and state‐of‐the‐art techniques. In addition, the proposed technique has shown excellent resilience to various stego‐attacks, such as pixel difference histogram as well as regular and singular analysis. Besides, the out‐off boundary pixel problem, which endures in most of the contemporary data hiding techniques, has been successfully addressed.

5 February 2021 in Sensing and Imaging
Verified
Journal Article
Closed access
PDF file
MSMonalisa Sahu
Monalisa Sahu
NPNeelamadhab Padhy
Neelamadhab Padhy
SGSasanko Sekhar Gantayat
Sasanko Sekhar Gantayat
Aditya Kumar SahuAditya Kumar Sahu
Aditya Kumar Sahu

19 September 2023 in Cryptography
Verified
Journal Article
Open access
PDF file
RRRaghunandan K R
Raghunandan K R
RDRADHAKRISHNA DODMANE
RADHAKRISHNA DODMANE
SSSurendra Shetty
Surendra Shetty
GAGanesh Aithal
Ganesh Aithal
MSMonalisa Sahu
Monalisa Sahu
Aditya Kumar SahuAditya Kumar Sahu
Aditya Kumar Sahu
Electronic commerce (E-commerce) transactions require secure communication to protect sensitive information such as credit card numbers, personal identification, and financial data from unauthorized access and fraud. Encryption using public key cryptography is essential to ensure secure electronic commerce transactions. RSA and Rabin cryptosystem algorithms are widely used public key cryptography techniques, and their security is based on the assumption that it is computationally infeasible to factorize the product of two large prime numbers into its constituent primes. However, existing variants of RSA and Rabin cryptosystems suffer from issues like high computational complexity, low speed, and vulnerability to factorization attacks. To overcome the issue, this article proposes a new method that introduces the concept of fake-modulus during encryption. The proposed method aims to increase the security of the Rabin cryptosystem by introducing a fake-modulus during encryption, which is used to confuse attackers who attempt to factorize the public key. The fake-modulus is added to the original modulus during encryption, and the attacker is unable to distinguish between the two. As a result, the attacker is unable to factorize the public key and cannot access the sensitive information transmitted during electronic commerce transactions. The proposed method’s performance is evaluated using qualitative and quantitative measures. Qualitative measures such as visual analysis and histogram analysis are used to evaluate the proposed system’s quality. To quantify the performance of the proposed method, the entropy of a number of occurrences for the pixels of cipher text and differential analysis of plaintext and cipher text is used. When the proposed method’s complexity is compared to a recent variant of the Rabin cryptosystem, it can be seen that it is more complex to break the proposed method—represented as O(ɲ× τ) which is higher than Rabin-P (O(ɲ)) algorithms.

22 December 2025 in Engineering Science and Technology, an International Journal
Verified
Journal Article
Open access
ASAditya Kumar Sahu
Aditya Kumar Sahu
MSMonalisa Sahu
Monalisa Sahu

15 October 2025 in Discover Internet of Things
Verified
Journal Article
Open access
PDF file
CRCh Rupa
Ch Rupa
JSJasmine Shaik
Jasmine Shaik
RSRayala Srikavya
Rayala Srikavya
MSMonalisa Sahu
Monalisa Sahu
Aditya Kumar SahuAditya Kumar Sahu
Aditya Kumar Sahu
In an era of growing cybersecurity threats, as evidenced by the growing reliance on medical data, it is necessary to develop strong encryption algorithms to protect sensitive data against intruders. Though existing encryption algorithms offer some security, they often fail to address the unique challenges posed by safeguarding multimedia medical data against sophisticated attacks. To enhance security, the proposed system employs a distinctive encryption algorithm that integrates a color-based approach with mathematical transformations. It begins with a randomly generated color grid to map plain text characters to hexadecimal values, which are then converted to ASCII and processed bit wise. The algorithm strengthens security further through block-level encryption, utilizing multiple rounds of encryption logic, including XOR operations and circular shifts. Experimental validation demonstrates the method’s effectiveness, with average encryption times of 0.18 s for text data, 111.03 s for image data, and 1520.47 s for video data. The system achieves a decryption error rate of 2–5%, underscoring its high reliability in reconstructing the original data. Furthermore, the proposed algorithm demonstrates resistance against known plaintext, chosen ciphertext, brute force, and differential cryptanalysis attacks, ensuring robust protection of sensitive medical data. These results position the proposed method as a robust and promising solution for addressing encryption challenges in securing sensitive medical data. Currently, the system uses a randomly generated 10\(\times\)10 fixed-length secret key; however, future work will focus on implementing a variable-length randomly generated key for increased flexibility and security.