检索结果-内蒙古大学图书馆

A challenge-based trust establishment protocol for peer-to-peer networks

SECURITY AND COMMUNICATION NETWORKS 2011年第1期4卷 71-78页

作者： Chen, Pei-Te Laih, Chi-Sung Natl Cheng Kung Univ Dept Elect Engn Tainan 701 Taiwan

Establishing trust relationships between peers is an essential approach to prevent threats. Most current approaches concentrate on polling algorithms to evaluate peer trustworthiness, but these approaches are either system-expensive or inefficient. In this paper, we propose a concrete challenge-based trust protocol for P2P networks. Our protocol uses challenge-response operations in each trust evaluation phase and validates every contacted peer along with recording their corresponding trust value. The scheme in our protocol utilizes random selection of challenges, and does not reveal additional information, so malicious peers have little opportunity to tamper with the P2P systems. Simulation results show our protocol saves communication cost by around 90%. We suggest a tolerance value of 0.2 which gives a design reference for implementing new P2P trust-establishing protocols. Copyright (C) 2010 John Wiley & Sons, Ltd.

关键词： reputation-based trust schemes Peer-to-peer(P2P) networks challenge-based trust protocol polling algorithms

来源：评论

学校读者我要写书评

暂无评论

ON THE COMPLEXITY OF SOME ADAPTIVE polling algorithms IN GENERAL NETWORKS

引用

International Journal of Foundations of Computer Science 1999年第2期10卷 211-223页

作者： SAVIO S. H. TSE FRANCIS C. M. LAU Department of Computer Science & Information Systems The University of Hong Kong Pokfulam Road Hong Kong P.R.China

We study the problem of adaptive polling in undirected general networks. polling, also known as broadcast-confirm, consists a propagation round and a feedback round. In adaptive polling, a spanning tree of unknown topology is built dynamically during the propagation round, and feedback messages are free to choose their paths in order to adapt to traffic and fault situations. We study three adaptive polling algorithms and analyze their worst-case communication bit complexities in the propagation round. Then, we prove a lower bound on the worst-case communication bit complexity of Ω(e+n log n) in the propagation round for all algorithms of the same kind as the three algorithms we study, where n is the number of nodes, and e the number of edges. We conclude that the cost introduced into the network due to the running of an adaptive polling algorithm is mild.

关键词： polling algorithms broadcasting communication complexity graph algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：