Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/18101
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAkif, OZ-
dc.contributor.authorSabeeh, AF-
dc.contributor.authorRodgers, GJ-
dc.contributor.authorAl-Raweshidy, HS-
dc.date.accessioned2019-05-16T11:17:09Z-
dc.date.available2019-01-01-
dc.date.available2019-05-16T11:17:09Z-
dc.date.issued2019-01-01-
dc.identifier.citationInternational Journal of Advanced Computer Science and Applications, 2019, 10 (3), pp. 28 - 37en_US
dc.identifier.issn2158-107X-
dc.identifier.issnhttp://dx.doi.org/10.14569/IJACSA.2019.0100305-
dc.identifier.issn2156-5570-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/18101-
dc.description.abstractHoneywords (decoy passwords) have been proposed to detect attacks against hashed password databases. For each user account, the original password is stored with many honeywords in order to thwart any adversary. The honeywords are selected deliberately such that a cyber-attacker who steals a file of hashed passwords cannot be sure, if it is the real password or a honeyword for any account. Moreover, entering with a honeyword to login will trigger an alarm notifying the administrator about a password file breach. At the expense of increasing the storage requirement by 24 times, the authors introduce a simple and effective solution to the detection of password file disclosure events. In this study, we scrutinise the honeyword system and highlight possible weak points. Also, we suggest an alternative approach that selects the honeywords from existing user information, a generic password list, dictionary attack, and by shuffling the characters. Four sets of honeywords are added to the system that resembles the real passwords, thereby achieving an extremely flat honeywords generation method. To measure the human behaviours in relation to trying to crack the password, a testbed engaged with by 820 people was created to determine the appropriate words for the traditional and proposed methods. The results show that under the new method it is harder to obtain any indication of the real password (high flatness) when compared with traditional approaches and the probability of choosing the real password is 1/k, where k = number of honeywords plus the real password.en_US
dc.format.extent28 - 37-
dc.language.isoenen_US
dc.publisherSAI Organizationen_US
dc.subjectHoneywords;en_US
dc.subjectuser behaviours;en_US
dc.subjectworst password list;en_US
dc.subjectdictionary attacken_US
dc.titleAchieving flatness: Honeywords generation method for passwords based on user behavioursen_US
dc.typeArticleen_US
dc.identifier.doihttp://dx.doi.org/10.14569/IJACSA.2019.0100305-
dc.relation.isPartOfInternational Journal of Advanced Computer Science and Applications-
pubs.issue3-
pubs.publication-statusPublished-
pubs.volume10-
dc.identifier.eissn2156-5570-
Appears in Collections:Dept of Mathematics Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf808.47 kBAdobe PDFView/Open


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