Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1106
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMusa, Yusuf-
dc.contributor.authorFaki, Silas-
dc.contributor.authorOluwasegun, Adelaiye-
dc.date.accessioned2024-05-16T07:59:54Z-
dc.date.available2024-05-16T07:59:54Z-
dc.date.issued2023-06-01-
dc.identifier.urihttps://njccs.journals.ekb.eg/article_321171.html-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/1106-
dc.description.abstractThe emergence of the pervasive device has made log-in details more vulnerable to unauthorized access and damage. This is due to frequent changes in users of pervasive devices and the close affinity of many attackers. Most models available only prevent attackers from gaining access to user login details. This study proposed a model that both detects and reveals the attacker's identity using the strength of the Honey Encryption algorithm with the ability to build a randomized message encoding called a Distribution-Transforming Encoder (DTE). The proposed model has the capability of providing a guide to security operatives to track and arrest the suspected perpetrator. An evaluation of the model was carried out which shows a 62% success of revealing attackers. A further examination of the model shows that 21% of the attackers could gain access through close affinity to log-in users. An extension of the proposed model can be achieved by improving the detection rate of the model.en_US
dc.description.sponsorshipSelfen_US
dc.language.isoenen_US
dc.relation.ispartofseriesvol 5;-
dc.subjectCryptography, Honey Encryption, Pervasive Environment, Hacking, Securityen_US
dc.titleHoney Algorithm for Securing and Identifying Hackers in a Pervasive Environmenten_US
dc.typeArticleen_US
Appears in Collections:Research Articles

Files in This Item:
File Description SizeFormat 
Honey Algorithm for Securing and Identifying Hackers in a Pervasive Environment.pdfMain Article1.08 MBAdobe PDFView/Open


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