Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/33982
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKHALDI, Amine-
dc.contributor.authorBOUREGA, Lokmane-
dc.contributor.authorGHERBI, Leila-
dc.date.accessioned2023-09-13T10:52:37Z-
dc.date.available2023-09-13T10:52:37Z-
dc.date.issued2023-
dc.identifier.urihttps://dspace.univ-ouargla.dz/jspui/handle/123456789/33982-
dc.descriptionPeople’s Democratic Republic of Algeria Ministry of Higher Education and Scientific Research University Kasdi Merbah Ouargla Faculty of New Technologies of Information and Communicationen_US
dc.description.abstracttions and has been widely studied. However, the original FL is still vulnerable to poisoning and inference attacks, which will hinder the landing application of FL. Therefore, it is essential to design a trustworthy federation learning (TFL) to eliminate users’ anxiety. In this paper, we aim to provide a well-researched picture of the security and privacy issues in FL that can bridge the gap to TFL. Firstly, we define the desired goals and critical requirements of TFL, observe the FL model from the perspective of the adversaries and extrapolate the roles and capabilities of potential adversaries backward. Subsequently, we summarize the current mainstream attack and defense means and analyze the charac teristics of the different methods. Based on a priori knowledge, we propose directions for realising the future of TFL that deserve attentionen_US
dc.description.sponsorshipUniversity Kasdi Merbah Ouarglaen_US
dc.language.isofren_US
dc.publisherUniversity Kasdi Merbah Ouarglaen_US
dc.subjectTrusten_US
dc.subjectFederated Learningen_US
dc.subjectPrivacyen_US
dc.titleTrust-based in Federated Learningen_US
dc.typeThesisen_US
Appears in Collections:Département d'informatique et technologie de l'information - Master

Files in This Item:
File Description SizeFormat 
BOUREGA-CHERBI.pdf3,9 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.