{"created":"2020-09-28T10:42:24.229247+00:00","id":5526,"links":{},"metadata":{"_buckets":{"deposit":"5eb8ec2e-4476-4a3f-8ebc-0ee04b97200d"},"_deposit":{"created_by":30,"id":"5526","owner":"30","owners":[30],"owners_ext":{"displayname":"","email":"khinmohmohaung@gmail.com","username":""},"pid":{"revision_id":0,"type":"recid","value":"5526"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/5526","sets":["1582963413512:1596119372420"]},"communities":["ytu"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Enhanced Honey Encryption Algorithm for Increasing Message Space against Brute Force Attack","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"Abstract –In the era of digitization, data security is a vital role in\nmessage transmission and all systems that deal with users require\nstronger encryption techniques that against brute force attack.\nHoney encryption (HE) algorithm is a user data protection\nalgorithm that can deceive the attackers from unauthorized\naccess to user, database and websites. The main part of\nconventional HE is distribution transforming encoder (DTE).\nHowever, the current DTE process using cumulative distribution\nfunction (CDF) has the weakness in message space limitation\nbecause CDF cannot solve the probability theory in more than\nfour messages. So, we propose a new method in DTE process\nusing discrete distribution function in order to solve message\nspace limitation problem. In our proposed honeywords\ngeneration method, the current weakness of existing honeywords\ngeneration method such as storage overhead problem can be\nsolved. In this paper, we also describe the case studies\ncalculation of DTE in order to prove that new DTE process has\nno message space limitation and mathematical model using\ndiscrete distribution function for DTE process facilitates the\ndistribution probability theory."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value_mlt":[{"interim":"data security"},{"interim":"honey encryption"},{"interim":"distribution transforming encoder"},{"interim":"message space limitation"}]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2020-09-28"}],"displaytype":"preview","filename":"ECTICon.2018.8620050.pdf","filesize":[{"value":"171 Kb"}],"format":"application/pdf","licensetype":"license_0","url":{"url":"https://meral.edu.mm/record/5526/files/ECTICon.2018.8620050.pdf"},"version_id":"3a47111e-fcf5-4724-a435-c0a80115d8d3"}]},"item_1583103147082":{"attribute_name":"Conference papers","attribute_value_mlt":[{"subitem_acronym":"ICEECTIT","subitem_c_date":"2018-07-18","subitem_conference_title":"15th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology","subitem_place":"Thailand"}]},"item_1583105942107":{"attribute_name":"Authors","attribute_value_mlt":[{"subitem_authors":[{"subitem_authors_fullname":"Khin Su Myat Moe"},{"subitem_authors_fullname":"Thanda Win"}]}]},"item_1583108359239":{"attribute_name":"Upload type","attribute_value_mlt":[{"interim":"Publication"}]},"item_1583108428133":{"attribute_name":"Publication type","attribute_value_mlt":[{"interim":"Conference paper"}]},"item_1583159729339":{"attribute_name":"Publication date","attribute_value":"2018-07-18"},"item_title":"Enhanced Honey Encryption Algorithm for Increasing Message Space against Brute Force Attack","item_type_id":"21","owner":"30","path":["1596119372420"],"publish_date":"2020-09-28","publish_status":"0","recid":"5526","relation_version_is_last":true,"title":["Enhanced Honey Encryption Algorithm for Increasing Message Space against Brute Force Attack"],"weko_creator_id":"30","weko_shared_id":-1},"updated":"2021-12-13T01:15:57.554525+00:00"}