• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Information Sciences and Systems, 2009. CISS 2009 >Anonymous networking with localized eavesdroppers: A game-theoretic approach
【24h】

Anonymous networking with localized eavesdroppers: A game-theoretic approach

机译：带有本地窃听者的匿名网络：一种博弈论方法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The problem of anonymous wireless networking is considered when an adversary monitors the packet transmission timing of an unknown fraction of the network nodes. For a given level of network performance, as measured by network throughput, the problem of maximizing anonymity is studied from a game-theoretic perspective. Using conditional entropy of routes as a measure of anonymity, this problem is posed as a two player zero-sum game between the network designer and the adversary; the task of the adversary is to choose a subset of nodes to monitor so that anonymity of routes is minimum and the task of the network designer is to choose a subset of nodes (referred to as covert relays to generate independent transmission schedules and evade flow detection so that anonymity is maximized. It is shown that a Nash equilibrium exists for a general category of finite networks. The theory is applied to the numerical example of a switching network to study the relationship between anonymity, fraction of monitored relays and the fraction of covert relays.
机译：当攻击者监视未知部分网络节点的数据包传输时间时，就会考虑匿名无线网络问题。对于给定级别的网络性能（通过网络吞吐量衡量），将从博弈论的角度研究最大化匿名性的问题。使用路由的条件熵作为匿名性的度量，此问题被视为网络设计师和对手之间的两人零和博弈。对手的任务是选择一个节点子集进行监视，以使路由的匿名性降至最低，而网络设计人员的任务是选择一个节点子集（称为秘密中继，以生成独立的传输调度并逃避流量检测结果表明，对于一类有限网络，存在一个纳什均衡，该理论被应用到交换网络的数值例子中，研究了匿名性，被监视继电器的分数和隐蔽分数之间的关系。接力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号