Csaád Bertók, Andrea Huszti, Tamás Kádek, Zsanett Jámbor
{"title":"基于多轮双线性映射的安全密码哈希方案","authors":"Csaád Bertók, Andrea Huszti, Tamás Kádek, Zsanett Jámbor","doi":"10.1109/CITDS54976.2022.9914189","DOIUrl":null,"url":null,"abstract":"We construct a multi-round, secure password hashing scheme that is designed to be resistant against off-line attacks, such as brute force, dictionary and rainbow table attacks. We compare our scheme to the password hashing algorithms used in practice from the point of view of the technical requirements of the Password Hashing Competition. We provide a security analysis, which shows that the proposed algorithm is also collision, hence second pre-image resistant.","PeriodicalId":271992,"journal":{"name":"2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS)","volume":"56 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A multi-round bilinear-map-based secure password hashing scheme\",\"authors\":\"Csaád Bertók, Andrea Huszti, Tamás Kádek, Zsanett Jámbor\",\"doi\":\"10.1109/CITDS54976.2022.9914189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We construct a multi-round, secure password hashing scheme that is designed to be resistant against off-line attacks, such as brute force, dictionary and rainbow table attacks. We compare our scheme to the password hashing algorithms used in practice from the point of view of the technical requirements of the Password Hashing Competition. We provide a security analysis, which shows that the proposed algorithm is also collision, hence second pre-image resistant.\",\"PeriodicalId\":271992,\"journal\":{\"name\":\"2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS)\",\"volume\":\"56 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CITDS54976.2022.9914189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CITDS54976.2022.9914189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A multi-round bilinear-map-based secure password hashing scheme
We construct a multi-round, secure password hashing scheme that is designed to be resistant against off-line attacks, such as brute force, dictionary and rainbow table attacks. We compare our scheme to the password hashing algorithms used in practice from the point of view of the technical requirements of the Password Hashing Competition. We provide a security analysis, which shows that the proposed algorithm is also collision, hence second pre-image resistant.