区域卫生信息网络数据真实性验证系统的开发

T. Zhou, Jing-song Li, Xiaoguang Zhang, Zhen Hu, Hai-Yan Yu, Huan Chen
{"title":"区域卫生信息网络数据真实性验证系统的开发","authors":"T. Zhou, Jing-song Li, Xiaoguang Zhang, Zhen Hu, Hai-Yan Yu, Huan Chen","doi":"10.1109/ITIME.2009.5236451","DOIUrl":null,"url":null,"abstract":"A diverse child nodes hash tree method was proposed to make the digest structure more flexible, improving the data authenticity verification efficiency in regional health information network which has a great number of medical documents. The new hash tree method changes the former hash list from one-layer digest to a tree structure, using category search to enormously accelerate verification processes, and locating multi-“error file” at the same time. According to the current hardware, we designed experiments to obtain the curves of “hash tree computing time-child nodes” and “hash tree verification time-child nodes”. Based on the two curves, a weight analysis method was proposed to determine the number of child nodes, making the entire system more efficient. By increasing a small amount of data redundancy, the diverse child nodes hash tree method greatly enhances the verification efficiency.","PeriodicalId":398477,"journal":{"name":"2009 IEEE International Symposium on IT in Medicine & Education","volume":"1997 17","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Development of data authenticity verification system in regional health information network\",\"authors\":\"T. Zhou, Jing-song Li, Xiaoguang Zhang, Zhen Hu, Hai-Yan Yu, Huan Chen\",\"doi\":\"10.1109/ITIME.2009.5236451\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A diverse child nodes hash tree method was proposed to make the digest structure more flexible, improving the data authenticity verification efficiency in regional health information network which has a great number of medical documents. The new hash tree method changes the former hash list from one-layer digest to a tree structure, using category search to enormously accelerate verification processes, and locating multi-“error file” at the same time. According to the current hardware, we designed experiments to obtain the curves of “hash tree computing time-child nodes” and “hash tree verification time-child nodes”. Based on the two curves, a weight analysis method was proposed to determine the number of child nodes, making the entire system more efficient. By increasing a small amount of data redundancy, the diverse child nodes hash tree method greatly enhances the verification efficiency.\",\"PeriodicalId\":398477,\"journal\":{\"name\":\"2009 IEEE International Symposium on IT in Medicine & Education\",\"volume\":\"1997 17\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on IT in Medicine & Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITIME.2009.5236451\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on IT in Medicine & Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITIME.2009.5236451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种多子节点哈希树方法,使摘要结构更加灵活,提高了具有大量医疗文档的区域卫生信息网络中数据真实性验证的效率。新的哈希树方法将原来的哈希表由一层摘要改为树形结构,利用分类搜索极大地加快了验证过程,并可同时定位多个“错误文件”。根据现有的硬件,我们设计了实验,得到了“哈希树计算时间子节点”和“哈希树验证时间子节点”的曲线。在这两条曲线的基础上,提出了一种权重分析法来确定子节点的数量,从而提高了整个系统的效率。多子节点哈希树方法通过增加少量的数据冗余,大大提高了验证效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Development of data authenticity verification system in regional health information network
A diverse child nodes hash tree method was proposed to make the digest structure more flexible, improving the data authenticity verification efficiency in regional health information network which has a great number of medical documents. The new hash tree method changes the former hash list from one-layer digest to a tree structure, using category search to enormously accelerate verification processes, and locating multi-“error file” at the same time. According to the current hardware, we designed experiments to obtain the curves of “hash tree computing time-child nodes” and “hash tree verification time-child nodes”. Based on the two curves, a weight analysis method was proposed to determine the number of child nodes, making the entire system more efficient. By increasing a small amount of data redundancy, the diverse child nodes hash tree method greatly enhances the verification efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信