@article {ElMouaatamid2020,
	title = {A Scalable Group Authentication Scheme Based on Combinatorial Designs with Fault Tolerance for the Internet of Things},
	journal = {SN Computer Science},
	volume = {1},
	number = {4},
	year = {2020},
	note = {cited By 2},
	abstract = {With the development of the Internet of Things, the scale of IoT system is becoming large. Due to the network congestion problems and the server capability, using unicast authentication will bring burden to the network link and server. In this paper, we propose a scalable group authentication scheme with fault tolerance based on combinatorial designs. Performance analysis of the proposed scheme is based on several metrics such as fault tolerance, scalability, energy consumption and storage overhead. Simulation results have shown that oval designs realize the best trade-off for all metrics. {\textcopyright} 2020, Springer Nature Singapore Pte Ltd.},
	doi = {10.1007/s42979-020-00247-3},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85127243319\&doi=10.1007\%2fs42979-020-00247-3\&partnerID=40\&md5=931f3209f31ffb24bb90442a553f5133},
	author = {El Mouaatamid, O. and Lahmer, M. and Belkasmi, M.}
}
@article {Rkizat2019168,
	title = {A New Quasi-Cyclic Majority Logic Codes Constructed from Disjoint Difference Sets by Genetic Algorithm},
	journal = {Advances in Intelligent Systems and Computing},
	volume = {756},
	year = {2019},
	note = {cited By 0},
	pages = {168-177},
	doi = {10.1007/978-3-319-91337-7_16},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85047321606\&doi=10.1007\%2f978-3-319-91337-7_16\&partnerID=40\&md5=c0583078d7ef801071c2f7c605348789},
	author = {Rkizat, K. and Nouh, S. and Lahmer, M. and Belkasmi, M.}
}
@conference {ElMouaatamid20181,
	title = {Construction and decoding of OSMLD codes derived from unital and oval designs},
	booktitle = {Proceedings - 2018 International Conference on Advanced Communication Technologies and Networking, CommNet 2018},
	year = {2018},
	pages = {1-7},
	doi = {10.1109/COMMNET.2018.8360280},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048321116\&doi=10.1109\%2fCOMMNET.2018.8360280\&partnerID=40\&md5=238e55fa6938985018e8315edfbc71f3},
	author = {El Mouaatamid, O. and Lahmer, M. and Belkasmi, M.}
}
@conference {Rkizat2017,
	title = {Construction and iterative threshold decoding for low rates Quasi-Cyclic One Step Majority logic decodable codes},
	booktitle = {2016 International Conference on Advanced Communication Systems and Information Security, ACOSIS 2016 - Proceedings},
	year = {2017},
	note = {cited By 0},
	abstract = {This paper investigates the construction and iterative threshold decoding of low rate Quasi-Cyclic One Step Majority logic codes based on combinatorial designs. These codes are constructed with two type of difference family: cyclic disjoint difference sets and cyclic disjoint difference family. They can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding (ITD) algorithm. We present an amelioration of ITD algorithm for decoding these codes. This algorithm modification can be applicable for every code rate. The performances of this algorithm for decoding these codes on Additive White Gaussian Noise (AWGN) channel, is investigated. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ACOSIS.2016.7843944},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015226293\&doi=10.1109\%2fACOSIS.2016.7843944\&partnerID=40\&md5=c6afb690075fcd98594cbdf6ea4475be},
	author = {Rkizat, K. and Lahmer, M. and Belkasmi, M. and Nouh, S.}
}
@article {Elmouaatamid2017299,
	title = {Group authentication with fault tolerance for internet of things},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {10542 LNCS},
	year = {2017},
	note = {cited By 0},
	pages = {299-307},
	abstract = {With proliferation of the Internet of Things (IoT) applications, it is expected that 50 billion connected devices will be operating amongst us by 2020, so the normal authentication mechanism will be a big issue to handle to avoid causing a serious burden to server. As it is known, some devices could share the same characteristics such as the same geographical area, the same features. In this case, these devices could be in the same group and the group will be identify by an identity. Taking advantages from this mechanism, all devices can be authenticated at the same time using the group identity. Among group authentication issues are if a member device of the group cannot authenticate with the distributor of the group intentionally or unintentionally, the group loses its identity. This loss of identity causes the authentication failure of the other group devices. To solve this issue in IoT a fault tolerance scheme introduced for the group authentication architecture. Our algorithm of fault tolerance allows reconstructing the group authentication identity despite the lack of broken devices of the group. Indeed, reconstructing the group identity can be performed by using multi-secret sharing scheme based on an error correcting codes if a sufficient number of the group devices are available. {\textcopyright} Springer International Publishing AG 2017.},
	doi = {10.1007/978-3-319-68179-5_26},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85034585657\&doi=10.1007\%2f978-3-319-68179-5_26\&partnerID=40\&md5=4674daff52472a601af95361285646e1},
	author = {Elmouaatamid, O. and Lahmer, M. and Belkasmi, M.}
}
@conference {ElMouaatamid2017,
	title = {One-step majority-logic decodable codes derived from oval designs},
	booktitle = {Proceedings - 2017 International Conference on Wireless Networks and Mobile Communications, WINCOM 2017},
	year = {2017},
	note = {cited By 0},
	abstract = {In this paper, we investigate the combinatorial design of a new class of One-Step Majority-Logic Decodable (OSMLD) codes, based on Balanced Incomplete Block Designs of type Oval, which are derived from finite geometry. We show that the constructed OSMLD codes provides high rates in addition to good correction capacities. Simulation results shows that the proposed codes converge well under iterative decoding with an efficient tradeoff between complexity and performances. {\textcopyright} 2017 IEEE.},
	doi = {10.1109/WINCOM.2017.8238185},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041435738\&doi=10.1109\%2fWINCOM.2017.8238185\&partnerID=40\&md5=cc9a3eeb1781ff8e1ea9d4a775da4221},
	author = {El Mouaatamid, O. and Lahmer, M. and Belkasmi, M. and M{\textquoteright}rabet, Z. and Yatribiz, A.}
}
@conference {Rkizat2015117,
	title = {Iterative threshold decoding of Quasi-Cyclic One Step Majority logic decodable codes},
	booktitle = {Proceedings of the 2015 5th World Congress on Information and Communication Technologies, WICT 2015},
	year = {2015},
	note = {cited By 0},
	pages = {117-122},
	abstract = {This paper presents a new class of Quasi-Cyclic One Step Majority logic codes of 1/2 rate constructed from perfect difference set. Theses codes can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding algorithm. Much of these codes is a subfamily of the LDPC codes and can be decoded using belief propagation algorithm. A comparison between our results and those for LDPC code in terms of BER performance are presented. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WICT.2015.7489656},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979763400\&doi=10.1109\%2fWICT.2015.7489656\&partnerID=40\&md5=c9fdc4ec618d801dc53c49b1b5cec0f5},
	author = {Rkizat, K. and Lahmer, M. and Belkasmi, M.}
}
@conference {Ouaskou2015,
	title = {A variant of HB protocols based on permutation for low-cost RFID},
	booktitle = {International Conference on Wireless Networks and Mobile Communications, WINCOM 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {The security issues of RFID technology have been subject of a large number of research documents for over a decade. Several protocols have been developed to ensure reliable access control, namely a family of lightweight authentication protocols since Hopper and Blum proposed the HB protocol in 2001. Taking into account security and performance aspects, we present a new protocol derived from HB+ in which we add the permutation function, providing more effective resistant execution environment of active attacks and with roughly the same complexity. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WINCOM.2015.7381322},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84965047054\&doi=10.1109\%2fWINCOM.2015.7381322\&partnerID=40\&md5=b58c88a2c45f92717f77780586fa9e13},
	author = {Ouaskou, M. and Lahmer, M. and Belkasmi, M.}
}
@conference { ISI:000256344200195,
	title = {Iterative threshold decoding of one step majority logic decodable block codes},
	booktitle = {2007 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY, VOLS 1-3},
	year = {2007},
	note = {7th IEEE International Symposium on Signal Processing and Information Technology, Cairo, EGYPT, DEC 15-18, 2007},
	pages = {1059+},
	publisher = {IEEE; IEEE Signal Proc Soc; IEEE Comp Soc},
	organization = {IEEE; IEEE Signal Proc Soc; IEEE Comp Soc},
	abstract = {In this paper an iterative decoding of one step majority logic decodable (OSMLD) block codes is studied. We use a soft-in soft-out of APP threshold algorithm which is able to decode theses codes nearly as well as belief propagation (BP) algorithm. The Computation time of the proposed algorithm is very low and good performance results are obtained on both AWGN and Rayleigh fading channels. A comparison of the proposed algorithm and BP algorithm is also presented. We succeed to apply EXIT chart technique to our iterative process.},
	isbn = {978-1-4244-1834-3},
	author = {Lahmer, M. and Belkasmi, M. and Ayoub, F.}
}
