@article {Zennou20222181,
	title = {Checking causal consistency of distributed databases},
	journal = {Computing},
	volume = {104},
	number = {10},
	year = {2022},
	note = {cited By 0},
	pages = {2181-2201},
	abstract = {The CAP Theorem shows that (strong) consistency, availability, and partition tolerance are impossible to be ensured together. Causal consistency is one of the weak consistency models that can be implemented to ensure availability and partition tolerance in distributed systems. In this work, we propose a tool to check automatically the conformance of distributed/concurrent systems executions to causal consistency models. Our approach consists in reducing the problem of checking if an execution is causally consistent to solving datalog queries. The reduction is based on complete characterizations of the executions violating causal consistency in terms of the existence of cycles in suitably defined relations between the operations occurring in these executions. We have implemented the reduction in a testing tool for distributed databases, and carried out several experiments on real case studies, showing the efficiency of the suggested approach. {\textcopyright} 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH, AT part of Springer Nature.},
	keywords = {Consistency model, Distributed database, Distributed database systems, Distributed systems, Efficiency of the suggested approaches, Intelligent databases, Partition tolerances, Real case, Testing tools, Weak consistency},
	doi = {10.1007/s00607-021-00911-3},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100842253\&doi=10.1007\%2fs00607-021-00911-3\&partnerID=40\&md5=c07a495f908981f833ea643e53d1466c},
	author = {Zennou, R. and Biswas, R. and Bouajjani, A. and Enea, C. and Erradi, M.}
}
@conference {Bouamama2021560,
	title = {Cloud key management using trusted execution environment},
	booktitle = {Proceedings of the 18th International Conference on Security and Cryptography, SECRYPT 2021},
	year = {2021},
	note = {cited By 0},
	pages = {560-567},
	abstract = {Cloud storage represents a primordial component in most information technology infrastructures. Using cloud instead of on-premise storage raises several security issues, especially when secret keys are stored on the cloud. In such a setting, a robust cloud key management system is a must. Using traditional key management systems (KMS) in the cloud suffers from performance and scalability limitations. This paper, proposes an efficient and secure cloud KMS based on Trusted Execution Environment, precisely Intel SGX. The suggested system (KMSGX), while being deployed on the cloud, is fully controlled by the end-user. Therefore, KMSGX allows running on-premise software key management securely on the cloud provider side, protecting the exchanged and stored data. The security properties of the suggested design have been formalized using the Applied Pi Calculus and proved with ProVerif. The experimental results have demonstrated the system{\textquoteright}s high performance in terms of the upload and download durations and the limited overhead compared to the plain design. Copyright {\textcopyright} 2021 by SCITEPRESS {\textendash} Science and Technology Publications, Lda. All rights reserved},
	keywords = {Applied pi calculus, Calculations, Cloud providers, Cryptography, Digital storage, Information technology infrastructure, Key management systems, Performance and scalabilities, Security issues, Security properties, Trusted computing, Trusted execution environments},
	doi = {10.5220/0010558905600567},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85111807187\&doi=10.5220\%2f0010558905600567\&partnerID=40\&md5=2745b5f1ad6970111bb700c309eea488},
	author = {Bouamama, J. and Hedabou, M. and Erradi, M.}
}
@article {AitElHadj2021836,
	title = {A Log-Based Method to Detect and Resolve Efficiently Conflicts in Access Control Policies},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {1383 AISC},
	year = {2021},
	note = {cited By 0},
	pages = {836-846},
	abstract = {Typically, a security audit is conducted to detect and track inappropriate activities, such as security policy misconfigurations and attacks. Practically, an audit can be done through the analysis and assessment of data in logs registering traces of queries according to predefined policies. In this paper, we present an auditing approach that detects and resolves efficiently conflicting rules of a security policy. Such efficiency translates into a reduction in the time it takes to detect and resolve conflicts. Such efficiency is a consequence of the fact that conflict detection is executed only among suspicious pairs of rules, instead of all pairs of rules. The idea of using suspicious pairs of rules has recently been applied to reduce the execution time of previous detection methods. The present study goes further by applying the idea not only for conflict detection, but also for reducing the resolution time of the detected conflicts. We present experimental results that illustrate the efficiency of the suggested method. {\textcopyright} 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.},
	keywords = {Access control, Access control policies, conflict detection, Detection methods, Efficiency, Misconfigurations, Pattern recognition, Resolution time, Security audit, Security policy, Security systems, Soft computing},
	doi = {10.1007/978-3-030-73689-7_79},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85105891237\&doi=10.1007\%2f978-3-030-73689-7_79\&partnerID=40\&md5=f0de7beea992beee027f768bafe5cf58},
	author = {Ait El Hadj, M. and Khoumsi, A. and Benkaouz, Y. and Erradi, M.}
}
@article {Zennou2020360,
	title = {Boosting Sequential Consistency Checking Using Saturation},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12302 LNCS},
	year = {2020},
	note = {cited By 1},
	pages = {360-376},
	abstract = {We address the problem of checking that an execution of a shared memory concurrent program is sequentially consistent (SC). This problem is NP-hard due to the necessity of finding a total order between the write operations that induces an acyclic happen-before relation. We propose an approach allowing to avoid falling systematically in the worst case, and to check SCness in polynomial-time in most cases in practice. The approach is based on a simple yet powerful saturation-based procedure for computing write constraints that must hold for SCness, allowing on one hand fast detection of SC violations, and on the other hand reducing drastically the search space for a total order witnessing SCness. {\textcopyright} 2020, Springer Nature Switzerland AG.},
	keywords = {Concurrent program, Fast detections, NP-hard, Polynomial approximation, Polynomial-time, Search spaces, Sequential consistency, Shared memory, Total order, Write operations},
	doi = {10.1007/978-3-030-59152-6_20},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85093860805\&doi=10.1007\%2f978-3-030-59152-6_20\&partnerID=40\&md5=a60ea8b0396b220e92dc8ef992c37f30},
	author = {Zennou, R. and Atig, M.F. and Biswas, R. and Bouajjani, A. and Enea, C. and Erradi, M.}
}
@article {Khoumsi2019343,
	title = {Automata-based bottom-up design of conflict-free security policies specified as policy expressions},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {11028 LNCS},
	year = {2019},
	note = {cited By 0},
	pages = {343-357},
	doi = {10.1007/978-3-030-05529-5_23},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85059958782\&doi=10.1007\%2f978-3-030-05529-5_23\&partnerID=40\&md5=903c5a9fdf6f9a84edd470778038befc},
	author = {Khoumsi, A. and Erradi, M.}
}
@conference {ElHadj20195330,
	title = {Validation and Correction of Large Security Policies: A Clustering and Access Log Based Approach},
	booktitle = {Proceedings - 2018 IEEE International Conference on Big Data, Big Data 2018},
	year = {2019},
	note = {cited By 0},
	pages = {5330-5332},
	doi = {10.1109/BigData.2018.8622610},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85062588205\&doi=10.1109\%2fBigData.2018.8622610\&partnerID=40\&md5=7c1e7e5b141f9f63ccf2ad00a318664f},
	author = {El Hadj, M.A. and Erradi, M. and Khoumsi, A. and Benkaouz, Y.}
}
@article {Madani201867,
	title = {ABAC Based Online Collaborations in the Cloud},
	journal = {Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST},
	volume = {206},
	year = {2018},
	pages = {67-76},
	doi = {10.1007/978-3-319-67837-5_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032702017\&doi=10.1007\%2f978-3-319-67837-5_7\&partnerID=40\&md5=704b997de080d8d90770d238c58d2580},
	author = {Madani, M.A. and Erradi, M. and Benkaouz, Y.}
}
@article {Madani201867,
	title = {ABAC Based Online Collaborations in the Cloud},
	journal = {Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST},
	volume = {206},
	year = {2018},
	note = {cited By 0},
	pages = {67-76},
	abstract = {Nowadays sharing data among organizations plays an important role for their collaboration. During collaborations, the organizations need to access shared information while respecting the access control constraints. In addition, most organizations rely on cloud based solutions to store their data (e.g. openstack). In such platform, data access is regulated by Access Control Lists (ACLs). ACL defines static access rules. It assumes the knowledge of the whole set of users and possible access requests. This make ACL unusable in collaborative context due to the dynamic nature of collaborative sessions. In this paper, we consider ABAC, a flexible and fine-grained model, as an access control model for cloud-based collaborations to overcome the ACL limitations. We provide an architecture that integrate ABAC in the storage level of a cloud platform. {\textcopyright} 2018, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.},
	doi = {10.1007/978-3-319-67837-5_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032702017\&doi=10.1007\%2f978-3-319-67837-5_7\&partnerID=40\&md5=704b997de080d8d90770d238c58d2580},
	author = {Madani, M.A. and Erradi, M. and Benkaouz, Y.}
}
@article {AitElHadj2018298,
	title = {Access domain-based approach for anomaly detection and resolution in XACML policies},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {735},
	year = {2018},
	pages = {298-308},
	doi = {10.1007/978-3-319-76354-5_27},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85044049486\&doi=10.1007\%2f978-3-319-76354-5_27\&partnerID=40\&md5=6c7c85cfacd3e4e948ef85d2df40ee3f},
	author = {Ait El Hadj, M. and Benkaouz, Y. and Khoumsi, A. and Erradi, M.}
}
@article {Khoumsi201851,
	title = {A formal basis for the design and analysis of firewall security policies},
	journal = {Journal of King Saud University - Computer and Information Sciences},
	volume = {30},
	number = {1},
	year = {2018},
	pages = {51-66},
	doi = {10.1016/j.jksuci.2016.11.008},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85008234846\&doi=10.1016\%2fj.jksuci.2016.11.008\&partnerID=40\&md5=07a25a70cda473802a697eff8dbb8dec},
	author = {Khoumsi, A. and Erradi, M. and Krombi, W.}
}
@article {Khoumsi201851,
	title = {A formal basis for the design and analysis of firewall security policies},
	journal = {Journal of King Saud University - Computer and Information Sciences},
	volume = {30},
	number = {1},
	year = {2018},
	note = {cited By 0},
	pages = {51-66},
	abstract = {A firewall is the core of a well defined network security policy. This paper presents an automata-based method to study firewall security policies. We first propose a procedure that synthesizes an automaton that describes a security policy given as a table of rules. The synthesis procedure is then used to develop procedures to detect: incompleteness, anomalies and discrepancies in security policies. A method is developed to represent the automaton by a policy qualified as mixable and that has practical utilities, such as ease to determine the whitelist and the blacklist of the policy. The developed procedures have been deeply evaluated in terms of time and space complexities. Then, a real case study has been investigated. The obtained results confirm that the developed procedures have reasonable complexities and that their actual execution times are of the order of seconds. Finally, proofs of all results are provided. {\textcopyright} 2016 King Saud University},
	doi = {10.1016/j.jksuci.2016.11.008},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85008234846\&doi=10.1016\%2fj.jksuci.2016.11.008\&partnerID=40\&md5=07a25a70cda473802a697eff8dbb8dec},
	author = {Khoumsi, A. and Erradi, M. and Krombi, W.}
}
@article {ElHadj201786,
	title = {ABAC rule reduction via similarity computation},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10299 LNCS},
	year = {2017},
	note = {cited By 0},
	pages = {86-100},
	abstract = {Attribute-based access control (ABAC) represents a generic model of access control that provides a high level of flexibility and promotes information and security sharing. Since ABAC considers a large set of attributes for access decisions, using it might get very complicated for large systems. Hence, it is interesting to offer techniques to reduce the number of rules in ABAC policies without affecting the final decision. In this paper, we present an approach based on K-nearest neighbors algorithms for clustering ABAC policies. To the best of our knowledge, it is the first approach that aims to reduce the number of policy rules based on similarity computations. Our evaluation results demonstrate the efficiency of the suggested approach. For instance, the reduction rate can reach up to 10\% for an ABAC policy with more than 9000 rules. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-59647-1_7},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019735144\&doi=10.1007\%2f978-3-319-59647-1_7\&partnerID=40\&md5=948de8bee1016664b63163965c4e41fa},
	author = {El Hadj, M.A. and Benkaouz, Y. and Freisleben, B. and Erradi, M.}
}
@article {Ayache2017166,
	title = {Aspect-oriented state machines for resolving conflicts in XACML policies},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10299 LNCS},
	year = {2017},
	note = {cited By 0},
	pages = {166-171},
	abstract = {Authorizationin collaborativesystemsisdefinedbyaglobal policy that represents the combination of the collaborators{\textquoteright} access policies. However, the enforcement of such a global policy may create conflicting authorization decisions. In this paper, we categorize two types of conflicts that may occur in such policies. Furthermore, to resolve these conflicts and to reach a unique decision for an access request, we present an approach that uses XACML policy combining algorithms and considers the category of the detected conflicts. The approach is implemented using aspect-oriented finite state machines. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-59647-1_13},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019731058\&doi=10.1007\%2f978-3-319-59647-1_13\&partnerID=40\&md5=917cf51c38e853e2423ad411ec1ecadb},
	author = {Ayache, M. and Erradi, M. and Freisleben, B. and Khoumsi, A.}
}
@conference {ElHadj2017548,
	title = {Clustering-based approach for anomaly detection in XACML policies},
	booktitle = {ICETE 2017 - Proceedings of the 14th International Joint Conference on e-Business and Telecommunications},
	volume = {4},
	year = {2017},
	note = {cited By 0},
	pages = {548-553},
	abstract = {The development of distributed applications arises multiple security issues such as access control. Attribute-Based Access Control has been proposed as a generic access control model, which provides more flexibility and promotes information and security sharing. eXtensible Access Control Markup Language (XACML) is the most convenient way to express ABAC policies. However, in distributed environments, XACML policies become more complex and hard to manage. In fact, an XACML policy in distributed applications may be aggregated from multiple parties and can be managed by more than one administrator. Therefore, it may contain several anomalies such as conflicts and redundancies, which may affect the performance of the policy execution. In this paper, we propose an anomaly detection method based on the decomposition of a policy into clusters before searching anomalies within each cluster. Our evaluation results demonstrate the efficiency of the suggested approach. Copyright {\textcopyright} 2017 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85029414026\&partnerID=40\&md5=133521fca6a95f8238cfc3b777dd3534},
	author = {El Hadj, M.A. and Ayache, M. and Benkaouz, Y. and Khoumsi, A. and Erradi, M.}
}
@conference {Elaalyani2017,
	title = {Current trends in text-spotting},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {Text spotting, i.e., the localization and recognition of text occurrences in natural images and videos, is a challenging problem in computer vision. Important applications of text spotting are: video indexing, retrieval and search, the support of blind persons in finding their way in unknown environments and reading street and shop signs for autonomously driving vehicles or car license plate recognition in traffic control systems. Recently, the use of deep convolutional neural networks as well as recognizing whole words instead of single characters led to significant progress in the field of text spotting. Furthermore, there is a tendency towards merging and unifying the single steps of the text spotting pipeline. Despite current progress, it is still difficult to recognize in-scene text in comparison to overlaid text. This work gives an overview of the state-of-the-art in text spotting and highlights current breakthroughs and trends. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238215},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041435238\&doi=10.1109\%2fWINCOM.2017.8238215\&partnerID=40\&md5=a2aecbf47ec51f3f316606d512724a5a},
	author = {Elaalyani, I. and Erradi, M. and M{\"u}hling, M. and Freisleben, B.}
}
@conference {Harbouche2017,
	title = {Dynamic coalitional matching game approach for fair and swift data-gathering in wireless body sensor networks},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {Wireless Sensor Networks are deployed in different fields of application to gather data on the monitored environment. The Wireless Body Sensor Network (WBSN) is a wireless sensor network designed to monitor a human body vital and environment parameters. The design and development of such WBSN systems for health monitoring have been motivated by costly healthcare and propelled by the development of miniature health monitoring devices. This paper presents the architecture design of a preventive health care monitoring system. This architecture is designed for monitoring multiple patients in a hospital. It is based on a set of mobile data collectors and static sensors for analysis of various patient{\textquoteright}s parameters. The data collectors need to cooperate together in order to gather the data from the sensor nodes. The point of this paper is how to dynamically and effectively appoint and deploy several data collectors in the hospital to gather the measured data in minimal time. We formulate the problem as a coalitional matching game between patients and data collectors, and we propose a patientdata collector association algorithm that ensures fairness and minimum total course in the stable matchings. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238179},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041451720\&doi=10.1109\%2fWINCOM.2017.8238179\&partnerID=40\&md5=44ef24b18e66b8fb24573d73db99025f},
	author = {Harbouche, A. and Elmachkour, M. and Djedi, N. and Erradi, M. and Kobbane, A.}
}
@article {Harbouche20171339,
	title = {Model driven flexible design of a wireless body sensor network for health monitoring},
	journal = {Computer Networks},
	volume = {129},
	year = {2017},
	note = {cited By 1},
	pages = {1339-1351},
	abstract = {The Wireless Body Sensor Network (WBSN) is a wireless network that is designed to allow communication among sensor nodes that are attached to a human body to monitor the body{\textquoteright}s vital parameters and environment. The design and development of such WBSN systems for health monitoring have received a large amount of attention recently, in research studies and in industry. This attention is mainly motivated by costly health care and by recent advances in the development of miniature health monitoring devices as well as emerging technologies, such as the Internet of Things (IoT), which contribute to the main challenges of 5G. The existence of an explicit approach to address the required software design and verification should be very beneficial for the construction and maintenance of such systems. This paper presents a preventive health care system that has a flexible design. The proposed system is based on an architecture that has heterogeneous nodes and provides both daily continuous monitoring as well as specific controls. We defined a model to describe the WBSN{\textquoteright}s global behavior. An important aspect of this work is that we propose a model-driven engineering (MDE) approach to address the derivation of each node{\textquoteright}s behavior in the WBSN from the WBSN global behavior. This approach allows developers to obtain a system design from the global specification of its requirement. To ensure the conformance of this design to its specification, the derived behaviors should be validated and verified before their deployment. In fact, formal methods are powerful tools for software engineers to verify the logical correctness of concurrent software at different levels of its life cycle. Model checking is one of the most powerful formal methods for verifying the logical correctness of such concurrent systems. In this work, we make use of a model checking approach that is based on a model transformation to validate the automatically derived behavior of a WBSN for health monitoring. This model-driven approach will check whether the derived system behaves correctly according to its global specification, while the objective is to increase the system{\textquoteright}s performance and QoS. This approach allows the developer to reason about a model of the global system rather than about the system itself. {\textcopyright} 2017 Elsevier B.V.},
	doi = {10.1016/j.comnet.2017.06.014},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85022027303\&doi=10.1016\%2fj.comnet.2017.06.014\&partnerID=40\&md5=3d665e7ff240e8a6d9564857abf695da},
	author = {Harbouche, A. and Djedi, N. and Erradi, M. and Ben-Othman, J. and Kobbane, A.}
}
@conference {Madani2015,
	title = {Access control in a collaborative session in multi tenant environment},
	booktitle = {Proceedings of the 2015 11th International Conference on Information Assurance and Security, IAS 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Today collaborative applications may enable collaboration among users from the same or different tenants of a given cloud provider. During such collaborations, the participants need to access and use resources held by other collaborating users. These resources often contain sensitive data. They are meant to be shared only during specific collaborative sessions. A collaborative session is an abstract entity, comprising a set of users, called members of the session, playing the same or different roles. These users may have concurrent access to the shared objects during a session depending on their roles. In this work, we propose an approach that ensures access control to the shared resources in a collaborative session in multi-tenants environments. We suggest CRBAC, the Collaboration Role-based Access Control. CRBAC consists of an extended version of the RBAC model. CRBAC defines new entities to support access control in collaborative sessions. The suggested model has been implemented within Swift component in the open source cloud-computing platform OpenStack. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ISIAS.2015.7492757},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979516700\&doi=10.1109\%2fISIAS.2015.7492757\&partnerID=40\&md5=c5df0bd4a563937231a7448c7bfe12e1},
	author = {Madani, M.A. and Erradi, M. and Benkaouz, Y.}
}
@article {Benkaouz2015893,
	title = {A distributed protocol for privacy preserving aggregation with non-permanent participants},
	journal = {Computing},
	volume = {97},
	number = {9},
	year = {2015},
	note = {cited By 0},
	pages = {893-912},
	abstract = {Recent advances in techniques that combine and analyze data collected from multiple partners led to many new promising distributed collaborative applications. Such collaborative computations could occur between trusted partners, between partially trusted partners, or between competitors. Therefore preserving privacy is an important issue in this context. This paper presents a distributed protocol for privacy-preserving aggregation to enable computing a class of aggregation functions that can be expressed as Abelian group. The proposed protocol is based on an overlay structure that enables secret sharing without the need of any central authority or heavyweight cryptography. It preserves data privacy such that participant data is only known to their owner with a given probability. The aggregation result is computed by participants themselves without interacting with a specific aggregator. The aggregation result is accurate when there is no data loss. A strategy to handle the problem of nodes failures is given, along with a study of the privacy ensured by the suggested protocol. {\textcopyright} 2013, Springer-Verlag Wien.},
	doi = {10.1007/s00607-013-0373-6},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84939469312\&doi=10.1007\%2fs00607-013-0373-6\&partnerID=40\&md5=a64ee416ee9b81d024e5b0975f2f32f0},
	author = {Benkaouz, Y. and Erradi, M.}
}
@conference {Madani2015,
	title = {How to secure a collaborative session in a single tenant environment},
	booktitle = {International Conference on Protocol Engineering, ICPE 2015 and International Conference on New Technologies of Distributed Systems, NTDS 2015 - Proceedings},
	year = {2015},
	note = {cited By 0},
	abstract = {Cloud computing allows to move computing and storage components from individual systems into the cloud, which provides software and hardware services over the Internet. A collaborative application is among software services that can be provided by the cloud computing to enable collaboration among users from the same or different tenants. In this context, security of the shared resources in a collaborative session becomes an important issue that must be addressed. This paper proposes an approach that ensures access control to the shared resources in a collaborative session in single tenant environments. The suggested approach introduces new entities and relationships to support collaborative sessions in single-tenant environments. Finally, we validate this approach by an implementation in the SwiftStack environment. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/NOTERE.2015.7293508},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962212224\&doi=10.1109\%2fNOTERE.2015.7293508\&partnerID=40\&md5=5712469ec072c40c85698195a4db2800},
	author = {Madani, M.A. and Erradi, M.}
}
@conference {Benkaouz2015284,
	title = {Towards a decentralized OSN for a privacy-preserving e-health system},
	booktitle = {Procedia Computer Science},
	volume = {63},
	year = {2015},
	note = {cited By 0},
	pages = {284-291},
	abstract = {e-health could be defined as the cost-effective and secure use of information and communication technologies in support of health systems, including healthcare related services and monitoring at both the local site and at a distance. Challenges still need to be resolved to build reliable, secure, and efficient e-health platforms with great flexibility. Recently, social networks have seen a growing importance in different applications and could play a prominent role in healthcare. Online Social Networks (OSN) offer new possibilities such as easy access to medical data anytime from anywhere. Due to the sensitivity of health data exchanged over such networks, a special attention need to be paid to security and privacy aspects of these data. The use of existing centralized OSNs raises the big brother problem. Moreover, the centralized architectures of OSNs are not scalable and have a single point of failure. In this work, we suggest a layered architecture while promoting the usage of decentralized design to ensure the scalability and the privacy of an OSN-based e-health system. {\textcopyright} 2015 The Authors.},
	doi = {10.1016/j.procs.2015.08.345},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84954134291\&doi=10.1016\%2fj.procs.2015.08.345\&partnerID=40\&md5=969ef3799a3a3885401d37f00c554699},
	author = {Benkaouz, Y. and Erradi, M.}
}
@article {Erradi2014,
	title = {Message from the general chairs},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {8593 LNCS},
	year = {2014},
	note = {cited By 0},
	pages = {V},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84905902473\&partnerID=40\&md5=bb7d8b0ccd91d74f1c1593689e70e5b5},
	author = {Erradi, M. and Guerraoui, R.}
}
@article {Dinkelaker20121045,
	title = {Using aspect-oriented state machines for detecting and resolving feature interactions},
	journal = {Computer Science and Information Systems},
	volume = {9},
	number = {3},
	year = {2012},
	note = {cited By 2},
	pages = {1045-1074},
	doi = {10.2298/CSIS111216033D},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84867471411\&doi=10.2298\%2fCSIS111216033D\&partnerID=40\&md5=a033e4838afaf44fbd961002569f0da2},
	author = {Dinkelaker, T. and Erradi, M. and Ayache, M.}
}
@conference {ElGhayam2011,
	title = {Distributed context management in collaborative environment},
	booktitle = {2011 11th Annual International Conference on New Technologies of Distributed Systems, NOTERE 2011 - Proceedings},
	year = {2011},
	note = {cited By 0},
	doi = {10.1109/NOTERE.2011.5957991},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-80052003691\&doi=10.1109\%2fNOTERE.2011.5957991\&partnerID=40\&md5=dccafacd8741c885d613457f2aae2039},
	author = {El Ghayam, Y. and Erradi, M.}
}
@conference {Zoubairi2011,
	title = {Dynamic QoS management in mobile services framework},
	booktitle = {International Conference on Multimedia Computing and Systems -Proceedings},
	year = {2011},
	note = {cited By 0},
	doi = {10.1109/ICMCS.2011.5945691},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961242339\&doi=10.1109\%2fICMCS.2011.5945691\&partnerID=40\&md5=dc02a4eb28cdfcfae12bca1fa64efde3},
	author = {Zoubairi, R. and Jarir, Z. and Erradi, M.}
}
@conference {Angoma2011101,
	title = {HaVe-2W3G: A vertical handoff solution between WLAN, WiMAX and 3G networks},
	booktitle = {IWCMC 2011 - 7th International Wireless Communications and Mobile Computing Conference},
	year = {2011},
	note = {cited By 8},
	pages = {101-106},
	doi = {10.1109/IWCMC.2011.5982514},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-80052450203\&doi=10.1109\%2fIWCMC.2011.5982514\&partnerID=40\&md5=678334f04e9317df81cc23e2cd3ea407},
	author = {Angoma, B. and Erradi, M. and Benkaouz, Y. and Berqia, A. and Charaf Akalay, M.}
}
@conference {ElGhayam2010151,
	title = {Decision tree based context management in a collaborative environment1},
	booktitle = {NOTERE{\textquoteright}10 - 10th Annual International Conference on New Technologies of Distributed Systems},
	year = {2010},
	note = {cited By 0},
	pages = {151-156},
	doi = {10.1109/NOTERE.2010.5536734},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77955951688\&doi=10.1109\%2fNOTERE.2010.5536734\&partnerID=40\&md5=b0648dfb2d81dbc54205839215559aaf},
	author = {El Ghayam, Y. and Erradi, M.}
}
@conference {Zoubairi2009,
	title = {Quality of service in MAQAME architecture},
	booktitle = {2009 Mediterrannean Microwave Symposium, MMS 2009},
	year = {2009},
	note = {cited By 0},
	doi = {10.1109/MMS.2009.5409836},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77950325416\&doi=10.1109\%2fMMS.2009.5409836\&partnerID=40\&md5=57718766b57322c34964257ba47d6ded},
	author = {Zoubairi, R. and Jarir, Z. and Erradi, M.}
}
@conference {Jarir2008,
	title = {A meta-level architecture for QoS awareness in a mobile environment},
	booktitle = {Proceedings - The 8th International Conference on New Technologies in Distributed Systems, NOTERE 2008},
	year = {2008},
	note = {cited By 2},
	doi = {10.1145/1416729.1416742},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-70349131226\&doi=10.1145\%2f1416729.1416742\&partnerID=40\&md5=73c5c53df3a2c82cd1331152f2192eae},
	author = {Jarir, Z. and Erradi, M.}
}
