Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/104452
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Industrial and Systems Engineering | - |
| dc.creator | Yang, Y | en_US |
| dc.creator | Chen, F | en_US |
| dc.creator | Chen, J | en_US |
| dc.creator | Zhang, Y | en_US |
| dc.creator | Yung, KL | en_US |
| dc.date.accessioned | 2024-02-05T08:50:02Z | - |
| dc.date.available | 2024-02-05T08:50:02Z | - |
| dc.identifier.issn | 1751-7575 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/104452 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Taylor & Francis | en_US |
| dc.rights | © 2019 Informa UK Limited, trading as Taylor & Francis Group | en_US |
| dc.rights | This is an Accepted Manuscript of an article published by Taylor & Francis in Enterprise Information Systems on 08 Jan 2019 (published online), available at: http://www.tandfonline.com/10.1080/17517575.2018.1564942. | en_US |
| dc.subject | Avalanche | en_US |
| dc.subject | Collision resistance | en_US |
| dc.subject | Compression function | en_US |
| dc.subject | Feedback iterative structure | en_US |
| dc.subject | Hash function | en_US |
| dc.title | A secure hash function based on feedback iterative structure | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.spage | 281 | en_US |
| dc.identifier.epage | 302 | en_US |
| dc.identifier.volume | 13 | en_US |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.doi | 10.1080/17517575.2018.1564942 | en_US |
| dcterms.abstract | Rapid growth of internet data has created enormous security challenges on authenticity, availability and integrity protection of these outsourced data. Hash function is one of the main solutions to face these challenges. This paper proposes a feedback iterative structure of hash function which utilises the variable feedback to resist attacks. Furthermore, to accelerate message diffusion, two novel modules are designed, one for iteration and the other for truncation. Experimental results show that the proposed hash function can effectively resist existing attacks. Moreover, comparing with other existing hash functions, it displays better on statistical performance, collision resistance and avalanche. | - |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | Enterprise information systems, 2019, v. 13, no. 3, p. 281-302 | en_US |
| dcterms.isPartOf | Enterprise information systems | en_US |
| dcterms.issued | 2019 | - |
| dc.identifier.scopus | 2-s2.0-85059957797 | - |
| dc.identifier.eissn | 1751-7583 | en_US |
| dc.description.validate | 202402 bcch | - |
| dc.description.oa | Accepted Manuscript | en_US |
| dc.identifier.FolderNumber | ISE-0497 | - |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China; Technology Planning Project from Guangdong Province of China; Science and Technology Plan Projects of Shenzhen; The Hong Kong Polytechnic University | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.identifier.OPUS | 60284795 | - |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Yung_Secure_Hash_Function.pdf | Pre-Published version | 1.12 MB | Adobe PDF | View/Open |
Page views
104
Last Week
4
4
Last month
Citations as of Nov 30, 2025
Downloads
93
Citations as of Nov 30, 2025
SCOPUSTM
Citations
15
Citations as of Dec 19, 2025
WEB OF SCIENCETM
Citations
11
Citations as of Dec 18, 2025
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



