摘要
针对已有认证数据结构方案不能很好地解决P2P环境下的数据认证问题,在Goodrich认证跳表基础上,提出了分布式认证跳表(distributed authenticated skip list,DASL)并给出其设计思想及其在P2P环境下的存储方案.在仅利用分布式系统中最基本的分布对象定位算法locate的基础上,设计了对象查询路径获取算法、对象验证算法以及对象插入和删除算法,并应用概率论和数理统计的方法对DASL的代价进行了理论分析和比较,结果表明DASL方案优于全签方案.由于DASL的实现不依赖于分布式系统中locate操作的实现细节,从而具有简单性、可扩展性和可用性,因此易于应用到现有的P2P存储系统中,以满足其数据认证需求.
Aiming at the problem of data authenticated in P2P storage environments, a distributed authenticated skip list (DASL) based on Goodrich's method was proposed. The path- searching algorithm, object authentication algorithm as well as object insertion/deletion algorithm based on the distributed object location algorithm were also presented. The analysis of DASL cost was given and the employed probability theory and statistical analysis were compared. Such analysis show that the DASL scheme is more efficient than sign-all scheme. The implementation of the DASL does not rely on the location algorithm, which makes it simple, expandable, and feasible. Therefore, the DASL can be easily applied to the existing P2P storage system and fulfills the data authentication requirements.
出处
《东北大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2012年第1期73-76,共4页
Journal of Northeastern University(Natural Science)
基金
国家高技术研究发展计划项目(2009AA01Z122)
国家自然科学基金资助项目(60872040)
沈阳市自然科学基金资助项目(F10-205-1-12)
关键词
P2P存储
认证数据结构
数据认证
分布式认证跳表
签名摊销
peer-to-peer storage
authenticated data structures
data authentication
distributed authenticated skip list
signature amortization