主页期刊介绍编委会编辑部服务介绍道德声明在线审稿编委办公编辑办公English
2018-2019年专刊出版计划 微信服务介绍 最新一期:2019年第10期
     
在线出版
各期目录
纸质出版
分辑系列
论文检索
论文排行
综述文章
专刊文章
美文分享
各期封面
E-mail Alerts
RSS
旧版入口
中国科学院软件研究所
  
投稿指南 问题解答 下载区 收费标准 在线投稿
眭鸿飞,陈松乔,陈建二,王建新,王伟平.基于重路由匿名通信系统的负载分析.软件学报,2004,15(2):278-285
基于重路由匿名通信系统的负载分析
Payload Analysis of Rerouting-Based Anonymous Communication Systems
投稿时间:2002-12-04  修订日期:2003-06-23
DOI:
中文关键词:  网络安全  信息隐藏  匿名通信
英文关键词:network security  information hiding  anonymous communication
基金项目:Supported by the National Natural Science Foundation of China under Grant No.90104028(国家自然科学基金);the National Science Foundation for Distinguished Young Scholars of China under Grant No.69928201(国家杰出青年科学基金)
作者单位
眭鸿飞 中南大学,信息科学与工程学院,湖南,长沙,410083 
陈松乔 中南大学,信息科学与工程学院,湖南,长沙,410083 
陈建二 中南大学,信息科学与工程学院,湖南,长沙,410083 
王建新 中南大学,信息科学与工程学院,湖南,长沙,410083 
王伟平 中南大学,信息科学与工程学院,湖南,长沙,410083 
摘要点击次数: 2932
全文下载次数: 3244
中文摘要:
      基于重路由匿名通信系统,如Mixes,Onion Routing,Crowds等,采用重路由机制在应用层转发数据,使实体之间的通信以间接的方式进行,从而有效地隐藏通信实体的身份信息,如主机的IP地址等.在性能方面,这种机制导致系统中产生额外的开销,如通信延时、负载等.着重从理论上分析了系统中的成员负载.通过深入考查基于重路由匿名通信系统的重路由机制,推导出了基于重路由匿名通信系统中成员负载的概率公式,证明了成员负载由系统中成员数目重路由路径数目以及重路由路径长度的概率分布所决定.应用该公式计算Crowds系统中成员的负载,得出精确的负载期望值为1/(1(Pf)+1,改进了Reiter等人的分析结果O((n+1)/((1(Pf)2n), 证明了Crowds系统的成员负载不受系统中成员数目n的影响,具有良好的可伸缩性.并通过仿真实验验证了该分析结果.其结论为设计和规划匿名网络提供了理论依据.
英文摘要:
      Rerouting mechanism is adopted by rerouting-based anonymous communication systems such as Mixes, Onion Routing, and Crowds, to store and forward data in application layer. With this, users can communicate in an indirect way. Thus, identity information such as IP addresses can be effectively hidden against eavesdropper. This mechanism, however, can result in extra overhead in performance such as communication delay and participant payload, which may affect the applications of anonymous communication systems. In this paper, the participant payload induced by the rerouting mechanism is studied quantitatively. By investigating the establishment of rerouting paths in detail, a probability formula for calculating the participant payload is derived, which proves that the participant payload is determined by the number of participants, the number of rerouting paths, and the probability distribution of length of the rerouting paths. By applying this formula to a practical anonymous communication system, Crowds, a precise expected participant payload 1/(1-Pf)+1 can be derived, which significantly improves Reiter and Rubin's original analysis O((n+1)/((1(Pf)2n), and demonstrates that the participant payload in Crowds remains constant and is independent of the variation of the number of participants in Crowds. Simulation results are presented to testify the theoretical analysis. The conclusions can provide a theoretical support for the design and implementation of anonymous communication systems.
HTML  下载PDF全文  查看/发表评论  下载PDF阅读器
 

京公网安备 11040202500064号

主办单位:中国科学院软件研究所 中国计算机学会 京ICP备05046678号-4
编辑部电话:+86-10-62562563 E-mail: jos@iscas.ac.cn
Copyright 中国科学院软件研究所《软件学报》版权所有 All Rights Reserved
本刊全文数据库版权所有,未经许可,不得转载,本刊保留追究法律责任的权利