@conference { ISI:000376431400006,
	title = {Cryptographic Algorithm Approach for Low Cost RFID Systems},
	booktitle = {PROCEEDINGS OF THE MEDITERRANEAN CONFERENCE ON INFORMATION \& COMMUNICATION TECHNOLOGIES 2015, VOL 1},
	series = {Lecture Notes in Electrical Engineering},
	volume = {380},
	year = {2016},
	note = {Mediterranean Conference on Information and Communication Technologies (MedCT), MOROCCO, MAY 07-09, 2015},
	pages = {45-54},
	abstract = {Today the security of RFID systems is a very important issue especially for low cost RFID tags. Then, it is difficult for several researchers to adopt a strong encryption algorithm due to the extremely limited computational, storage and communication abilities of the tag. So, the priority in RFID systems is to ensure the integrity, confidentiality and authentication of messages using different algorithms (such as encryption and hashing algorithm). In this paper, we propose a lightweight symmetric key encryption approach that includes integrity as part of the encryption process in order to meet the resource limitations of low cost RFID tags. Furthermore we do not need to use separate hash functions to verify message integrity, thus leading to increase the computational efficiency of the system.},
	isbn = {978-3-319-30301-7; 978-3-319-30299-7},
	issn = {1876-1100},
	doi = {10.1007/978-3-319-30301-7\_6},
	author = {Labbi, Zouheir and Maarof, Ahmed and Senhadji, Mohamed and Belkasmi, Mostafa},
	editor = {ElOualkadi, A and Choubani, F and ElMoussati, A}
}
@conference { ISI:000389502600020,
	title = {Hybrid Encryption Approach Using Dynamic Key Generation and Symmetric Key Algorithm for RFID Systems},
	booktitle = {Networked Systems, NETYS 2016},
	series = {Lecture Notes in Computer Science},
	volume = {9944},
	year = {2016},
	note = {4th International Conference on Networked Systems (NETYS), Marrakech, MOROCCO, MAY 18-20, 2016},
	pages = {244-249},
	abstract = {The security of RFID systems become an important subject especially for low cost RFID tags. A lot of Cryptographic algorithms were proposed to insure the security and in the same time meet the resource limitations. In this paper, we proposed a hybrid cryptographic approach as symmetric key encryption technique which generate the key dynamically, together with integrity check parameters. The generation of key stream follows the chained approach, beginning from the initial key pre-shared. As a result, the computational complexity will be reduced as well as increase performance.},
	isbn = {978-3-319-46140-3; 978-3-319-46139-7},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-46140-3\_20},
	author = {Labbi, Zouheir and Maarof, Ahmed and Senhadji, Mohamed and Belkasmi, Mostafa},
	editor = {Abdulla, PA and DelporteGallet, C}
}
@conference { ISI:000391420400041,
	title = {Novel Mutual Authentication Scheme for Low-eCost RFID Systems},
	booktitle = {2016 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM)},
	year = {2016},
	note = {International Conference on Wireless Networks and Mobile Communications (WINCOM), Fez, MOROCCO, OCT 26-29, 2016},
	pages = {P240-P245},
	publisher = {Univ Sidi Mohamed Ben Abdellah; FST FES; MobiTic; IEEE; IEEE Commun Soc; FSDM; ENSIAS; FST Mohammedia; CLusMed; TICSM Res Pole; Master Tec; CNRST; EBSA Fez; Mobit Assoc},
	organization = {Univ Sidi Mohamed Ben Abdellah; FST FES; MobiTic; IEEE; IEEE Commun Soc; FSDM; ENSIAS; FST Mohammedia; CLusMed; TICSM Res Pole; Master Tec; CNRST; EBSA Fez; Mobit Assoc},
	abstract = {The importance of radio frequency identification (RFID) increases for its powerful capabilities for identifying, locating and automatic access control objects. Electronic Product Code Class 1 Generation 2 (EPC-C1G2) is served as the most popular standard for passive RFID tags. In the last year several schemes were proposed to improve security of EPC-C1G2, most of these schemes still vulnerable and cannot resist some attacks and others schemes exceeds the powerful computing capacity of passive tag. In this paper, we propose a new authentication mutual scheme compliant to EPC-C1G2 standard. The proposed scheme uses only ultra-lightweight operations, Cyclic Redundancy Code (CRC), exclusive OR (XOR) and Pseudo Random Number Generators (PRNG). We have demonstrated that proposed scheme resist against security attacks and more that is better than the previous schemes in terms of the communication and computation cost.},
	isbn = {978-1-5090-3837-4},
	author = {Maarof, Ahmed and Senhadji, Mohamed and Labbi, Zouheir and Belkasmi, Mostafa},
	editor = {ElKamili, M and Berrada, I and Badri, A and Ghennioui, H}
}
@conference { ISI:000361140000114,
	title = {A Congestion Game-based Routing Algorithm for Communicating VANETs},
	booktitle = {2014 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC)},
	series = {International Wireless Communications and Mobile Computing Conference},
	year = {2014},
	note = {10th International Wireless Communications \& Mobile Computing Conference (IWCMC), Nicosia, CYPRUS, AUG 04-08, 2014},
	pages = {672-677},
	publisher = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	organization = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	abstract = {Vehicular Ad Hoc Network (VANET) is considered as a special application of Mobile Ad Hoc Networks (MANETs) in road traffic, which can autonomously organize networks without infrastructure. VANETs enable vehicles on the road to communicate with each other and with road infrastructure using wireless capabilities. In the last few years, extensive research has been performed to extend Internet connectivity to VANETs. Indeed, several routing protocols have been proposed to determine routes between vehicles and gateways. In this paper, we propose a routing algorithm which is based on the Congestion Game to resolve the problem of network congestion in VANET and to provide the optimal Internet access paths. The simulation results show that the proposed routing algorithm has better feasibility and effectiveness for communicating VANETs.},
	isbn = {978-1-4799-0959-9},
	issn = {2376-6492},
	author = {Mabrouk, Abdelfettah and Senhadji, Mohamed and Kobbane, Abdellatif and Walid, Abdellaziz and Sabir, Essaid and Koutbi, Mohammed E. L.}
}
