Mohammad Hossein Noorallahzadeh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mohammad Hossein Noorallahzadeh has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ahmad Gholami
Qom University, Qom, Iran
3 shared publications - Massoud Hadian Dehkordi
Iran University of Science and Technology
2 shared publications - Reza Alimoradi
Department of Computer Science, Faculty of Science, University of Qom
2 shared publications - Samaneh Mashhadi
Cryptography and Data Security Laboratory, School of Mathematics, Iran University of Science and Technology, Tehran, Iran
2 shared publications - Seyed Taghi Farahi
Cryptography and Data Security Laboratory, School of Mathematics, Iran University of Science And Technology, Narmak, Iran
2 shared publications Shahed Vahedi
University of Qom
2 shared publications
Latest Publications
- Open Access
- 2 February 2026
- Published by UK Scientific Publishing Limited in Journal of Intelligent Communication
- Vol. 5 (1) , 116-139
Novel Adaptive DCT‑Based Steganography Algorithm with Coefficient Selection Optimization for JPEG Images
In the realm of secure digital communication, balancing payload capacity with perceptual imperceptibility remains a critical challenge, particularly within lossy compression standards like JPEG. This paper proposes a robust steganography framework that addresses this trade-off by integrating adaptive Discrete Cosine Transform (DCT) modification with an edge-based selection criterion. Unlike uniform embedding approaches that indiscriminately treat all image regions, the proposed method employs Canny edge detection to categorize blocks based on texture complexity. This strategy leverages the masking properties of the Human Visual System (HVS), allocating higher payload capacities to complex, edge-rich regions where modifications are statistically less detectable. To further enhance embedding efficiency, a decimal-to-ternary (base-3) coding scheme is introduced to optimize the utilization of DCT coefficients. This mechanism is coupled with a modulo optimization search within a constrained range of , which minimizes the magnitude of necessary modifications compared to traditional binary embedding. Experimental evaluations on standard datasets, including USC-SIPI, indicate that the method maintains a Peak Signal-to-Noise Ratio (PSNR) significantly higher than traditional methods, ranging from 48 dB to 62 dB depending on the embedding rate. Furthermore, quantitative analysis demonstrates a 58.5% improvement in embedding efficiency over standard binary techniques. Consequently, this adaptive strategy offers a superior trade-off between high-capacity data hiding and resistance to statistical steganalysis compared to standard LSB and non-adaptive DCT methods.
- 2 February 2026
- Published by UK Scientific Publishing Limited in Journal of Intelligent Communication
- Vol. 5 (1) , 116-139
Open AccessNovel Adaptive DCT‑Based Steganography Algorithm with Coefficient Selection Optimization for JPEG Images
In the realm of secure digital communication, balancing payload capacity with perceptual imperceptibility remains a critical challenge, particularly within lossy compression standards like JPEG. This paper proposes a robust steganography framework that addresses this trade-off by integrating adaptive Discrete Cosine Transform (DCT) modification with an edge-based selection criterion. Unlike uniform embedding approaches that indiscriminately treat all image regions, the proposed method employs Canny edge detection to categorize blocks based on texture complexity. This strategy leverages the masking properties of the Human Visual System (HVS), allocating higher payload capacities to complex, edge-rich regions where modifications are statistically less detectable. To further enhance embedding efficiency, a decimal-to-ternary (base-3) coding scheme is introduced to optimize the utilization of DCT coefficients. This mechanism is coupled with a modulo optimization search within a constrained range of , which minimizes the magnitude of necessary modifications compared to traditional binary embedding. Experimental evaluations on standard datasets, including USC-SIPI, indicate that the method maintains a Peak Signal-to-Noise Ratio (PSNR) significantly higher than traditional methods, ranging from 48 dB to 62 dB depending on the embedding rate. Furthermore, quantitative analysis demonstrates a 58.5% improvement in embedding efficiency over standard binary techniques. Consequently, this adaptive strategy offers a superior trade-off between high-capacity data hiding and resistance to statistical steganalysis compared to standard LSB and non-adaptive DCT methods.
- Open Access
- 16 June 2025
- Published by Springer Nature in Research Square
Two Verifiable Essential Secret Image Sharing schemes((t,k,n) and (t,s,k,n)-VESIS)
In the traditional secret image sharing schemes, all shareholders have the same position. If we want to divide the shareholders into two essential and non-essential positions, we must use essential secret image sharing schemes. In this article, two verifiable essential secret image sharing schemes are introduced. In the first scheme, all essential shareholders must be present in the recovery phase, but in the second scheme, essential shareholders have their own threshold. Bilinear and multilinear mappings have been used for verification. The performed analyzes show the security and optimal efficiency of the proposed schemes.
- 16 June 2025
- Published by Springer Nature in Research Square
Open AccessTwo Verifiable Essential Secret Image Sharing schemes((t,k,n) and (t,s,k,n)-VESIS)
In the traditional secret image sharing schemes, all shareholders have the same position. If we want to divide the shareholders into two essential and non-essential positions, we must use essential secret image sharing schemes. In this article, two verifiable essential secret image sharing schemes are introduced. In the first scheme, all essential shareholders must be present in the recovery phase, but in the second scheme, essential shareholders have their own threshold. Bilinear and multilinear mappings have been used for verification. The performed analyzes show the security and optimal efficiency of the proposed schemes.
- 8 July 2024
- Published by Springer Nature in Wireless Personal Communications
- Vol. 137 (2) , 1099-1118
Verifiable Changeable Threshold Secret Image Sharing Scheme Based on LWE Problem
- 8 July 2024
- Published by Springer Nature in Wireless Personal Communications
- Vol. 137 (2) , 1099-1118
Verifiable Changeable Threshold Secret Image Sharing Scheme Based on LWE Problem
- 24 July 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (6) , 17579-17599
OPTP: A new steganography scheme with high capacity and security
- 24 July 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (6) , 17579-17599
OPTP: A new steganography scheme with high capacity and security
- 11 August 2022
- Published by Taylor & Francis in Journal of Applied Security Research
- Vol. 18 (4) , 880-924
Searchable Encryption Taxonomy: Survey
Cloud service providers allow businesses to drastically reduce their costs. However, it is good to know that most outsourced data is sensitive data. Therefore, to protect this data set from potential attacks on cloud servers, it is strongly recommended that you encrypt it before outsourcing. But cloud servers cannot search encrypted data by default. Many researchers have published work proposing efficient and secure schemes to overcome this problem. So far, many searchable encryption schemes have been published. Searchable Encryption has two main branches. 1-Symmetric searchable encryption (SSE) 2-Asymmetric searchable encryption (ASE). In this article, SE schemes are investigated in a new way. We provide a complete classification of searchable encryption schemes in terms of search type, index type, results type, security models, type of implementation, Multiplicity of users, Cryptographic Primitives, and Technique used. For each classification, the available schemes are compared. We provide an available searchable encryption solutions overview.
- 11 August 2022
- Published by Taylor & Francis in Journal of Applied Security Research
- Vol. 18 (4) , 880-924
Searchable Encryption Taxonomy: Survey
Cloud service providers allow businesses to drastically reduce their costs. However, it is good to know that most outsourced data is sensitive data. Therefore, to protect this data set from potential attacks on cloud servers, it is strongly recommended that you encrypt it before outsourcing. But cloud servers cannot search encrypted data by default. Many researchers have published work proposing efficient and secure schemes to overcome this problem. So far, many searchable encryption schemes have been published. Searchable Encryption has two main branches. 1-Symmetric searchable encryption (SSE) 2-Asymmetric searchable encryption (ASE). In this article, SE schemes are investigated in a new way. We provide a complete classification of searchable encryption schemes in terms of search type, index type, results type, security models, type of implementation, Multiplicity of users, Cryptographic Primitives, and Technique used. For each classification, the available schemes are compared. We provide an available searchable encryption solutions overview.
- Open Access
- 11 March 2022
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2022, 1-10
A Survey on Public Key Encryption with Keyword Search: Taxonomy and Methods
Given the many benefits that cloud computing brings, organizations tend to outsource most of their data to reduce a large portion of their costs, but concern about the privacy of data is a major obstacle to outsourcing sensitive data. To solve this problem, public key encryption with keyword search (PEKS) is suggested, which is a widely used method. Addressing this issue separately is beneficial because PEKS does not require a secure communication channel and key distribution. Therefore, at first glance, it seems that PEKS schemes should be used more in practical applications. Thus, reviewing and categorizing PEKS schemes are very important and necessary. In this article, we have tried to help reviewing the public key searchable encryption and categorizing these designs.
- 11 March 2022
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2022, 1-10
Open AccessA Survey on Public Key Encryption with Keyword Search: Taxonomy and Methods
Given the many benefits that cloud computing brings, organizations tend to outsource most of their data to reduce a large portion of their costs, but concern about the privacy of data is a major obstacle to outsourcing sensitive data. To solve this problem, public key encryption with keyword search (PEKS) is suggested, which is a widely used method. Addressing this issue separately is beneficial because PEKS does not require a secure communication channel and key distribution. Therefore, at first glance, it seems that PEKS schemes should be used more in practical applications. Thus, reviewing and categorizing PEKS schemes are very important and necessary. In this article, we have tried to help reviewing the public key searchable encryption and categorizing these designs.