一种基于结构化点对点覆盖网络的新型匿名通信策略

Yanhui Wu
{"title":"一种基于结构化点对点覆盖网络的新型匿名通信策略","authors":"Yanhui Wu","doi":"10.1109/ISITAE.2007.4409353","DOIUrl":null,"url":null,"abstract":"Structured peer-to-peer overlay networks provide a self-organizing, scalable and fault tolerant substrate for cooperative peer-to-peer applications. The rerouting-based anonymous communication protocol building on the structured Peer-to-Peer network is put forward in this paper. Resorting to the self-organizing, structured overlay network, the anonymous strategy does not need a administrant node. Because of the opening character of overlay network, the relation on the expected value of rerouting path length and forward probability, and the relation on the degree of anonymity and the number of malicious nodes are analyzed in this paper. Moreover, the probability, which malicious nodes find the initiator, is increasing with the rounds which the initiator builds the rerouting path. The calculation result demonstrates that descending forward probability makes the expected value of rerouting path length decreases distinctly, therefore limits the communication delay.","PeriodicalId":332503,"journal":{"name":"2007 First IEEE International Symposium on Information Technologies and Applications in Education","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel anonymous communication strategy based on Structured peer-to-peer overlay networks\",\"authors\":\"Yanhui Wu\",\"doi\":\"10.1109/ISITAE.2007.4409353\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Structured peer-to-peer overlay networks provide a self-organizing, scalable and fault tolerant substrate for cooperative peer-to-peer applications. The rerouting-based anonymous communication protocol building on the structured Peer-to-Peer network is put forward in this paper. Resorting to the self-organizing, structured overlay network, the anonymous strategy does not need a administrant node. Because of the opening character of overlay network, the relation on the expected value of rerouting path length and forward probability, and the relation on the degree of anonymity and the number of malicious nodes are analyzed in this paper. Moreover, the probability, which malicious nodes find the initiator, is increasing with the rounds which the initiator builds the rerouting path. The calculation result demonstrates that descending forward probability makes the expected value of rerouting path length decreases distinctly, therefore limits the communication delay.\",\"PeriodicalId\":332503,\"journal\":{\"name\":\"2007 First IEEE International Symposium on Information Technologies and Applications in Education\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 First IEEE International Symposium on Information Technologies and Applications in Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITAE.2007.4409353\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 First IEEE International Symposium on Information Technologies and Applications in Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITAE.2007.4409353","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

结构化点对点覆盖网络为协作式点对点应用提供了自组织、可扩展和容错的基础。提出了一种在结构化点对点网络上建立的基于重路由的匿名通信协议。采用自组织、结构化的覆盖网络,匿名策略不需要管理节点。由于覆盖网络的开放性,本文分析了其重路由路径长度期望值与转发概率、匿名度与恶意节点数之间的关系。此外,恶意节点发现发起者的概率随着发起者建立重路由路径的次数增加而增加。计算结果表明,正向概率的减小使得重路由路径长度的期望值明显减小,从而限制了通信延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel anonymous communication strategy based on Structured peer-to-peer overlay networks
Structured peer-to-peer overlay networks provide a self-organizing, scalable and fault tolerant substrate for cooperative peer-to-peer applications. The rerouting-based anonymous communication protocol building on the structured Peer-to-Peer network is put forward in this paper. Resorting to the self-organizing, structured overlay network, the anonymous strategy does not need a administrant node. Because of the opening character of overlay network, the relation on the expected value of rerouting path length and forward probability, and the relation on the degree of anonymity and the number of malicious nodes are analyzed in this paper. Moreover, the probability, which malicious nodes find the initiator, is increasing with the rounds which the initiator builds the rerouting path. The calculation result demonstrates that descending forward probability makes the expected value of rerouting path length decreases distinctly, therefore limits the communication delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信