@article {ElHaddouti2022575,
	title = {A Secure and Trusted Fog Computing Approach based on Blockchain and Identity Federation for a Granular Access Control in IoT Environments},
	journal = {International Journal of Advanced Computer Science and Applications},
	volume = {13},
	number = {3},
	year = {2022},
	note = {cited By 0},
	pages = {575-584},
	abstract = {Fog computing is a new computing paradigm that is an extension of the standard cloud computing model, which can be adopted as a cost effective strategy for managing connected objects, by enabling real-time computing and communication for analytical and decision making. Nonetheless, even though Fog-based Internet of Things networks optimize the standard architecture by moving computing, storage, communication, and control decision closer to the edge network, the technology becomes open to malicious attackers and remains many business risks that are not yet resolved. In fact, access control, privacy as well as trust risks present major challenges in Internet of Things environments based on Fog computing due to the large scale distributed nature of devices at the Fog layer. In addition, the traditional authentication methods are not adequate in Fog-based Internet of Things contexts since they consume significantly more computation power and incur high latency. To deal with these gaps, we present in this paper a secure and trusted Fog Computing approach based on Blockchain and Identity Federation technologies for a granular access control in IoT environments. The proposed scheme uses Smart Contract concept and Attribute-Based Access Control model to ensure the level of security and scalability required for data integrity without resorting to a central authority to make an access decision {\textcopyright} 2022. International Journal of Advanced Computer Science and Applications.All Rights Reserved.},
	keywords = {Access control, Block-chain, Cloud-computing, Computing model, Computing paradigm, Cost effective strategies, Cost effectiveness, Decision making, Decisions makings, Digital storage, Fog, Fog computing, Identity federation, Internet of things, IOT, Real-time communication, Real-time computing, Smart contract, Trusted computing},
	doi = {10.14569/IJACSA.2022.0130368},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129902962\&doi=10.14569\%2fIJACSA.2022.0130368\&partnerID=40\&md5=65966293c50d57a061513c913c7b5bb3},
	author = {El Haddouti, S. and El Kettani, M.D.E.-C.}
}
@article {Baddi2020245,
	title = {Msnd: Multicast software defined network based solution to multicast tree construction},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {12293},
	year = {2020},
	note = {cited By 0},
	pages = {245-256},
	abstract = {Internet services provider propose increasingly numerous applications depend on multicast communication patterns, such as database synchronization, newsletter updates, video, and audio group streaming. In spite of, IP multicast is frequently suffered from scaling and instability, which causes internet provider administrators to avoid its utilization. While different multicast protocols in all layers, such as routing and switching, have been created by researchers and providers, through several years, to focus on security, congestion control, and scalability, our work aims to scale multicast regarding the number of supported multicast groups and sources in networks and multicast session. In this paper, we propose an SDN-based IP multicast tree construction module to support and deploy multicast communication-based services. To do so, we take advantage to compute multicast tree, in the centralized way, to achieve a dynamic tree construction algorithm that helps SDN controller to dynamically construct and adjust an optimal multicast tree in all multicast session. The experiments studies on the prototype and simulation system exhibit that our solution gives better performance contrasted with the traditional multicast tree construction algorithms, better also to SDN-based solution proposed in the literature, regarding multicast tree cost, delay, delay variation, and multicast tree construction delay. {\textcopyright} Springer Nature Switzerland AG 2020.},
	keywords = {Database synchronization, Forestry, Internet protocols, Internet services providers, Multicast communication, Multicast protocol, Multicast sessions, Multicast software, Multicast tree construction, Multicasting, Network security, Overlay networks, Simulation systems, Software defined networking, Trees (mathematics), Ubiquitous computing},
	doi = {10.1007/978-3-030-58008-7_20},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096412695\&doi=10.1007\%2f978-3-030-58008-7_20\&partnerID=40\&md5=f5004a1fb0f79381fe80ca313ad89b13},
	author = {Baddi, Y. and Sebbar, A. and Zkik, K. and Boulmalf, M. and El Kettani, M.D.E.-C.}
}
@article {Baddi2019255,
	title = {OSM-GKM optimal shared multicast-based solution for group key management in mobile IPv6},
	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 = {255-269},
	doi = {10.1007/978-3-030-05529-5_17},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85059959185\&doi=10.1007\%2f978-3-030-05529-5_17\&partnerID=40\&md5=2810614cfac2d08a325d997402510437},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@conference {El-Yahyaoui20181,
	title = {Evaluating and gates over encrypted data in cloud computing},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-8},
	doi = {10.1109/COMMNET.2018.8360255},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048328547\&doi=10.1109\%2fCOMMNET.2018.8360255\&partnerID=40\&md5=09228d71a4faa4f19cc5b91d7453e450},
	author = {El-Yahyaoui, A. and El Kettani, M.D.E.-C.}
}
@conference {El-Yahyaoui20181,
	title = {A new cryptographic method for cloud computing},
	booktitle = {Proceedings of 2017 International Conference of Cloud Computing Technologies and Applications, CloudTech 2017},
	volume = {2018-January},
	year = {2018},
	pages = {1-8},
	doi = {10.1109/CloudTech.2017.8284705},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046662752\&doi=10.1109\%2fCloudTech.2017.8284705\&partnerID=40\&md5=64b47be3d219a15b30f943cb0b474165},
	author = {El-Yahyaoui, A. and El Kettani, M.D.E.-C.}
}
@conference {Essadraoui2015,
	title = {Wireless sensor node{\textquoteright}s authentication scheme based on Multivariate Quadratic Quasi-groups},
	booktitle = {Proceedings of 2015 IEEE World Conference on Complex Systems, WCCS 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {Wireless sensor networks (WSN) are widely used in different fields (military, environment, .. ) and they can be connected to the Internet using the IP protocol, this connection will form the Internet of Things (IoT). Real deployment of WSNs needs keeping in mind serious security considerations. RSA or DSA are heavy protocols to be used on resource constrained devices, they contain complex computation. MQQ is computationally more efficient than classical cryptosystems like RSA and Diffie-Hellman. In this paper we focus on the authentication problem. We propose an authentication approach based on Multivariate Quadratic Quasi-groups (MQQ) for WSN, sensor nodes will do mutual authentication. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ICoCS.2015.7483320},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978379625\&doi=10.1109\%2fICoCS.2015.7483320\&partnerID=40\&md5=963b8c2d57065d60a5341626d08c9c84},
	author = {Essadraoui, Y. and El Kettani, M.D.E.-C.}
}
@article {Baddi2014253,
	title = {PIM-SM protocol with GRASP-RP selection algorithm based architecture to transparent mobile sources in multicast mobile IPv6 diffusion},
	journal = {Journal of Mobile Multimedia},
	volume = {9},
	number = {3-4},
	year = {2014},
	note = {cited By 1},
	pages = {253-272},
	abstract = {Due to the progress of network multimedia technology, Internet research community has proposed many Different multicast routing protocols to support efficient real-time multimedia application such as, IPTV, videoconferencing, group games. These applications require a multicast routing protocol in which packets arrive to multicast receptors within a minimum delay and delay variation. Nevertheless, these protocols does not take into account that group members may be mobile and have not been designed for mobile members and roaming sources, and has not been tested in wireless and mobile environment since they were developed for multicast parties whose members and sources are topologically stationary. Recently, as the performance of mobile hosts rapidly improves and the bandwidth of wireless access networks grows up, the expectation for mobile multimedia communication services including many-to-many communications begins a big necessary. Studying and solving multicast issues in the stationary multicast infrastructure has been largely studied in the literature. However, fewer efforts have been spent in the specific problems of mobile members and sources caused by the frequent change of membership and point of attachment. The main problematic of the multicast IP protocols in a Mobile IP environment is the frequent change of membership and members location, this can rapidly affect quality of both routing protocol scheme and multicast tree used, especially, the scenario of handover where a mobile source moves from attachment point in one sub-network to another one in another sub-network is challenging. A multicast source is identified by its Home Address HA. Since IP mobility implies acquisition of a new topologically Care-of-Address CoA at each handoff resulting in a change of identity of the multicast source, however, the established multicast routing states are always based on the home address of the mobile source. This paper addresses the issue of mobile Multicast routing by presenting a PIM-SM based architecture with a GRASP-RP selection algorithm. The key idea of this work is to make the handover of multicast sources transparent and avoid the reconstruction of the entire multicast-based tree, by using an architecture based in PIM-SM multicast distribution trees to hide the mobility of a mobile multicast source from the main multicast delivery tree. To estimate and evaluate our scheme, we implement simulation based in many metrics, simulation results show that good performance is achieved in terms of handoff latency, end-to-end delay, tree construction delay and others metrics. {\textcopyright} 2014 Rinton Press.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84893725131\&partnerID=40\&md5=829e43ba7bb7aaf0bc54f08635084c12},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@article {Baddi20141271,
	title = {Qos-based parallel GRASP algorithm for RP selection in PIM-SM multicast routing and mobile IPV6},
	journal = {International Review on Computers and Software},
	volume = {9},
	number = {7},
	year = {2014},
	note = {cited By 2},
	pages = {1271-1281},
	abstract = {On account the progress of network multimedia technology, more and more real-time multimedia applications arrive with the need to transmit information using multicast IP communication. These applications are more important with arrival of mobile IPv6 protocol with mobile members and require a multicast routing protocol which has packets arriving to members within a specified QoS guaranteed and a quick recovery mechanism. Multicast IP is a bandwidth-conserving technology that reduces traffic by simultaneously delivering a single stream of information to a group members. Internet research community has proposed many multicast routing protocols to support efficient multimedia application, expect that they were developed for multicast parties whose members are topologically stationary. The mobility of multicast receivers or senders may lead to serious problems, when a receiver or sender moves, the quality of full multicast tree may degrade hens multicast datagrams cannot be forwarded efficiently.D2V-RPM (delay and delay variation RP Manager) problem consist of choosing an optimal multicast router in the network as the root of the Shared RP Tree within a specified delay and delay variation bound, and recovering this RP if it{\textquoteright}s off optimal. This NP hard problem needs to be solved through a heuristic algorithm. In this paper we propose a new RP Management algorithm based on PGRAS Procedure. 2DV-PGRASP-RPM selects and recovers the RP by considering cost, delay and delay variation functions and can be easily integrated to bootstrap RP protocol used by PIM-SM protocol. Simulation results show that good performance is achieved in multicast cost. {\textcopyright} 2014 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84907817361\&partnerID=40\&md5=16f80129246fa69d8478a5ac9a1b72fb},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@article {Baddi2013235,
	title = {Parallel GRASP algorithm with delay and delay variation for Rendezvous Point selection in PIM-SM multicast routing},
	journal = {Journal of Theoretical and Applied Information Technology},
	volume = {57},
	number = {2},
	year = {2013},
	note = {cited By 2},
	pages = {235-243},
	abstract = {Many multicast routing protocols has proposed to support efficient multimedia application, PIM-SM protocol remains the most used multicast routing protocol; they propose using a Shared Rendezvous Point Tree SRPT to forward multicast packets. The prime problem concerning SRPT construction is to determine an optimal multicast router in the network as root; this problem is called RP selection. This problem influences the multicast routing tree structure, and therefore influences performances of the multicast session and multicast routing scheme. Determination of a best RP position is an NP complete problem, first proposed by Wall, which needs to be solved with a heuristic algorithm. In this paper we propose a new RP selection algorithm based on Parallel GRAS Procedure. 2DV-PGRASP-RP selects RP by considering cost, delay and delay variation functions and can be easily integrated to bootstrap RP protocol used by PIM-SM. Simulation results show that good performance is achieved in multicast cost. {\textcopyright} 2005 - 2013 JATIT \& LLS. All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84888107680\&partnerID=40\&md5=d338159536c87e716e7f7a98c0232757},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@conference {Baddi2012,
	title = {D2V-VNS-RPS: Delay and delay variation constrained algorithm based on Variable Neighborhood Search algorithm for RP Selection problem in PIM-SM protocol},
	booktitle = {Proceedings of 2012 International Conference on Complex Systems, ICCS 2012},
	year = {2012},
	note = {cited By 0},
	doi = {10.1109/ICoCS.2012.6458559},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874481974\&doi=10.1109\%2fICoCS.2012.6458559\&partnerID=40\&md5=8b28eeceffbaa5aff332a7611a7e3207},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@conference {Baddi201221,
	title = {MC-PIM-SM: Multicast routing protocol PIM-SM with Multiple Cores Shared tree for mobile IPv6 environment},
	booktitle = {2nd International Conference on Innovative Computing Technology, INTECH 2012},
	year = {2012},
	note = {cited By 0},
	pages = {21-26},
	doi = {10.1109/INTECH.2012.6457753},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874453066\&doi=10.1109\%2fINTECH.2012.6457753\&partnerID=40\&md5=a220ba5d044562a1477822f4ee24446d},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@article {Baddi2012429,
	title = {VND-CS: A Variable Neighborhood Descent Algorithm for Core Selection Problem in Multicast Routing Protocol},
	journal = {Communications in Computer and Information Science},
	volume = {293 PART 1},
	year = {2012},
	note = {cited By 0},
	pages = {429-443},
	doi = {10.1007/978-3-642-30507-8_37},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84880475720\&doi=10.1007\%2f978-3-642-30507-8_37\&partnerID=40\&md5=e5e720a0f5591de6f04960b82124be10},
	author = {Baddi, Y. and El Kettani, M.D.E.-C.}
}
@conference {ElAichi2011591,
	title = {Maturity models transition from eGovernment interoperability to t-government: Restyling dynamic public services through integrated transformation of service delivery},
	booktitle = {Proceedings of the European Conference on e-Government, ECEG},
	year = {2011},
	note = {cited By 0},
	pages = {591-602},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84870934201\&partnerID=40\&md5=325c84d83665729bf6b3ba713949b9f2},
	author = {El Aichi, M.M.E. and El Kettani, M.D.E.-C.}
}
@conference {ElKettani2009236,
	title = {NCSecMM: A national cyber security maturity model for an interoperable "National cyber security" framework},
	booktitle = {Proceedings of the European Conference on e-Government, ECEG},
	year = {2009},
	note = {cited By 2},
	pages = {236-247},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84871878180\&partnerID=40\&md5=5b922df54e6a4812752ad717ef5a6b95},
	author = {El Kettani, M.D.E.-C. and Debbagh, T.}
}
@conference {ElKettani2008373,
	title = {NCSec-A national Cyber security Referential for the development of a code of practice in national Cyber security management},
	booktitle = {ACM International Conference Proceeding Series},
	volume = {351},
	year = {2008},
	note = {cited By 1},
	pages = {373-380},
	doi = {10.1145/1509096.1509174},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-70349154613\&doi=10.1145\%2f1509096.1509174\&partnerID=40\&md5=472b2d57a810d6024f9a4b02047a233d},
	author = {El Kettani, M.D.E.-C. and Debbagh, T.}
}
