计算机科学 ›› 2011, Vol. 38 ›› Issue (9): 32-35.
• 计算机网络与信息安全 • 上一篇 下一篇
徐剑，陈旭，李福祥，周福才
出版日期:
发布日期:
基金资助:
XU Jian， CHEN Xu， LI Fu-xiang， ZHOU Fu-cai
Online:
Published:
摘要： 作为一种重要的认证数据结构，认证跳表在数据认证机制中有着广泛的应用。由于哈希模式对认证跳表的代价有显著的影响，因此提出哈希模式和数据存储模式分离的思想，设计了一种新的认证哈希模式—有向哈希树，并在其基础上设计了新的认证跳表算法。应用分层数据处理、概率分析等数学方法对所提出算法的代价进行了理论分析，并与已有的认证跳表算法做了性能比较。结果表明，本算法在时间、通信和存储代价方面有了较大的改进。
关键词: 认证跳表，认证哈希模式，有向哈希树，认证数据结构
Abstract: Authenticated skip list is an important authenticated data structures. It has been widely used in data authenticanon. Since the hash scheme has the important influence on the cost of the authenticated skip fist, a new hash scheme which is based on the idea of separating the hash scheme and data storage scheme was proposed in this paper. And the new algorithm of authenticated skip list(ASI: DHT for short) based on directed hash tree was also proposed. We applied hierarchical data processing and probability analysis methods to analyze the cost of ASL-DHT, and also made an algorithm simulation to compare with that of the original authenticated skip list. hhc results show that, ASI= DH T algorithm has got great improvement on storage cost, communication cost, and time cost.
Key words: Authenticated skip fist, Authenticated hash scheme, Directed hash tree, Authenticated data structures
徐剑，陈旭，李福祥，周福才. 基于有向哈希树的认证跳表算法[J]. 计算机科学, 2011, 38(9): 32-35. https://doi.org/
XU Jian， CHEN Xu， LI Fu-xiang， ZHOU Fu-cai. Algorithm of Authenticated Skip List Based on Directed Hash Tree[J]. Computer Science, 2011, 38(9): 32-35. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2011/V38/I9/32
Cited
首页