@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.}
}
@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 {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.}
}
