@article {6677,
	title = {A Secret Sharing Scheme based on Integer Decomposition and Hexagonal Structure},
	journal = {International Journal of Information and Communication Technology},
	year = {Submitted},
	author = {Zender, Rouia and Lemnouar Noui and Abdessemed, Mohamed-Rida}
}
@article {6418,
	title = {Security limitations of Shamir\&rsquo;s secret sharing},
	journal = {Journal of Discrete Mathematical Sciences and Cryptography},
	year = {2022},
	pages = {1-13},
	publisher = {Taylor \& Francis},
	abstract = {
	The security is so\&nbsp;important\&nbsp;for both storing and transmitting the digital data, the choice of parameters is critical for a security system, that is, a weak parameter will make the scheme very vulnerable to attacks, for example the use of supersingular curves or anomalous curves leads to weaknesses in elliptic curve cryptosystems, for RSA cryptosystem there are some attacks for low public exponent or small private exponent. In certain circumstances the secret sharing scheme is required to decentralize the risk. In the context of the security of secret sharing schemes, it is known that for the scheme of Shamir, an unqualified set of shares cannot leak any information about the secret. This paper aims to show that the well-known Shamir{\textquoteright}s secret sharing is not always perfect and that the uniform randomization before sharing is insufficient to obtain a secure scheme. The second purpose of this paper is to give an explicit construction of weak polynomials for which the Shamir{\textquoteright}s (k,\&nbsp;n) threshold scheme is insecure in the sense that there exist a fewer than\&nbsp;k\&nbsp;shares which can reconstruct the secret. Particular attention is given to the scheme whose threshold is less than or equal to 6. It also showed that for certain threshold\&nbsp;k, the secret can be calculated by a pair of shares with the probability of 1/2. Finally, in order to address the mentioned vulnerabilities, several classes of polynomials should be avoided.

},
	isbn = {0972-0529},
	url = {https://www.tandfonline.com/doi/abs/10.1080/09720529.2021.1961902},
	author = {Lemnouar Noui}
}
@article {6419,
	title = {Some Consistency Rules for Graph Matching},
	journal = {SN Computer Science},
	volume = {3},
	number = {2},
	year = {2022},
	pages = {1-16},
	publisher = {Springer},
	abstract = {
	Graph matching is a comparison process of two objects represented as graphs through finding a correspondence between vertices and edges. This process allows defining a similarity degree (or dissimilarity) between the graphs. Generally, graph matching is used for extracting, finding and retrieving any information or sub-information that can be represented by graphs. In this paper, a new consistency rule is proposed to tackle with various problems of graph matching. After, using the proposed rule as a necessary and sufficient condition for the graph isomorphism, we generalize it for subgraph isomorphism, homomorphism and for an example of inexact graph matching. To determine whether there is a matching or not, a backtracking algorithm called CRGI2 is presented who checks the consistency rule by exploring the overall search space. The tree-search is consolidated with a tree pruning technique that eliminates the unfruitful branches as early as possible. Experimental results show that our algorithm is efficient and applicable for a real case application in the information retrieval field. On the efficiency side, due to the ability of the proposed rule to eliminate as early as possible the incorrect solutions, our algorithm outperforms the existing algorithms in the literature. For the application side, the algorithm has been successfully tested for querying a real dataset that contains a large set of e-mail messages.

},
	isbn = {2661-8907},
	url = {https://link.springer.com/article/10.1007/s42979-021-01001-z},
	author = {Benreguia, Badreddine and Moumen, Hamouma}
}
@article {6417,
	title = {Towards Intelligent Road Traffic Management Over a Weighted Large Graphs Hybrid Meta-Heuristic-Based Approach},
	journal = {Journal of Cases on Information Technology (JCIT)},
	volume = {24},
	number = {3},
	year = {2022},
	pages = {1-18},
	publisher = {IGI Global},
	abstract = {
	This paper introduces a new approach of hybrid meta-heuristics based optimization technique for decreasing the computation time of the shortest paths algorithm. The problem of finding the shortest paths is a combinatorial optimization problem which has been well studied from various fields. The number of vehicles on the road has increased incredibly. Therefore, traffic management has become a major problem. We study the traffic network in large scale routing problems as a field of application. The meta-heuristic we propose introduces new hybrid genetic algorithm named IOGA. The problem consists of finding the k optimal paths that minimizes a metric such as distance, time, etc. Testing was performed using an exact algorithm and meta-heuristic algorithm on random generated network instances. Experimental analyses demonstrate the efficiency of our proposed approach in terms of runtime and quality of the result. Empirical results obtained show that the proposed algorithm outperforms some of the existing technique in term of the optimal solution in every generation.

},
	url = {https://www.igi-global.com/article/towards-intelligent-road-traffic-management-over-a-weighted-large-graphs-hybrid-meta-heuristic-based-approach/281225},
	author = {Hayi, Mohamed Yassine and Chouiref, Zahira and Moumen, Hamouma}
}
@conference {6720,
	title = {OBDA Integration Approach for Web Analytics},
	booktitle = {International Conference on Advances in Communication Technology (ICACTCE)},
	year = {2021},
	author = {Telli, Abdelmoutia and Belazoui, Abdelouahab and Arar, Chafik}
}
@conference {6719,
	title = {Mobile and Adaptive Medical Application to Enhance Chronic Disease Self-Management},
	booktitle = { International Conference on Advances in Communication Technology (ICACTCE)},
	year = {2021},
	author = {Belazoui, Abdelouahab and Telli, Abdelmoutia and Arar, Chafik}
}
@proceedings {6715,
	title = {A Deep Learning Approach for the Diabetic Retinopathy Detection},
	journal = {International Conference on Smart City Applications SCA 2021: Innovations in Smart Cities Applications },
	year = {2021},
	abstract = {
	Diabetic retinopathy is a severe retinal disease that can blur or distort the vision of the patient. It is one of the leading causes of blindness. Early detection of diabetic retinopathy can significantly help in the treatment. The recent development in the field of AI and especially Deep learning provides ambitious solutions that can be exploited to predict, forecast and diagnose several diseases in their early phases. This work aims towards finding an automatic way to classify a given set of retina images in order to detect the diabetic retinopathy. Deep learning concepts have been used with a convolutional neural network (CNN) algorithm to build a multi-classification model that can detect and classify disease levels automatically. In this study, a CNN architecture has been applied with several parameters on a dataset of diabetic retinopathy with different structures. At the current stage of this work, obtained results are highly encouraging.

},
	url = {https://link.springer.com/chapter/10.1007/978-3-030-94191-8_37},
	author = {Sebti, Riad and Zroug, Siham and Kahloul, Laid and Benharzallah, Saber}
}
@proceedings {6714,
	title = {Products Scheduling in Reconfigurable Manufacturing System Considering the Responsiveness Index},
	journal = {22nd International Arab Conference on Information Technology (ACIT)},
	year = {2021},
	address = {Muscat, Oman},
	abstract = {
	Reconfigurable manufacturing system (RMS) is a recent manufacturing paradigm, which can easily adjust its capacity and functionality for rapid responsiveness to sudden changes in the market. The core component of RMS is called reconfigurable machine tool (RMT), which has a modular structure. The RMTs can be reconfigured into many configurations. This ability allows RMS to manufacture many types of products with high quantities. In this paper, the scheduling of products in a multi-product line is fulfilled based on three criteria: profit over cost, due date, and reconfiguration responsiveness index. The latter is the combination of reconfiguration time and reconfiguration reliability of machines. An integrated approach of maximum deviation method (MDM) and multi-criteria decision-making (MCDM) approach called technique for order preference by similarity to ideal solution (TOPSIS) is proposed as a solution approach for getting the optimal scheduling of the products to be manufactured in RMS. Weights of criteria have been calculated using MDM and ranking of products is obtained using TOPSIS. A numerical example is presented to illustrate the scheduling of products in RMS.

},
	author = {Torki, Fatima-Zohra and Kahloul, Laid and Hammani, Nadia and Belaiche, Leila and Benharzallah, Saber}
}
@proceedings {6713,
	title = {The aging effects on face recognition algorithms: the accuracy according to age groups and age gaps},
	journal = {International Conference on Artificial Intelligence for Cyber Security Systems and Privacy (AI-CSP)},
	year = {2021},
	address = {El Oued, Algeria},
	abstract = {
	This paper aims to examine the effects of aging on the efficiency of facial recognition algorithms in terms of age groups and age difference intervals. A comparative analysis of the recognition performance of two approaches is conducted for different age groups and different length time intervals between images. The first approach uses a two-dimensional discrete cosine transform (2D-DCT) and a Kernel Fisher Analysis (KFA) as description tools; classification is made using a k-NN classifier based on Euclidean distance. However, the second one is performed in two ways: first, we considered face as a single entity, then we viewed face as an independent component set. This approach makes use of Convolutional Neural Networks (CNN) for description and Support vector machines (SVM) for classification. Achieved results using the publicly accessible FG-NET face database prove that age groups influence the performance of face recognition algorithms. Also, time length lapses between images can significantly reduce the performance of face recognition.

},
	url = {https://ieeexplore.ieee.org/abstract/document/9671213},
	author = {Leila Boussaad and Boucetta, Aldjia}
}
@proceedings {6712,
	title = {Parallel Dynamic Multi-Objective Optimization Evolutionary Algorithm},
	journal = {22nd International Arab Conference on Information Technology (ACIT)},
	year = {2021},
	address = {Muscat, Oman},
	abstract = {
	Multi-objective optimization evolutionary algorithms (MOEAs) are considered as the most suitable heuristic methods for solving multi-objective optimization problems (MOPs). These MOEAs aim to search for a uniformly distributed, near-optimal and near-complete Pareto front for a given MOP. However, MOEAs fail to achieve their aim completely because of their fixed population size. To overcome this limit, an evolutionary approach of multi-objective optimization was proposed; the dynamic multi-objective evolutionary algorithms (DMOEAs). This paper deals with improving the user requirements (i.e., getting a set of optimal solutions in minimum computational time). Although, DMOEA has the distinction of dynamic population size, being an evolutionary algorithm means that it will certainly be characterized by long execution time. One of the main reasons for adapting parallel evolutionary algorithms (PEAs) is to obtain efficient results with an execution time much lower than the one of their sequential counterparts in order to tackle more complex problems. Thus, we propose a parallel version of DMOEA (i.e., PDMOEA). As experimental results, the proposed PDMOEA enhances DMOEA in terms of three criteria: improving the objective space, minimization of computational time and converging to the desired population size.

},
	url = {https://ieeexplore.ieee.org/abstract/document/9677438},
	author = {Grid, Maroua and Belaiche, Leila and Kahloul, Laid and Benharzallah, Saber}
}
@proceedings {6711,
	title = {Formal Specification and Verification of 5G Authentication and Key Agreement Protocol using mCRL2},
	journal = {International Conference on Networking and Advanced Systems (ICNAS)},
	year = {2021},
	address = {Annaba, Algeria},
	abstract = {
	The fifth-generation (5G) standard is the last telecommunication technology, widely considered to have the most important characteristics in the future network industry. The 5G system infrastructure contains three principle interfaces, each one follows a set of protocols defined by the 3rd Generation Partnership Project group (3GPP). For the next generation network, 3GPP specified two authentication methods systematized in two protocols namely 5G Authentication and Key Agreement (5G-AKA) and Extensible Authentication Protocol (EAP). Such protocols are provided to ensure the authentication between system entities. These two protocols are critical systems, thus their reliability and correctness must be guaranteed. In this paper, we aim to formally re-examine 5G-AKA protocol using micro Common Representation Language 2 (mCRL2) language to verify such a security protocol. The mCRL2 language and its associated toolset are formal tools used for modeling, validation, and verification of concurrent systems and protocols. In this context, the authentication protocol 5G-AKA model is built using Algebra of Communication Processes (ACP), its properties are specified using Modal mu-Calculus and the properties analysis exploits Model-Checker provided with mCRL2. Indeed, we propose a new mCRL2 model of 3GPP specification considering 5G-AKA protocol and we specify some properties that describe necessary requirements to evaluate the correctness of the protocol where the parsed properties of Deadlock Freedom, Reachability, Liveness and Safety are positively assessed.

},
	url = {https://ieeexplore.ieee.org/abstract/document/9628917},
	author = {Hafidi, Hossem Eddine and Hmidi, Zohra and Kahloul, Laid and Benharzallah, Saber}
}
@proceedings {6710,
	title = {Leveraging the Power of Machine Learning for Performance Evaluation Prediction in Wireless Sensor Networks},
	journal = {International Conference on Information Technology (ICIT)},
	year = {2021},
	address = {Amman, Jordan},
	abstract = {
	Formal methods are widely exploited in the performance evaluation of Wireless Sensor Networks (WSNs) protocols and algorithms. These methods help researchers to model and to analyse mathematically such protocols. Numerical results obtained by analysis and performance evaluation can be employed to prove the correctness and consistency of the designed models. However, these methods face a scalability problem when the number of components becomes very high, which is often the case in WSNs. To overcome this challenge, this paper proposes to use a Machine Learning (ML) solution to provide predictions when the number of nodes increases and the formal model becomes enable to make the analysis. Indeed, this work deals with the application of effective Artificial Neural Networks (ANNs) for the prediction of a set of crucial performance metrics of CSMA/CA-MAC protocol in WSNs when the number of nodes increases significantly in the network. This prediction process is based on prior results obtained by the formal model when the number of nodes was manageable by that formal model.

},
	url = {https://ieeexplore.ieee.org/abstract/document/9491722},
	author = {Zroug, Siham and Remadna, Ikram and Kahloul, Laid and Benharzallah, Saber and Terrissa, Sadek-Labib}
}
@proceedings {6709,
	title = {SIRAT an Arabic Text Editor Makes Real-Time Indexing and Based on the Extraction of Keywords},
	journal = {ICCSA{\textquoteright}2021 : the 2nd International Conference on Computer Science{\textquoteright}s Complex Systems and their Applications, May 25{\textendash}26, },
	year = {2021},
	address = {Oum El Bouaghi, Algeria},
	abstract = {
	Indexing stage in information retrieval process has a great importance as an essential tool for the performance of recall and precision. Despite the many studies that have been done on the indexing conducted in the last few decades, to our knowledge, no study has investigated whether indexing real-time based on keywords extraction is efficient to perform of recall and precision. Moreover, relatively fewer Arabic text indexing studies are currently available despite the enormous efforts put together to satisfy the needs of the growing number of Arabic internet users. This paper suggests a method for Arabic text indexing based on keywords extraction. The proposed method consists of two stages. The first stage conducts a real-time indexing. The second stage is a keywords extraction and updating of initial index taking into account the output of keywords extraction process. We illustrate application and the performance of this method of indexing using an Arabic text editor (SIRAT) developed and designed for this aim. We also illustrate the process of building a new form of Arabic corpus appropriate to conduct the necessary experiments. Our findings show that SIRAT successfully identifies the keywords most relevant to the document. Finally, the main contribution of this experiment is to demonstrate the effectiveness of this method compared to other methods. In addition, the paper proposes a solution to issues and deficiencies Arabic language processing suffers from, especially regarding corpora building and keywords extraction evaluation systems.

},
	url = {http://ceur-ws.org/Vol-2904/74.pdf},
	author = {Dilekh, Tahar and Benharzallah, Saber}
}
@proceedings {6707,
	title = {Discrete Large-scale Multi-Objective Teaching-Learning-Based Optimization Algorithm},
	journal = {4th International Conference on Networking, Information Systems \& Security},
	year = {2021},
	abstract = {
	This paper presents a teaching-learning-based optimization algorithm for discrete large-scale multi-objective problems (DLM-TLBO). Unlike the previous variants, the learning strategy used by each individual and the acquired knowledge are defined based on its level. The proposed approach is used to solve a bi-objective object clustering task (B-OCT) in a swarm robotic system, as a case study. The simple robots have as mission the gathering of a number of objects distributed randomly, while respecting two objectives: maximizing the clustering quality, and minimizing the energy consumed by these robots. The simulation results of the proposed algorithm are compared to those obtained by the well-known algorithm NSGA-II. The results show the superiority of the proposed DLM-TLBO in terms of the quality of the obtained Pareto front approximation and convergence speed.

},
	url = {https://dl.acm.org/doi/abs/10.1145/3454127.3456609},
	author = {Aouadj, Wafa and Abdessemed, Mohamed-Rida and Rachid Seghir}
}
@inbook {6706,
	title = {A Hybrid Approach for Shape Retrieval Using Genetic Algorithms and Approximate Distance},
	booktitle = {Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms},
	year = {2021},
	abstract = {
	This article describes how the classical algorithm of shape context (SC) is still unable to capture the part structure of some complex shapes. To overcome this insufficiency, the authors propose a novel shape-based retrieval approach that is called HybMAS-GA using a multi-agent system (MAS) and a genetic algorithm (GA). They define a new distance called approximate distance (AD) to define a SC method by AD, which called approximate distance shape context (ADSC) descriptor. Furthermore, the authors{\textquoteright} proposed HybMAS-GA is a star architecture where all shape context agents, N, are directly linked to a coordinator agent. Each retrieval agent must perform either a SC or an ADSC method to obtain a similar shape, started from its own initial configuration of sample points. This combination increases the efficiency of the proposed HybMAS-GA algorithm and ensures its convergence to an optimal images retrieval as it is shown through experimental results.

},
	url = {https://www.igi-global.com/chapter/a-hybrid-approach-for-shape-retrieval-using-genetic-algorithms-and-approximate-distance/271630},
	author = {Saliha Mezzoudj and Melkemi, Kamal-Eddine}
}
@article {6700,
	title = {A parallel content-based image retrieval system using spark and tachyon frameworks},
	journal = {Journal of King Saud University - Computer and Information Sciences},
	volume = {33},
	number = {2},
	year = {2021},
	pages = {141-149},
	abstract = {
	With the huge increase of large-scale multimedia over Internet, especially images, building Content-Based Image Retrieval (CBIR) systems for large-scale images has become a big challenge. One of the drawbacks associated with CBIR is the very long execution time. In this article, we propose a fast Content-Based Image Retrieval system using Spark (CBIR-S) targeting large-scale images. Our system is composed of two steps.\&nbsp;(i) image indexation step, in which we use\&nbsp;MapReduce\&nbsp;distributed model on Spark in order to speed up the indexation process. We also use a memory-centric\&nbsp;distributed storage system, called Tachyon, to enhance the write operation\&nbsp;(ii) image retrieving step\&nbsp;which we speed up by using a parallel k-Nearest Neighbors (k-NN) search method based on\&nbsp;MapReduce model\&nbsp;implemented under\&nbsp;Apache Spark, in addition to exploiting the cache method of spark framework. We have showed, through a wide set of experiments, the effectiveness of our approach in terms of processing time.

},
	url = {https://www.sciencedirect.com/science/article/pii/S1319157818307146},
	author = {Saliha Mezzoudj}
}
@article {6697,
	title = {A Reliable Behavioral Model: Optimizing Energy Consumption and Object Clustering Quality by Na{\"\i}ve Robots},
	journal = {International Journal of Swarm Intelligence Research (IJSIR)},
	volume = {12},
	number = {4},
	year = {2021},
	abstract = {
	This study concerns a swarm of autonomous reactive mobile robots, qualified of na{\"\i}ve because of their simple constitution, having the mission of gathering objects randomly distributed while respecting two contradictory objectives: maximizing quality of the emergent heap-formation and minimizing energy consumed by aforesaid robots. This problem poses two challenges: it is a multi-objective optimization problem and it is a hard problem. To solve it, one of renowned multi-objective evolutionary algorithms is used. Obtained solution, via a simulation process, unveils a close relationship between behavioral-rules and consumed energy; it represents the sought behavioral model, optimizing the grouping quality and energy consumption. Its reliability is shown by evaluating its robustness, scalability, and flexibility. Also, it is compared with a single-objective behavioral model. Results{\textquoteright} analysis proves its high robustness, its superiority in terms of scalability and flexibility, and its longevity measured based on the activity time of the robotic system that it integrates.

},
	url = {https://www.igi-global.com/article/a-reliable-behavioral-model/290283},
	author = {Aouadj, Wafa and Abdessemed, Mohamed-Rida}
}
@article {6678,
	title = {A Multi-Population Genetic Algorithm for Adaptive QoS-Aware Service Composition in FogIoT Healthcare Environment},
	journal = {The International Arab Journal of Information Technology},
	volume = {18},
	number = {2},
	year = {2021},
	abstract = {
	The growth of Internet of Thing (IoT) implies the availability of a very large number of services which may be similar or the same, managing the Quality of Service (QoS) helps to differentiate one service from another. The service composition provides the ability to perform complex activities by combining the functionality of several services within a single process. Very few works have presented an adaptive service composition solution managing QoS attributes, moreover in the field of healthcare, which is one of the most difficult and delicate as it concerns the precious human life.In this paper, we will present an adaptive QoS-Aware Service Composition Approach (P-MPGA) based on multi-population genetic algorithm in Fog-IoT healthcare environment. To enhance Cloud-IoT architecture, we introduce a Fog-IoT 5-layared architecture. Secondly, we implement a QoS-Aware Multi-Population Genetic Algorithm (P-MPGA), we considered 12 QoS dimensions, i.e., Availability (A), Cost (C), Documentation (D), Location (L), Memory Resources (M), Precision (P), Reliability (R), Response time (Rt), Reputation (Rp), Security (S), Service Classification (Sc), Success rate (Sr), Throughput (T). Our P-MPGA algorithm implements a smart selection method which allows us to select the right service. Also, P-MPGA implements a monitoring system that monitors services to manage dynamic change of IoT environments. Experimental results show the excellent results of P-MPGA in terms of execution time, average fitness values and execution time / best fitness value ratio despite the increase in population. P-MPGA can quickly achieve a composite service satisfying user{\textquoteright}s QoS needs, which makes it suitable for a large scale IoT environment.

},
	url = {http://iajit.org/PDF/Special\%20Issue\%202021,\%20No.\%203A/20684.pdf},
	author = {Aoudia Idir and Benharzallah Saber and Kahloul Laid and Kazar Okba}
}
@article {6421,
	title = {Adoption of social robots as pedagogical aids for efficient learning of second language vocabulary to children},
	journal = {Journal of e-Learning and Knowledge Society},
	volume = {17},
	number = {3},
	year = {2021},
	pages = {119-126},
	abstract = {
	In this digital age embracing robotics across various areas of life, especially intellectual ones, have reaped great benefits owing to this modern technology. Therefore, the learning field has not remained unchanged given current evolutions as the schooling conditions have been improved through these smart devices. However, teachers still face some difficulties when choosing pedagogical methods and means for effective language learning for children. Thus, this paper aims to measure the effectiveness of social robots in facilitating children{\textquoteright}s learning of a second language (L2). For this purpose, the term L2 learning and its subordinate concepts have been distinguished, and then the different methods of language learning were discussed. The latest research regarding social robots in the educational context was also discussed when reviewing the literature. An experimental study conducted on a sample of children illustrated that the use of the social robot significantly helped them in the L2 learning regarding the assimilation fast, retention, and correct pronunciation of its vocabulary. Finally, this study concludes that the social robot would be a good solution and recommends their widespread use in education given its role in improving the schooling conditions of children.

},
	isbn = {1971-8829},
	url = {http://je-lks.org/ojs/index.php/Je-LKS_EN/article/view/1135551},
	author = {Arar, Chafik and Belazoui, Abdelouahab and Telli, Abdelmoutia}
}
@article {6422,
	title = {A Discrete Crow Search Algorithm for Mining Quantitative Association Rules},
	journal = {International Journal of Swarm Intelligence Research (IJSIR)},
	volume = {12},
	number = {4},
	year = {2021},
	pages = {101-124},
	publisher = {IGI Global},
	abstract = {
	Association rules are the specific data mining methods aiming to discover explicit relations between the different attributes in a large dataset. However, in reality, several datasets may contain both numeric and categorical attributes. Recently, many meta-heuristic algorithms that mimic the nature are developed for solving continuous problems. This article proposes a new algorithm, DCSA-QAR, for mining quantitative association rules based on crow search algorithm (CSA). To accomplish this, new operators are defined to increase the ability to explore the searching space and ensure the transition from the continuous to the discrete version of CSA. Moreover, a new discretization algorithm is adopted for numerical attributes taking into account dependencies probably that exist between attributes. Finally, to evaluate the performance, DCSA-QAR is compared with particle swarm optimization and mono and multi-objective evolutionary approaches for mining association rules. The results obtained over real-world datasets show the outstanding performance of DCSA-QAR in terms of quality measures.

},
	url = {https://www.igi-global.com/article/a-discrete-crow-search-algorithm-for-mining-quantitative-association-rules/290282},
	author = {Ledmi, Makhlouf and Moumen, Hamouma and Siam, Abderrahim and Haouassi, Hichem and Azizi, Nabil}
}
@article {6427,
	title = {DS-kNN: An Intrusion Detection System Based on a Distance Sum-Based K-Nearest Neighbors},
	journal = {International Journal of Information Security and Privacy (IJISP)},
	volume = {15},
	number = {2},
	year = {2021},
	pages = {131-144},
	publisher = {IGI Global},
	abstract = {
	On one hand, there are many proposed intrusion detection systems (IDSs) in the literature. On the other hand, many studies try to deduce the important features that can best detect attacks. This paper presents a new and an easy-to-implement approach to intrusion detection, named distance sum-based k-nearest neighbors (DS-kNN), which is an improved version of k-NN classifier. Given a data sample to classify, DS-kNN computes the distance sum of the k-nearest neighbors of the data sample in each of the possible classes of the dataset. Then, the data sample is assigned to the class having the smallest sum. The experimental results show that the DS-kNN classifier performs better than the original k-NN algorithm in terms of accuracy, detection rate, false positive, and attacks classification. The authors mainly compare DS-kNN to CANN, but also to SVM, S-NDAE, and DBN. The obtained results also show that the approach is very competitive.

},
	url = {https://www.igi-global.com/article/ds-knn/276388},
	author = {Taguelmimt, Redha and Beghdad, Rachid}
}
@article {6423,
	title = {A hierarchical formal method for performance evaluation of WSNs protocol},
	journal = {Computing},
	volume = {103},
	number = {6},
	year = {2021},
	pages = {1183-1208},
	publisher = {Springer},
	abstract = {
	The design and the evaluation of communication protocols in WSNs is a crucial issue. Generally, researchers use simulation methods to evaluate them. However, formal modelling and analysis techniques are an efficient alternative to simulation methods. Indeed, these techniques allow performance evaluation and model verification. In this paper, a formal approach is proposed to modelling and to evaluating the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) MAC protocol with a star topology. Moreover, the proposed approach deals with some properties that are not stated in most existing works. The approach uses Hierarchical Timed Coloured Petri Nets (HTCPNs) formalism to model the protocol and exploits the CPN-Tools to analyse the generated models. HTCPNs provide timed aspect which facilitates the consideration of time constraints inherent to the CSMA/CA protocol.

},
	isbn = {1436-5057},
	url = {https://link.springer.com/article/10.1007/s00607-020-00898-3},
	author = {Zroug, Siham and Kahloul, Laid and Benharzallah, Saber and Djouani, Karim}
}
@article {6420,
	title = {A Multi-Population Genetic Algorithm for Adaptive QoS-Aware Service Composition in Fog-IoT Healthcare Environment},
	journal = {Int. Arab. J. Inf. Technol},
	volume = {18},
	year = {2021},
	pages = {464-475},
	abstract = {
	The growth of Internet of Thing (IoT) implies the availability of a very large number of services which may be similar or the same, managing the Quality of Service (QoS) helps to differentiate one service from another. The service composition provides the ability to perform complex activities by combining the functionality of several services within a single process. Very few works have presented an adaptive service composition solution managing QoS attributes, moreover in the field of healthcare, which is one of the most difficult and delicate as it concerns the precious human life.In this paper, we will present an adaptive QoS-Aware Service Composition Approach (P-MPGA) based on multi-population genetic algorithm in Fog-IoT healthcare environment. To enhance Cloud-IoT architecture, we introduce a Fog-IoT 5-layared architecture. Secondly, we implement a QoS-Aware Multi-Population Genetic Algorithm (P-MPGA), we considered 12 QoS dimensions, i.e., Availability (A), Cost (C), Documentation (D), Location (L), Memory Resources (M), Precision (P), Reliability (R), Response time (Rt), Reputation (Rp), Security (S), Service Classification (Sc), Success rate (Sr), Throughput (T). Our P-MPGA algorithm implements a smart selection method which allows us to select the right service. Also, P-MPGA implements a monitoring system that monitors services to manage dynamic change of IoT environments. Experimental results show the excellent results of P-MPGA in terms of execution time, average fitness values and execution time / best fitness value ratio despite the increase in population. P-MPGA can quickly achieve a composite service satisfying user{\textquoteright}s QoS needs, which makes it suitable for a large scale IoT environment

},
	url = {https://iajit.org/PDF//Special\%20Issue\%202021,\%20No.\%203A/20684.pdf},
	author = {Aoudia, Idir and Benharzallah, Saber and Kahloul, Laid and Kazar, Okba}
}
@article {6425,
	title = {Performance evaluation of ODMAC protocol for WSNs powered by ambient energy},
	journal = {International Journal of Simulation and Process Modelling},
	volume = {17},
	number = {1},
	year = {2021},
	pages = {67-78},
	publisher = {Inderscience Publishers (IEL)},
	abstract = {
	Designing a good MAC protocol remains a challenge. Such a protocol has to guarantee access to the medium while reducing energy consumption. With the appearance of energy harvesting-wireless sensor networks (EH-WSNs), energy is no longer a problem but the challenge now is that each sensor remains in its energetically sustainable state as much as possible. This paper proposes a formal study of on demand MAC (ODMAC) one of the well-known protocols proposed for EH-WSNs. An analysis through statistical model checking is made where properties that guarantee the protocol{\textquoteright}s correctness are verified and a performance evaluation of important aspects is achieved.

},
	isbn = {1740-2123},
	url = {https://www.inderscienceonline.com/doi/abs/10.1504/IJSPM.2021.120853},
	author = {Hmidi, Zohra and Kahloul, Laid and Benharzallah, Saber and Hamani, Nadia}
}
@article {6424,
	title = {A Personalized Recommendation for Web API Discovery in Social Web of Things},
	journal = {INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY},
	volume = {18},
	number = {3 A},
	year = {2021},
	pages = {438-445},
	publisher = {ZARKA PRIVATE UNIV COLL COMPUTING \& INFORMATION SOC, PO BOX 132222, ZARQA~{\textellipsis}},
	abstract = {
	With the explosive growth of Web of Things (WoT) and social web, it is becoming hard for device owners and users to find suitable web Application Programming Interface (API) that meet their needs among a large amount of web APIs. Socialaware and collaborative filtering-based recommender systems are widely applied to recommend personalized web APIs to users and to face the problem of information overload. However, most of the current solutions suffer from the dilemma of accuracydiversity where the prediction accuracy gains are typically accompanied by losses in the diversity of the recommended APIs due to the influence of popularity factor on the final score of APIs (e.g., high rated or high-invoked APIs). To address this problem, the purpose of this paper is developing an improved recommendation model called (Personalized Web API Recommendation) PWR, which enables to discover APIs and provide personalized suggestions for users without sacrificing the recommendation accuracy. To validate the performance of our model, seven variant algorithms of different approaches (popularity-based, userbased and item-based) are compared using MovieLens 20M dataset. The experiments show that our model improves the recommendation accuracy by 12\% increase with the highest score among compared methods. Additionally it outperforms the compared models in diversity over all lengths of recommendation lists. It is envisaged that the proposed model is useful to accurately recommend personalized web API for users.

},
	isbn = {1683-3198},
	url = {https://iajit.org/portal/PDF/Special\%20Issue\%202021,\%20No.\%203A/20682.pdf},
	author = {Meissa, Marwa and Benharzallah, Saber and Kahloul, Laid and Kazar, Okba}
}
@article {6426,
	title = {Web-Based Learning Under Tacit Mining of Various Data Sources.},
	journal = {International Journal of Emerging Technologies in Learning},
	volume = {16},
	number = {16},
	year = {2021},
	abstract = {
	Nowadays, many platforms provide open educational resources to learners. So, they must browse and explore several suggested contents to better assimilate their courses. To facilitate the selecting task of these resources, the present paper proposes an intelligent tutoring system that can access teaching contents available on the web automatically and offers them to learners as additional information sources. In doing so, the authors highlight the description logic approach and its knowledge representation strength that underwrites the modulization, inference, and querying about a web ontology language, and enhanced traditional tutoring systems architecture using ontologies and description logic to enable them to access various data sources on the web. Finally, this article concludes that the combination of machine learning with the semantic web has provided a supportive study environment and enhanced the schooling conditions within open and distance learning.

},
	isbn = {1863-0383},
	url = {https://online-journals.org/index.php/i-jet/article/view/23405},
	author = {Belazoui, Abdelouahab and Telli, Abdelmoutia and Arar, Chafik}
}
@proceedings {6718,
	title = {Social-aware Web API Recommendation in IoT},
	journal = {21st International Arab Conference on Information Technology (ACIT)},
	year = {2020},
	address = {Giza, Egypt},
	abstract = {
	The core idea of IoT is the connectivity of real-world devices to the Internet, which allows them to expose their functionalities in APIs ways, communicate to other entities, and flow their data over internet. With the massive growth of connected IoT devices, the number of APIs have also increased. Thus, led up to overload information problem, which is making APIs selection more and more difficult for devices owners and users. Therefore, this paper propose web APIs recommendation framework in IoT environment based on social relationships. The main purpose is providing a novel Recommendation method, which enable to discover APIs and provide relevant suggestion for users. The proposed hybrid algorithm is combined content-based filtering and collaborative filtering techniques to improve the accuracy of rating prediction. Finally, experiments are conducted to evaluate the performance of recommendation.

},
	url = {https://ieeexplore.ieee.org/abstract/document/9300092},
	author = {Meissa, Marwa and Benharzallah, Saber and Kahloul, Laid and Kazar, Okba}
}
@proceedings {6717,
	title = {An Intelligent and Secure Health Monitoring System Based on Agent},
	journal = {IEEE International Conference on Informatics, IoT, and Enabling Technologies (ICIoT)},
	year = {2020},
	address = {Doha, Qatar},
	abstract = {
	In this paper, we propose a novel, secure, and intelligent IoT approach based on agent, we have implemented in the health care domain, where we developed an intelligent patient monitoring system for monitoring the patients heart rate automatically. Our system is more intelligent that can anticipate the critical condition before it even happens, send a message to the patient family, doctors, nurses, as well as hospital in-charge personal, and launch an alarm to be assisted by the nearest people in place. Also, our architecture ensures the authentication, authorization, and data sensing confidentiality. Hospitals and medical clinics can utilize our system to monitor their outpatients who are in danger of unpredictable health conditions. The approach presented in the paper can also be applied to other IoT domains.

},
	url = {https://ieeexplore.ieee.org/abstract/document/9089602},
	author = {Ahmid, Maroua and Kazar, Okba and Benharzallah, Saber and Kahloul, Laid and Merizig, Abdelhak}
}
@proceedings {6716,
	title = {QoS-aware service composition in Fog-IoT computing using multi-population genetic algorithm},
	journal = {21st International Arab Conference on Information Technology (ACIT)},
	year = {2020},
	address = {Giza, Egypt},
	abstract = {
	The Internet of things (IoT) is the integration of information space and physical space, becoming more and more popular in several places. In this paper, we will present QoS service composition approach based on multi-population genetic algorithm based on Fog-IoT computing, IoT-cloud architecture problems led us to use the 5-layared architecture implemented on a Fog computing system especially the transport layer. Our work was focus on this transport layer where we divided it into four sub-layers (security, storage, pre-processing \&amp; monitoring), it allows us to have promising advantages. Secondly, we implemented a multi-population genetic algorithm (MPGA) based on a QoS model, we considered seven QoS dimensions, i.e. Cost, response time, reliability, reputation, location, security and availability. Experimental results show the excellent results of MPGA in terms of fitness value and execution time to handle our ambulance emergency study case.

},
	url = {https://ieeexplore.ieee.org/abstract/document/9300090},
	author = {Aoudia, Idir and Benhazrallah, Saber and Kahloul, Laid and Kazar, Okba}
}
@proceedings {6708,
	title = {A Feature-based Fragile Watermarking for Tamper Detection using Voronoi Diagram Decomposition},
	journal = { 10th International Conference on Computer Science, Engineering and Applications (CCSEA 2020)},
	year = {2020},
	abstract = {
	In this paper, we have proposed a novel feature-based fragile watermarking scheme for image authentication. The proposed technique extracts Feature Points (FP) by performing the Harris corner detector and used them as germs to decomposes the host image in segments using Voronoi Diagram (VD). The authentication of each segment is guaranteed by using the Cyclic Redundancy Check code (CRC). Then, the CRC encoding procedure is applied to each segment to generate the watermark. Voronoi decomposition is employed because it has a good retrieval performance compared to similar geometrical decomposition algorithms. The security aspect of our proposed method is achieved by using the public key crypto-system RSA (Rivest{\textendash}Shamir{\textendash}Adleman) to encrypt the FP. Experimental results demonstrate the efficiency of our approach in terms of imperceptibility, the capability of detection of alterations, the capacity of embedding, and computation time. We have also prove the impact of VD decomposition on the quality of the watermarked image compared to block decomposition. The proposed method can be applicable in the case where the tamper detection is critical and only some regions of interest must be re-transmitted if they are corrupted, like in the case of medical images. An example of the application of our approach to medical image is briefly presented.

},
	url = {https://aircconline.com/csit/papers/vol10/csit101012.pdf},
	author = {GOLEA, Nour-El-Houda and Melkemi, Kamal-Eddine}
}
@proceedings {6705,
	title = {Weaknesses of Shamir\&rsquo;ssecret sharing scheme},
	journal = {International Conference on Computational Techniques and iIntelligent Machines, ICCTIM-},
	year = {2020},
	address = {Bathinda, India},
	author = {Lemnouar Noui}
}
@article {6704,
	title = {A Different Encryption System Based on the Integer Factorization Problem},
	journal = {Malaysian Journal of Computing and Applied Mathematics},
	volume = {3},
	number = {1},
	year = {2020},
	pages = {50-54},
	abstract = {
	We present a new computational problem in this paper, namely the order of a group element problem which is based on the factorization problem, and we analyze its applications in cryptography. We present a new one-way function and from this function we propose a homomorphic probabilistic scheme for encryption. Our scheme, provably secure under the new computational problem in the standard model.

},
	url = {https://www.sciencegate.app/document/10.37231/myjcam.2020.3.1.43},
	author = {Karima Djebaili and Lamine Melkemi}
}
@article {6703,
	title = {Using Hierarchical Timed Coloured Petri Nets in the formal study of TRBAC security policies},
	journal = {International Journal of Information Security },
	volume = {19},
	year = {2020},
	pages = {163{\textendash}187 },
	abstract = {
	Role-Based Access Control (RBAC) is one of the most used models in designing and implementation of security policies, in large networking systems. Basic RBAC model does not consider temporal aspects which are so important in such policies. Temporal RBAC (TRBAC) is proposed to deal with these temporal aspects. Despite the elegance of these models, designing a security policy remains a challenge. Designers must ensure the consistency and the correctness of the policy. The use of formal methods provides techniques for proving that the designed policy is consistent. In this paper, we present a formal modelling/analysis approach of TRBAC policies. This approach uses Hierarchical Timed Coloured Petri Nets (HTCPN) formalism to model the TRBAC policy, and the CPN-tool to analyse the generated models. The timed aspect, in HTCPN, facilitates the consideration of temporal constraints introduced in TRBAC. The hierarchical aspect of HTCPN makes the model {\textquotedblleft}manageable{\textquotedblright}, in spite of the complexity of TRBAC policy specification. The analysis phase allows the verification of many important properties about the TRBAC security policy.

},
	url = {https://link.springer.com/article/10.1007/s10207-019-00448-9},
	author = {Ben-Attia, Hasiba and Kahloul, Laid and Benhazrallah, Saber and Bourekkache , Samir}
}
@article {6702,
	title = {Using priced timed automata for the specification and verification of CSMA/CA in WSNs},
	journal = {International Journal of Information and Communication Technology},
	volume = {17},
	number = {2},
	year = {2020},
	abstract = {
	Several contention-based MAC protocols for WSNs have been proposed. The control channel is accessed with carrier sense multiple access with collision avoidance (CSMA/CA) method. The complexity of this method and its criticality motivate the formal specification and verification of its basic algorithms. Most existing works do not deal with all possible aspects such as topology, number of nodes, node behaviour, and number of possible retransmissions. In this paper, we propose a stochastic generic model for the 802.11 MAC protocol for an arbitrary network topology which is independent of the number of sensors. In addition to the qualitative evaluation that proves the correctness of the model, we will make a quantitative evaluation using the statistical model checking to measure the probabilistic performance of the protocol.

},
	url = {https://www.inderscience.com/info/inarticle.php?artid=108963},
	author = {Hmidi, Zohra and Kahloul, Laid and Benharzallah, Saber}
}
@article {6701,
	title = {A new approach agent-based for distributing association rules by business to improve decision process in ERP systems},
	journal = {International Journal of Information and Decision Sciences},
	volume = {12},
	number = {1},
	year = {2020},
	pages = {1-35},
	abstract = {
	Nowadays, the distributed computing plays an important role in the data mining process. To make systems scalable it is important to develop mechanisms that distribute the workload among several sites in a flexible way. Moreover, the acronym ERP refers to the systems and software packages used by organisations to manage day-by-day business activities. ERP systems are designed for the defined schema that usually has a common database. In this paper, we present a collaborative multi-agent based system for association rules mining from distributed databases. In our proposed approach, we combine the multi-agent system with association rules as a data mining technique to build a model that can execute the association rules mining in a parallel and distributed way from the centralised ERP database. The autonomous agents used to provide a generic and scalable platform. This will help business decision-makers to take the right decisions and provide a perfect response time using multi-agent system. The platform has been compared with the classic association rules algorithms and has proved to be more efficient and more scalable.

},
	url = {https://www.inderscience.com/info/inarticle.php?artid=104993},
	author = {Zoubeidi, Merouane and Kazar, Okba and Benharzallah, Saber and Mesbahi, Nadjib and Merizig, Abdelhak and Rezki, Djamil}
}
@article {6699,
	title = {A Hybrid Protocol to Solve Authenticated Byzantine Consensus},
	journal = {Fundamenta Informaticae},
	volume = {173},
	number = {1},
	year = {2020},
	pages = {73-89},
	abstract = {
	The consensus is a central problem of fault-tolerant distributed computing. Unfortunately, solving such a problem is impossible in asynchronous distributed systems prone to process failures. To circumvent this impossibility (known as FLP impossibility result) in a deterministic way, on top of asynchronous distributed systems enriched with additional assumptions, several protocols have been proposed. Actually, to solve the Byzantine Consensus problem, with a deterministic manner, in systems where at most t processes may exhibit a Byzantine behavior, two approaches have been investigated. The first relies on the addition of synchrony, called Timer-Based, while the second, called Time-Free, is based on the pattern of message exchange. This paper shows that both types of assumptions are not antagonist and can be combined to solve authenticated Byzantine consensus. The combined assumption considers a correct process pi, called ⋄{\textlangle}t + 1{\textrangle}-BW, and a set X of t+1 correct processes (including pi itself) such that, eventually, for each query broadcasted by a correct process pj of X, pj receives a response from pi ∈ X among the (n {\textendash} t) first responses to that query or both links connecting pi and pj are timely. Based on this combination, a simple hybrid authenticated Byzantine consensus protocol benefiting from the best of both worlds is proposed. As a matter of fact, although numerous hybrid protocols have been designed for the consensus problem in the crash model, this is, to our knowledge, the first hybrid deterministic solution to the Byzantine consensus problem.

},
	url = {https://content.iospress.com/articles/fundamenta-informaticae/fi1916},
	author = {Tioura, Abdelhamid and Moumen, Hamouma and Kalla, Hamoudi and Ait-Saidi, Ahmed}
}
@article {6698,
	title = {Tracking covid-19 by tracking infectious trajectories},
	journal = { IEEE Access},
	volume = {8},
	year = {2020},
	pages = {145242 - 145255},
	abstract = {
	Nowadays, the coronavirus pandemic has and is still causing large numbers of deaths and infected people. Although governments all over the world have taken severe measurements to slow down the virus spreading (e.g., travel restrictions, suspending all sportive, social, and economic activities, quarantines, social distancing, etc.), a lot of persons have died and a lot more are still in danger. Indeed, a recently conducted study [1] has reported that 79\% of the confirmed infections in China were caused by undocumented patients who had no symptoms. In the same context, in numerous other countries, since coronavirus takes several days before the emergence of symptoms, it has also been reported that the known number of infections is not representative of the real number of infected people (the actual number is expected to be much higher). That is to say, asymptomatic patients are the main factor behind the large quick spreading of coronavirus and are also the major reason that caused governments to lose control over this critical situation. To contribute to remedying this global pandemic, in this article, we propose an IoT\&nbsp;a\&nbsp;investigation system that was specifically designed to spot both undocumented patients and infectious places. The goal is to help the authorities to disinfect high-contamination sites and confine persons even if they have no apparent symptoms. The proposed system also allows determining all persons who had close contact with infected or suspected patients. Consequently, rapid isolation of suspicious cases and more efficient control over any pandemic propagation can be achieved.

},
	url = {https://ieeexplore.ieee.org/document/9162031},
	author = {Benreguia, Badreddine and Moumen, Hamouma and Merzoug, Mohammed-Amine}
}
@article {6695,
	title = {A Novel Image Encryption Approach Using Polar Decomposition and Orthogonal Matrices},
	journal = {Malaysian Journal of Computing and Applied Mathematics },
	volume = {3},
	number = {1},
	year = {2020},
	pages = {27-34},
	abstract = {
	Information security is one of the important issues in the information age, image encryption algorithms have been increasingly studied to guarantee the secure image transmission over the internet and through wireless networks. In this article, we propose a new approach for image encryption based on polar decomposition and orthogonal matrices. This scheme offers good confusion and diffusion qualities. The proposed algorithm is shown to be secure against important cryptanalytic attacks (statistical attacks, sensitivity dependence, differential attacks, brute force attacks...), theoretical analysis and computer simulations both confirm that it has a high security level.

},
	url = {https://myfik.unisza.edu.my/myjcam/index.php/myjcam/article/view/40},
	author = {Oussama Noui and Barkat, Amine and Assia Beloucif}
}
@article {6694,
	title = {New chaotic cryptosystem for the image encryption},
	journal = {International Journal of Information and Computer Security},
	volume = {12},
	number = {4},
	year = {2020},
	pages = {450-463},
	abstract = {
	Recent researches of image encryption algorithms have been increasingly based on chaotic systems. This paper, a new image encryption scheme which employs. The idea is to associate the H{\'e}non attractor and the logistics map, for the construction of a new secret key cryptosystem. We generate values through of the logistics map that will be added to the pixels of the plaintext image. This result modulo 256 will be permuted to another position of the encrypted image. The calculation of this permutation is deducted from the H{\'e}non attractor, which is 2-dimensional, in order to have a significantly increasing the resistance to attacks. The proposed system has the advantage of bigger key space (about 180 bits); high security analysis such as key space analysis, statistical analysis and sensitivity analysis were carried out. The results demonstrate that the proposed system is highly efficient and a robust system.

},
	url = {https://www.inderscience.com/info/inarticle.php?artid=107452},
	author = {Merzoug, Assia and Adda, Ali-Pacha and Hadj-Said, Naima}
}
@article {5236,
	title = {Sensitive and Energetic IoT Access Control for Managing Cloud Electronic Health Records},
	journal = {IEEE Access},
	volume = {7},
	year = {2019},
	pages = {86384 - 86393},
	abstract = {Electronic health records (EHRs) replaced the old paper-based systems to make patient data more accurate, reliable, and more accessible. Yet, the EHRs system requires high transmission cost, energy, and waste of time for both doctors and patients. Furthermore, EHRs security presents a serious issue threatening the patient{\textquoteright}s privacy. Most of the third-party hosting systems have some issues related to the users{\textquoteright} privacy and data security. Hence, it is necessary to restrict the access control policies and develop efficient mechanisms for cloud-based EHRs data. In this paper, a sensitive and energetic access control (SE-AC) mechanism is proposed for managing the cloud-hosted EHRs and providing a fine-grained access control even in critical situations. The proposed mechanism ensures the confidentiality of the patient{\textquoteright}s data, where only authorized individuals to have permission to be able to edit or review certain of the patient{\textquoteright}s data. Each EHR data is encrypted by the managing authority before submitting to the cloud storage. The requesting user can get dynamically changing permissions based on authentication and context attributes. In addition, seven major aspects have been quantified to assess the operation of any access control that could be deployed in the Internet-of-Thing (IoT). The security analysis indicates that the SE-AC mechanism is secure and will prevent any unauthorized access. The results show exceptional compatibility and performance with different setups and configuration.},
	author = {Khaled Riad and Rafik Hamza and Hongyang Yan}
}
@article {5233,
	title = {Two dimensional ElGamal public key cryptosystem},
	journal = {Information Security Journal: A Global Perspective},
	volume = {28},
	number = {4-5},
	year = {2019},
	pages = {120-126},
	abstract = {In this work, we propose a secure version of ElGamal public key cryptosystem, and prove that it is semantically secure assuming the hardness of what we call the two-dimensional decisional Diffie-Hellman (2DDDH) problem, this cryptosystem is distinguished by the speed of encryption and decryption processes and by its resistance to active adversaries. Since the 2DDDH problem is harder than the decisional Diffie-Hellman (DDH) problem (as it will be seen), one may conclude that our model reinforces the exchange security compared to the existed cryptosystems falling within the same context, also we discuss the difficult problems that guarantee its security.},
	author = {Karima Djebaili and Lamine Melkemi}
}
@article {5236,
	title = {Sensitive and Energetic IoT Access Control for Managing Cloud Electronic Health Records},
	journal = {IEEE Access },
	volume = {7},
	year = {2019},
	pages = {86384 - 86393},
	abstract = {
	Electronic health records (EHRs) replaced the old paper-based systems to make patient data more accurate, reliable, and more accessible. Yet, the EHRs system requires high transmission cost, energy, and waste of time for both doctors and patients. Furthermore, EHRs security presents a serious issue threatening the patient{\textquoteright}s privacy. Most of the third-party hosting systems have some issues related to the users{\textquoteright} privacy and data security. Hence, it is necessary to restrict the access control policies and develop efficient mechanisms for cloud-based EHRs data. In this paper, a sensitive and energetic access control (SE-AC) mechanism is proposed for managing the cloud-hosted EHRs and providing a fine-grained access control even in critical situations. The proposed mechanism ensures the confidentiality of the patient{\textquoteright}s data, where only authorized individuals to have permission to be able to edit or review certain of the patient{\textquoteright}s data. Each EHR data is encrypted by the managing authority before submitting to the cloud storage. The requesting user can get dynamically changing permissions based on authentication and context attributes. In addition, seven major aspects have been quantified to assess the operation of any access control that could be deployed in the Internet-of-Thing (IoT). The security analysis indicates that the SE-AC mechanism is secure and will prevent any unauthorized access. The results show exceptional compatibility and performance with different setups and configuration.

},
	author = {Khaled Riad and Rafik Hamza and Hongyang Yan}
}
@article {5233,
	title = {Two dimensional ElGamal public key cryptosystem},
	journal = {Information Security Journal: A Global Perspective },
	volume = {28},
	number = {4-5},
	year = {2019},
	pages = { 120-126},
	abstract = {
	In this work, we propose a secure version of ElGamal public key cryptosystem, and prove that it is semantically secure assuming the hardness of what we call the two-dimensional decisional Diffie-Hellman (2DDDH) problem, this cryptosystem is distinguished by the speed of encryption and decryption processes and by its resistance to active adversaries. Since the 2DDDH problem is harder than the decisional Diffie-Hellman (DDH) problem (as it will be seen), one may conclude that our model reinforces the exchange security compared to the existed cryptosystems falling within the same context, also we discuss the difficult problems that guarantee its security.

},
	author = {Karima Djebaili and Lamine Melkemi}
}
@article {5215,
	title = {A Bayer pattern-based fragile watermarking scheme for color image tamper detection and restoration},
	journal = {Multidimensional Systems and Signal Processing},
	volume = {30},
	year = {2018},
	pages = {pages1093{\textendash}1112},
	abstract = {The security of multimedia documents becomes an urgent need, especially with the increasing image falsifications provided by the easy access and use of image manipulation tools. Hence, usage of image authentication techniques fulfills this need. In this paper, we propose an effective self-embedding fragile watermarking scheme for color images tamper detection and restoration. To decrease the capacity of insertion, a Bayer pattern is used to reduce the color host image into a gray-level watermark, to further improve the security Torus Automorphism permutation is used to scramble the gray-level watermark. In our algorithm, three copies of the watermark are inserted over three components (R, G, and B channels) of the color host image, providing a high probability of detection accuracy and recovery if one copy is destroyed. In the tamper detection process, a majority voting technique is used to determine the legitimacy of the image and recover the tampered regions after interpolating the extracted gray-level watermark. Using our proposed method, tampering rate can achieve 25\% with a high visual quality of recovered image and PSNR values greater than 34 (dB). Experimental results demonstrate that the proposed method affords three major properties: the high quality of watermarked image, the sensitive tamper detection and high localization accuracy besides the high-quality of recovered image.},
	author = {Wassila Belferdi and Ali Behloul and Lemnouar Noui}
}
@article {5231,
	title = {A Bayer pattern-based fragile watermarking scheme for color image tamper detection and restoration},
	journal = {Multidimensional Systems and Signal Processing},
	volume = {30},
	year = {2018},
	pages = {1093{\textendash}1112},
	abstract = {The security of multimedia documents becomes an urgent need, especially with the increasing image falsifications provided by the easy access and use of image manipulation tools. Hence, usage of image authentication techniques fulfills this need. In this paper, we propose an effective self-embedding fragile watermarking scheme for color images tamper detection and restoration. To decrease the capacity of insertion, a Bayer pattern is used to reduce the color host image into a gray-level watermark, to further improve the security Torus Automorphism permutation is used to scramble the gray-level watermark. In our algorithm, three copies of the watermark are inserted over three components (R, G, and B channels) of the color host image, providing a high probability of detection accuracy and recovery if one copy is destroyed. In the tamper detection process, a majority voting technique is used to determine the legitimacy of the image and recover the tampered regions after interpolating the extracted gray-level watermark. Using our proposed method, tampering rate can achieve 25\% with a high visual quality of recovered image and PSNR values greater than 34 (dB). Experimental results demonstrate that the proposed method affords three major properties: the high quality of watermarked image, the sensitive tamper detection and high localization accuracy besides the high-quality of recovered image.},
	author = {Wassila Belferdi and Ali Behloul and Lemnouar Noui}
}
@article {5218,
	title = {A lossless image encryption algorithm using matrix transformations and XOR operation},
	journal = {International Journal of Information and Communication Technology},
	volume = {13},
	number = {1},
	year = {2018},
	abstract = {Encryption is the way to ensure confidentiality of different data, digital images have special features as large data, bulky data, and strong correlation between pixels, which makes traditional encryption algorithms not suitable for image encryption. For this concern, we propose a novel lossless encryption scheme for digital images based on combination of matrix transformations and XOR operation. The numerical experimental results confirms that the proposed method achieves high security level against brute force attacks, statistical attacks and sensitivity analysis, moreover the suggested algorithm provides a good randomness properties, thus our method can be applied for image encryption and transmission in sensitive domains.},
	author = {Assia Beloucif and Lemnouar Noui}
}
@article {5217,
	title = {A new steganography algorithm using polar decomposition},
	journal = {Information Security Journal: A Global Perspective},
	volume = {27},
	number = {3},
	year = {2018},
	pages = {133-144},
	abstract = {Nowadays, the security of communication becomes very important with the rapid development of network technology. So, the transmission and distribution of the several digital information must be protected and secured against other users. Many steganography techniques have been proposed for embedding secret digital data in other digital data. In this article, we propose a new steganography algorithm based on a linear algebraic tool that is the polar decomposition (PD) for hiding secret data in an image. A host image is selected and divided into blocks of size 2\&nbsp;{\texttimes}\&nbsp;2, a PD is applied on each block, and the secret data are embedded in suitable blocks. Experimental results show that our proposed algorithm gives a higher hiding capacity, achieves good imperceptibility, and also provides a high degree of security against common types of attacks such as compression attack with quality 10\%, gamma correction attack, and impulse noise attack.},
	author = {Sabah Delenda and Lemnouar Noui}
}
@article {5234,
	title = {Security and robustness of a modified ElGamal encryption scheme},
	journal = {International Journal of Information and Communication Technology},
	volume = {13},
	number = {3},
	year = {2018},
	abstract = {In this paper, we propose a new and practical variant of ElGamal encryption which is secure against every passive and active adversary. Under the hardiness of the decisional Diffie-Hellman assumption, we can prove that the proposed scheme is secure against an adaptive chosen ciphertext attacks in the standard model. Such security verifies not only the confidentiality but also verifies the integrity and the authentication of communications. We display that the modified scheme furthermore achieves anonymity as well as strong robustness.},
	author = {Karima Djebaili and Lamine Melkemi}
}
@article {5234,
	title = {Security and robustness of a modified ElGamal encryption scheme},
	journal = { International Journal of Information and Communication Technology},
	volume = {13},
	number = {3},
	year = {2018},
	abstract = {
	In this paper, we propose a new and practical variant of ElGamal encryption which is secure against every passive and active adversary. Under the hardiness of the decisional Diffie-Hellman assumption, we can prove that the proposed scheme is secure against an adaptive chosen ciphertext attacks in the standard model. Such security verifies not only the confidentiality but also verifies the integrity and the authentication of communications. We display that the modified scheme furthermore achieves anonymity as well as strong robustness.

},
	author = {Karima Djebaili and Lamine Melkemi}
}
@article {5231,
	title = {A Bayer pattern-based fragile watermarking scheme for color image tamper detection and restoration},
	journal = {Multidimensional Systems and Signal Processing },
	volume = {30},
	year = {2018},
	pages = {1093{\textendash}1112},
	abstract = {
	The security of multimedia documents becomes an urgent need, especially with the increasing image falsifications provided by the easy access and use of image manipulation tools. Hence, usage of image authentication techniques fulfills this need. In this paper, we propose an effective self-embedding fragile watermarking scheme for color images tamper detection and restoration. To decrease the capacity of insertion, a Bayer pattern is used to reduce the color host image into a gray-level watermark, to further improve the security Torus Automorphism permutation is used to scramble the gray-level watermark. In our algorithm, three copies of the watermark are inserted over three components (R, G, and B channels) of the color host image, providing a high probability of detection accuracy and recovery if one copy is destroyed. In the tamper detection process, a majority voting technique is used to determine the legitimacy of the image and recover the tampered regions after interpolating the extracted gray-level watermark. Using our proposed method, tampering rate can achieve 25\% with a high visual quality of recovered image and PSNR values greater than 34 (dB). Experimental results demonstrate that the proposed method affords three major properties: the high quality of watermarked image, the sensitive tamper detection and high localization accuracy besides the high-quality of recovered image.

},
	url = {https://link.springer.com/article/10.1007/s11045-018-0597-x},
	author = {Wassila Belferdi and Ali Behloul and Lemnouar Noui}
}
@article {5218,
	title = {A lossless image encryption algorithm using matrix transformations and XOR operation},
	journal = { International Journal of Information and Communication Technology},
	volume = {13},
	number = {1},
	year = {2018},
	abstract = {
	Encryption is the way to ensure confidentiality of different data, digital images have special features as large data, bulky data, and strong correlation between pixels, which makes traditional encryption algorithms not suitable for image encryption. For this concern, we propose a novel lossless encryption scheme for digital images based on combination of matrix transformations and XOR operation. The numerical experimental results confirms that the proposed method achieves high security level against brute force attacks, statistical attacks and sensitivity analysis, moreover the suggested algorithm provides a good randomness properties, thus our method can be applied for image encryption and transmission in sensitive domains.

},
	author = {Assia Beloucif and Lemnouar Noui}
}
@article {5217,
	title = {A new steganography algorithm using polar decomposition},
	journal = {Information Security Journal: A Global Perspective },
	volume = {27},
	number = {3},
	year = {2018},
	pages = {133-144},
	abstract = {
	Nowadays, the security of communication becomes very important with the rapid development of network technology. So, the transmission and distribution of the several digital information must be protected and secured against other users. Many steganography techniques have been proposed for embedding secret digital data in other digital data. In this article, we propose a new steganography algorithm based on a linear algebraic tool that is the polar decomposition (PD) for hiding secret data in an image. A host image is selected and divided into blocks of size 2\&nbsp;{\texttimes}\&nbsp;2, a PD is applied on each block, and the secret data are embedded in suitable blocks. Experimental results show that our proposed algorithm gives a higher hiding capacity, achieves good imperceptibility, and also provides a high degree of security against common types of attacks such as compression attack with quality 10\%, gamma correction attack, and impulse noise attack.

},
	author = {Sabah Delenda and Lemnouar Noui}
}
@article {5215,
	title = {A Bayer pattern-based fragile watermarking scheme for color image tamper detection and restoration},
	journal = {Multidimensional Systems and Signal Processing},
	volume = {30},
	year = {2018},
	pages = {pages1093{\textendash}1112},
	abstract = {
	The security of multimedia documents becomes an urgent need, especially with the increasing image falsifications provided by the easy access and use of image manipulation tools. Hence, usage of image authentication techniques fulfills this need. In this paper, we propose an effective self-embedding fragile watermarking scheme for color images tamper detection and restoration. To decrease the capacity of insertion, a Bayer pattern is used to reduce the color host image into a gray-level watermark, to further improve the security Torus Automorphism permutation is used to scramble the gray-level watermark. In our algorithm, three copies of the watermark are inserted over three components (R, G, and B channels) of the color host image, providing a high probability of detection accuracy and recovery if one copy is destroyed. In the tamper detection process, a majority voting technique is used to determine the legitimacy of the image and recover the tampered regions after interpolating the extracted gray-level watermark. Using our proposed method, tampering rate can achieve 25\% with a high visual quality of recovered image and PSNR values greater than 34 (dB). Experimental results demonstrate that the proposed method affords three major properties: the high quality of watermarked image, the sensitive tamper detection and high localization accuracy besides the high-quality of recovered image.

},
	author = {Wassila Belferdi and Ali Behloul and Lemnouar Noui}
}
@article {5227,
	title = {Asymptotic expansion of double Laplace-type integrals with a curve of minimal points and application to an exit time problem},
	journal = {Mathematica Slovaca},
	volume = {67},
	number = {3},
	year = {2017},
	pages = {737{\textendash}750},
	abstract = {In this paper we consider the problem of the asymptotic expansion of double Laplace-type integrals, in the case when the set\&nbsp;γ\&nbsp;of points where the phase achieves its absolute minimum is a simple curve. It will be shown that the asymptotic behaviour of such integrals is governed by the order of degeneracy of normal derivatives of the phase with respect to the curve\&nbsp;γ. Complete asymptotic expansions will be constructed if that order is constant along\&nbsp;γ, and the first two coefficients will be explicitly computed. If not, a uniform asymptotic expansion method, involving special functions, is suggested.},
	author = {Abdallah Benaissa and Moussa Benlahcene}
}
@article {5232,
	title = {Asymptotic expansion of double Laplace-type integrals with a curve of minimal points and application to an exit time problem},
	journal = {Mathematica Slovaca},
	volume = {67},
	number = {3},
	year = {2017},
	pages = {737{\textendash}750},
	abstract = {In this paper we consider the problem of the asymptotic expansion of double Laplace-type integrals, in the case when the set\&nbsp;γ\&nbsp;of points where the phase achieves its absolute minimum is a simple curve. It will be shown that the asymptotic behaviour of such integrals is governed by the order of degeneracy of normal derivatives of the phase with respect to the curve\&nbsp;γ. Complete asymptotic expansions will be constructed if that order is constant along\&nbsp;γ, and the first two coefficients will be explicitly computed. If not, a uniform asymptotic expansion method, involving special functions, is suggested.},
	author = {Abdallah Benaissa and Moussa Benlahcene}
}
@article {5220,
	title = {ON CERTAIN INVARIANTS OF TRIVECTORS},
	journal = {Communications in Applied Analysis},
	volume = {21},
	number = {4},
	year = {2017},
	pages = {595-606},
	abstract = {Let E be a n-dimensional vector space over a field k and ω a trivector of Λ3E. We can associate to the trivector ω several invariants either algebraic, arithmetic or geometric. In this paper we consider the following three invariants, the commutant C(ω), the complexity c(ω) and the automorphisms group Aut(ω). We show that there exists a vector space E and a trivector ω of Λ3E for which C(ω) is not a Frobenius algebra. We also show that the complexity c(ω) and the length l(ω) are equal. Finally, we prove the existence of a trivector ω such that Aut(ω) is not a FC-group.},
	author = {Mourad Chelgham}
}
@article {5219,
	title = {ON CERTAIN INVARIANTS OF TRIVECTORS},
	journal = {Communications in Applied Analysis},
	volume = {21},
	number = {4},
	year = {2017},
	pages = {595-606},
	abstract = {Let E be a n-dimensional vector space over a field k and ω a trivector of Λ3E. We can associate to the trivector ω several invariants either algebraic, arithmetic or geometric. In this paper we consider the following three invariants, the commutant C(ω), the complexity c(ω) and the automorphisms group Aut(ω). We show that there exists a vector space E and a trivector ω of Λ3E for which C(ω) is not a Frobenius algebra. We also show that the complexity c(ω) and the length l(ω) are equal. Finally, we prove the existence of a trivector ω such that Aut(ω) is not a FC-group.},
	author = {Mourad Chelgham and Mohamed Kerada and Lemnouar Noui}
}
@article {5216,
	title = {Secure image encryption scheme based on polar decomposition and chaotic map},
	journal = {International Journal of Information and Communication Technology},
	volume = {10},
	number = {4},
	year = {2017},
	abstract = {Security is an important issue in image storage and communication, encryption is one of the most common ways to ensure security. Recently, many schemes based on chaotic map have been proposed, but most of this method suffers from small key space, which makes them vulnerable to brute forces attacks. In this study, we design a highly robust novel symmetric image encryption scheme which offer good confusion and diffusion qualities, and a large key space to ensure popular security factor and to overcome the weaknesses of the state of the art encryption schemes. In the security analysis section, we prove that our scheme can resist most known attacks, such as cipher image only attack, known and chosen plain image attacks, differential and exhaustive attacks. It is shown in this paper that the use of polar decomposition with chaotic map can gives a fast and secures encryption.},
	author = {Oussama Noui and Assia Beloucif and Lemnouar Noui}
}
@article {5235,
	title = {Secure video summarization framework for personalized wireless capsule endoscopy},
	journal = {Pervasive and Mobile Computing},
	volume = {41},
	year = {2017},
	pages = {436-450},
	abstract = {Wireless capsule\&nbsp;endoscopy\&nbsp;(WCE) has several benefits over traditional endoscopy such as its portability and ease of usage, particularly for remote\&nbsp;internet of things\&nbsp;(IoT)-assisted\&nbsp;healthcare services. During the WCE procedure, a significant amount of redundant video data is generated, the transmission of which to healthcare centers and gastroenterologists securely for analysis is challenging as well as wastage of several resources including energy, memory, computation, and bandwidth. In addition to this, it is inherently difficult and time consuming for gastroenterologists to analyze this huge volume of gastrointestinal video data for desired contents. To surmount these issues, we propose a secure video summarization framework for outdoor patients going through WCE procedure. In the proposed system,\&nbsp;keyframes\&nbsp;are extracted using a light-weighted video summarization scheme, making it more suitable for WCE. Next, a\&nbsp;cryptosystem\&nbsp;is presented for security of extracted keyframes based on 2D Zaslavsky chaotic map. Experimental results validate the performance of the proposed cryptosystem in terms of robustness and high-level security compared to other recent image encryption schemes during dissemination of important keyframes to healthcare centers and gastroenterologists for personalized WCE.},
	author = {Rafik Hamza and Khan Muhammad and Zhihan Lv and Faiza Titouna}
}
@article {5235,
	title = {Secure video summarization framework for personalized wireless capsule endoscopy},
	journal = {Pervasive and Mobile Computing},
	volume = {41},
	year = {2017},
	pages = {436-450},
	abstract = {
	Wireless capsule\&nbsp;endoscopy\&nbsp;(WCE) has several benefits over traditional endoscopy such as its portability and ease of usage, particularly for remote\&nbsp;internet of things\&nbsp;(IoT)-assisted\&nbsp;healthcare services. During the WCE procedure, a significant amount of redundant video data is generated, the transmission of which to healthcare centers and gastroenterologists securely for analysis is challenging as well as wastage of several resources including energy, memory, computation, and bandwidth. In addition to this, it is inherently difficult and time consuming for gastroenterologists to analyze this huge volume of gastrointestinal video data for desired contents. To surmount these issues, we propose a secure video summarization framework for outdoor patients going through WCE procedure. In the proposed system,\&nbsp;keyframes\&nbsp;are extracted using a light-weighted video summarization scheme, making it more suitable for WCE. Next, a\&nbsp;cryptosystem\&nbsp;is presented for security of extracted keyframes based on 2D Zaslavsky chaotic map. Experimental results validate the performance of the proposed cryptosystem in terms of robustness and high-level security compared to other recent image encryption schemes during dissemination of important keyframes to healthcare centers and gastroenterologists for personalized WCE.

},
	author = {Rafik Hamza and Khan Muhammad and Zhihan Lv and Faiza Titouna}
}
@article {5232,
	title = {Asymptotic expansion of double Laplace-type integrals with a curve of minimal points and application to an exit time problem},
	journal = {Mathematica Slovaca },
	volume = {67},
	number = {3},
	year = {2017},
	pages = {737{\textendash}750},
	abstract = {
	In this paper we consider the problem of the asymptotic expansion of double Laplace-type integrals, in the case when the set\&nbsp;γ\&nbsp;of points where the phase achieves its absolute minimum is a simple curve. It will be shown that the asymptotic behaviour of such integrals is governed by the order of degeneracy of normal derivatives of the phase with respect to the curve\&nbsp;γ. Complete asymptotic expansions will be constructed if that order is constant along\&nbsp;γ, and the first two coefficients will be explicitly computed. If not, a uniform asymptotic expansion method, involving special functions, is suggested.

},
	author = {Abdallah Benaissa and Moussa Benlahcene}
}
@article {5227,
	title = {Asymptotic expansion of double Laplace-type integrals with a curve of minimal points and application to an exit time problem},
	journal = { Mathematica Slovaca},
	volume = {67},
	number = {3},
	year = {2017},
	pages = {737{\textendash}750},
	abstract = {
	In this paper we consider the problem of the asymptotic expansion of double Laplace-type integrals, in the case when the set\&nbsp;γ\&nbsp;of points where the phase achieves its absolute minimum is a simple curve. It will be shown that the asymptotic behaviour of such integrals is governed by the order of degeneracy of normal derivatives of the phase with respect to the curve\&nbsp;γ. Complete asymptotic expansions will be constructed if that order is constant along\&nbsp;γ, and the first two coefficients will be explicitly computed. If not, a uniform asymptotic expansion method, involving special functions, is suggested.

},
	author = {Abdallah Benaissa and Moussa Benlahcene}
}
@article {5219,
	title = {ON CERTAIN INVARIANTS OF TRIVECTORS},
	journal = {Communications in Applied Analysis},
	volume = {21},
	number = {4},
	year = {2017},
	pages = {595-606},
	abstract = {
	Let E be a n-dimensional vector space over a field k and ω a trivector of Λ3E. We can associate to the trivector ω several invariants either algebraic, arithmetic or geometric. In this paper we consider the following three invariants, the commutant C(ω), the complexity c(ω) and the automorphisms group Aut(ω). We show that there exists a vector space E and a trivector ω of Λ3E for which C(ω) is not a Frobenius algebra. We also show that the complexity c(ω) and the length l(ω) are equal. Finally, we prove the existence of a trivector ω such that Aut(ω) is not a FC-group.

},
	author = {Mourad Chelgham and Mohamed Kerada and Lemnouar Noui}
}
@article {5220,
	title = {ON CERTAIN INVARIANTS OF TRIVECTORS},
	journal = {Communications in Applied Analysis},
	volume = {21},
	number = {4},
	year = {2017},
	pages = {595-606},
	abstract = {
	Let E be a n-dimensional vector space over a field k and ω a trivector of Λ3E. We can associate to the trivector ω several invariants either algebraic, arithmetic or geometric. In this paper we consider the following three invariants, the commutant C(ω), the complexity c(ω) and the automorphisms group Aut(ω). We show that there exists a vector space E and a trivector ω of Λ3E for which C(ω) is not a Frobenius algebra. We also show that the complexity c(ω) and the length l(ω) are equal. Finally, we prove the existence of a trivector ω such that Aut(ω) is not a FC-group.

},
	author = {Mourad Chelgham}
}
@article {5216,
	title = {Secure image encryption scheme based on polar decomposition and chaotic map},
	journal = {International Journal of Information and Communication Technology},
	volume = {10},
	number = {4},
	year = {2017},
	abstract = {
	Security is an important issue in image storage and communication, encryption is one of the most common ways to ensure security. Recently, many schemes based on chaotic map have been proposed, but most of this method suffers from small key space, which makes them vulnerable to brute forces attacks. In this study, we design a highly robust novel symmetric image encryption scheme which offer good confusion and diffusion qualities, and a large key space to ensure popular security factor and to overcome the weaknesses of the state of the art encryption schemes. In the security analysis section, we prove that our scheme can resist most known attacks, such as cipher image only attack, known and chosen plain image attacks, differential and exhaustive attacks. It is shown in this paper that the use of polar decomposition with chaotic map can gives a fast and secures encryption.

},
	author = {Oussama Noui and Assia Beloucif and Lemnouar Noui}
}
@article {5226,
	title = {Asymptotic expansion of double Laplace-type integrals: The case of non-stationary minimum points},
	journal = {Proceedings of the American Mathematical Society},
	volume = {144},
	year = {2016},
	pages = {3741-3756},
	abstract = {In this paper, we show that the asymptotic expansion of a double Laplace-type integral with a non-stationary minimum point, located on the boundary of the domain of integration, is governed by the order of contact between the boundary curve and the level curve of the phase through the minimum point. This achievement will enable us to construct complete asymptotic expansions in more general settings. Especially, the problem will be completely solved if the phase and the boundary curve of the domain of integration are analytic near the minimum point.},
	author = {Nesrine Kamouche and Abdallah Benaissa}
}
@article {5229,
	title = {Simplex and MacDonald codes over Rq},
	journal = {Journal of Applied Mathematics and Computing},
	volume = {55},
	year = {2016},
	pages = {455{\textendash}478},
	abstract = {{ In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring\&nbsp;Rq=F2[u1,u2,{\textellipsis},uq]/⟨u2i=0},
	author = {Karima Chatouh and kenza Guenda and T. A Gulliver and Lemnouar Noui}
}
@article {5228,
	title = {On some classes of linear codes over Z2Z4 and their covering radii},
	journal = {Journal of Applied Mathematics and Computing},
	volume = {53},
	year = {2016},
	pages = {201{\textendash}222},
	abstract = {In this paper, we define the simplex and MacDonald codes of types\&nbsp;αα\&nbsp;and\&nbsp;β\&nbsp;over\&nbsp;Z2Z4. We also examine the covering radii of these codes. Further, we study the binary images of these codes and prove that the binary image of the simplex codes of type\&nbsp;αα\&nbsp;meets the Gilbert bound.},
	author = {Karima Chatouh and kenza Guenda and T Aaron Gulliver and Lemnouar Noui}
}
@article {5229,
	title = {Simplex and MacDonald codes over Rq},
	journal = {Journal of Applied Mathematics and Computing},
	volume = {55},
	year = {2016},
	pages = {455{\textendash}478},
	abstract = {
	In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring\&nbsp;Rq=F2[u1,u2,{\textellipsis},uq]/⟨u2i=0,uiuj=ujui⟩\&nbsp;for\&nbsp;q>=1q>=1. We also consider the construction of simplex and MacDonald codes of types\&nbsp;α\&nbsp;and\&nbsp;β\&nbsp;over this ring and their covering radius.

},
	author = {Karima Chatouh and kenza Guenda and T. A Gulliver and Lemnouar Noui}
}
@article {5228,
	title = {On some classes of linear codes over Z2Z4 and their covering radii},
	journal = {Journal of Applied Mathematics and Computing},
	volume = {53},
	year = {2016},
	pages = {201{\textendash}222},
	abstract = {
	In this paper, we define the simplex and MacDonald codes of types\&nbsp;αα\&nbsp;and\&nbsp;β\&nbsp;over\&nbsp;Z2Z4. We also examine the covering radii of these codes. Further, we study the binary images of these codes and prove that the binary image of the simplex codes of type\&nbsp;αα\&nbsp;meets the Gilbert bound.

},
	author = {Karima Chatouh and kenza Guenda and T Aaron Gulliver and Lemnouar Noui}
}
@article {5226,
	title = {Asymptotic expansion of double Laplace-type integrals: The case of non-stationary minimum points},
	journal = {Proceedings of the American Mathematical Society},
	volume = {144},
	year = {2016},
	pages = {3741-3756},
	abstract = {
	In this paper, we show that the asymptotic expansion of a double Laplace-type integral with a non-stationary minimum point, located on the boundary of the domain of integration, is governed by the order of contact between the boundary curve and the level curve of the phase through the minimum point. This achievement will enable us to construct complete asymptotic expansions in more general settings. Especially, the problem will be completely solved if the phase and the boundary curve of the domain of integration are analytic near the minimum point.

},
	author = {Nesrine Kamouche and Abdallah Benaissa}
}
@article {5230,
	title = {On the exit problem of dynamic systems perturbed by a white noise},
	journal = {AIP Conference Proceedings},
	volume = {1660},
	number = {1},
	year = {2015},
	abstract = {\&nbsp; In this paper we are concerned with the exit time problem of a dynamic system perturbed by a\&nbsp;white noise,\&nbsp;in the case where the noiseless dynamics has a global\&nbsp;attractor\&nbsp;in a given domain. By the use of a singular\&nbsp;perturbation technique\&nbsp;and recent results on the asymptotic expansion of a class of Laplace-type integrals, new results concerning the problem under investigation will be presented. \&nbsp;},
	author = {Abdallah Benaissa}
}
@article {5230,
	title = {On the exit problem of dynamic systems perturbed by a white noise},
	journal = {AIP Conference Proceedings},
	volume = {1660},
	number = {1},
	year = {2015},
	abstract = {
	\&nbsp;



	In this paper we are concerned with the exit time problem of a dynamic system perturbed by a\&nbsp;white noise,\&nbsp;in the case where the noiseless dynamics has a global\&nbsp;attractor\&nbsp;in a given domain. By the use of a singular\&nbsp;perturbation technique\&nbsp;and recent results on the asymptotic expansion of a class of Laplace-type integrals, new results concerning the problem under investigation will be presented.



	\&nbsp;

},
	author = {Abdallah Benaissa}
}
@article {5221,
	title = {A ROBUST BLIND AND SECURE WATERMARKING SCHEME USING POSITIVE SEMI DEFINITE MATRICES},
	journal = {International Journal of Computer Science \& Information Technology (IJCSIT)},
	volume = {6},
	number = {5},
	year = {2014},
	abstract = {In the last decade the need for new and robust watermarking schemes has been increased because of the large illegal possession by not respecting the intellectual property rights in the multimedia in the internet. In this paper we introduce a novel blind robust watermarking scheme which exploits the positive circulant matrices in frequency domain which is the SVD, Different applications such as copyright protection, control and illicit distributions have been given. Simulation results indicate that the proposed method is robust against attacks as common digital processing: compression, blurring, dithering, printing and scanning, etc. and subterfuge attacks (collusion and forgery) also geometric distortions and transformations. Furthermore, good results of NC (normalized correlation) and PSNR (Peak signal-tonoise ratio) have been achieved while comparing with recent state of the art watermarking algorithms.},
	author = {Oussama Noui and Lemnouar Noui}
}
@article {5221,
	title = {A ROBUST BLIND AND SECURE WATERMARKING SCHEME USING POSITIVE SEMI DEFINITE MATRICES},
	journal = {International Journal of Computer Science \& Information Technology (IJCSIT) },
	volume = {6},
	number = {5},
	year = {2014},
	abstract = {
	In the last decade the need for new and robust watermarking schemes has been increased because of the large illegal possession by not respecting the intellectual property rights in the multimedia in the internet. In this paper we introduce a novel blind robust watermarking scheme which exploits the positive circulant matrices in frequency domain which is the SVD, Different applications such as copyright protection, control and illicit distributions have been given. Simulation results indicate that the proposed method is robust against attacks as common digital processing: compression, blurring, dithering, printing and scanning, etc. and subterfuge attacks (collusion and forgery) also geometric distortions and transformations. Furthermore, good results of NC (normalized correlation) and PSNR (Peak signal-tonoise ratio) have been achieved while comparing with recent state of the art watermarking algorithms.

},
	author = {Oussama Noui and Lemnouar Noui}
}
