@conference { ISI:000389502600042,
	title = {ABAC Model for Collaborative Cloud Services},
	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 = {385},
	isbn = {978-3-319-46140-3; 978-3-319-46139-7},
	issn = {0302-9743},
	author = {Madani, Mohamed Amine and Erradi, Mohammed},
	editor = {Abdulla, PA and DelporteGallet, C}
}
@conference { ISI:000389502600019,
	title = {An Approach to Resolve NP-Hard Problems of Firewalls},
	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 = {229-243},
	abstract = {Firewalls are a common solution to protect information systems from intrusions. In this paper, we apply an automata-based methodology to resolve several NP-Hard problems which have been shown in the literature to be fundamental for the study of firewall security policies. We also compute space and time complexities of our resolution methods.},
	isbn = {978-3-319-46140-3; 978-3-319-46139-7},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-46140-3\_19},
	author = {Khoumsi, Ahmed and Erradi, Mohamed and Ayache, Meryeme and Krombi, Wadie},
	editor = {Abdulla, PA and DelporteGallet, C}
}
@conference { ISI:000389502600039,
	title = {Deep Neural Networks for Medical Images},
	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 = {382},
	isbn = {978-3-319-46140-3; 978-3-319-46139-7},
	issn = {0302-9743},
	author = {Elaalyani, Issam and Erradi, Mohammed},
	editor = {Abdulla, PA and DelporteGallet, C}
}
@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:000389502600037,
	title = {Hybrid Homomorphic Encryption for Cloud Privacy},
	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 = {380},
	isbn = {978-3-319-46140-3; 978-3-319-46139-7},
	issn = {0302-9743},
	author = {Bensitel, Yasmina and Rahal, Romadi},
	editor = {Abdulla, PA and DelporteGallet, C}
}
@conference { ISI:000389502600004,
	title = {Nearest Neighbors Graph Construction: Peer Sampling to the Rescue},
	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 = {48-62},
	abstract = {In this paper, we propose an efficient KNN service, called KPS (KNN-Peer-Sampling). The KPS service can be used in various contexts e.g. recommendation systems, information retrieval and data mining. KPS borrows concepts from P2P gossip-based clustering protocols to provide a localized and efficient KNN computation in large-scale systems. KPS is a sampling-based iterative approach, combining randomness, to provide serendipity and avoid local minimum, and clustering, to ensure fast convergence. We compare KPS against the state of the art KNN centralized computation algorithm NNDescent, on multiple datasets. The experiments confirm the efficiency of KPS over NNDescent: KPS improves significantly on the computational cost while converging quickly to a close to optimal KNN graph. For instance, the cost, expressed in number of pairwise similarity computations, is reduced by approximate to 23\% and approximate to 49\% to construct high quality KNN graphs for Jester and MovieLens datasets, respectively. In addition, the randomized nature of KPS ensures eventual convergence, not always achieved with NNDescent.},
	isbn = {978-3-319-46140-3; 978-3-319-46139-7},
	issn = {0302-9743},
	doi = {10.1007/978-3-319-46140-3\_4},
	author = {Benkaouz, Yahya and Erradi, Mohammed and Kermarrec, Anne-Marie},
	editor = {Abdulla, PA and DelporteGallet, C}
}
@conference { ISI:000389502600045,
	title = {SNA: Detecting Influencers over Social Networks},
	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 = {388},
	isbn = {978-3-319-46140-3; 978-3-319-46139-7},
	issn = {0302-9743},
	author = {Aghmadi, Ali and Erradi, Mohammed and Kobbane, Abdellatif},
	editor = {Abdulla, PA and DelporteGallet, C}
}
