Vis enkel innførsel

dc.contributor.authorFauzi, Muhammad Ali
dc.contributor.authorYang, Bian
dc.contributor.authorMartiri, Edlira
dc.date.accessioned2021-03-12T07:44:47Z
dc.date.available2021-03-12T07:44:47Z
dc.date.created2020-12-22T10:59:48Z
dc.date.issued2020
dc.identifier.isbn978-981-15-6048-4
dc.identifier.urihttps://hdl.handle.net/11250/2733005
dc.description.abstractThe main challenge in a honeywords system is how to generate artificial passwords (honeywords) that are indistinguishable from the genuine password (sugarword). It is straightforward to consider the PassGAN for generating honeywords from the defender’s perspective. In this work, we analyze a game situation between the defender and the attacker assuming the two parties exploit the PassGAN for their own competing advantage, i.e., the defender uses the generator model of PassGAN to generate honeywords, and the attacker uses the discriminator model of PassGAN to detect the sugarword. In this game, we investigate the feasibility of PassGAN as a honeywords generation strategy and the possible strategies that can be used by the defender and the attacker to reach their goal. The best strategy for the attacker is to use a large number of iterations and to use the same dataset as the defender. From the defender’s point of view, the strategy of using many iterations is also beneficial to reduce the attacker’s success rate.en_US
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.relation.ispartofAdvances on Smart and Soft Computing
dc.titlePassGAN for Honeywords: Evaluating the Defender and the Attacker Strategiesen_US
dc.typeChapteren_US
dc.description.versionacceptedVersionen_US
dc.source.pagenumber391-401en_US
dc.identifier.doihttps://doi.org/10.1007/978-981-15-6048-4_34
dc.identifier.cristin1862673
dc.description.localcode"This is a post-peer-review, pre-copyedit version of an article. Locked until 20.10.2021 due to copyright restrictions.en_US
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel