Ahmad Gholami
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ahmad Gholami has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Mohammad Hossein Noorallahzadeh
Qom University, Qom, Iran
3 shared publications - Gholam Hossein Fath-Tabar
Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran
2 shared publications Hamid Reza Ellahi
Department of Mathematics, Faculty of Science, University of Qom, Qom 37161-46611, I. R. Iran
2 shared publications- Ramin Nasiri
Imam Hossein Comprehensive University
2 shared publications - Reza Alimoradi
Department of Computer Science, Faculty of Science, University of Qom
2 shared publications - Ali Reza Ashrafi
University of Kashan, Kashan, Iran
1 shared publication
Latest Publications
- 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.
- Open Access
- 3 April 2018
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 6 (1) , 190-200
On maximum signless Laplacian Estrada index of graphs with given parameters II
The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of G. Following the previous work in which we have identified the unique graphs with maximum signless Laplacian Estrada index with each of the given parameters, namely, number of cut edges, pendent vertices, (vertex) connectivity, and edge connectivity, in this paper we continue our characterization for two further parameters: diameter and number of cut vertices.- 3 April 2018
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 6 (1) , 190-200
Open AccessOn maximum signless Laplacian Estrada index of graphs with given parameters II
The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of G. Following the previous work in which we have identified the unique graphs with maximum signless Laplacian Estrada index with each of the given parameters, namely, number of cut edges, pendent vertices, (vertex) connectivity, and edge connectivity, in this paper we continue our characterization for two further parameters: diameter and number of cut vertices. - Open Access
- 1 September 2017
- Vol. 2 (2) , 155-167
The Signless Laplacian Estrada Index of Unicyclic Graphs
- 1 September 2017
- Vol. 2 (2) , 155-167
Open AccessThe Signless Laplacian Estrada Index of Unicyclic Graphs
- Open Access
- 1 April 2017
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 5 (1) , 70-82
Automorphism group of certain power graphs of finite groups
The power graph $\mathcal{P}(G)$ of a group $G$ is the graph with group elements as vertex set and two elements are adjacent if one is a power of the other. The aim of this paper is to compute the automorphism group of the power graph of several well-known and important classes of finite groups.- 1 April 2017
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 5 (1) , 70-82
Open AccessAutomorphism group of certain power graphs of finite groups
The power graph $\mathcal{P}(G)$ of a group $G$ is the graph with group elements as vertex set and two elements are adjacent if one is a power of the other. The aim of this paper is to compute the automorphism group of the power graph of several well-known and important classes of finite groups. - Open Access
The signless Laplacian Estrada index of tricyclic graphs
The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we show that there are exactly two tricyclic graphs with the maximal signless Laplacian Estrada index.Open AccessThe signless Laplacian Estrada index of tricyclic graphs
The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we show that there are exactly two tricyclic graphs with the maximal signless Laplacian Estrada index.