期刊文献+

匿名通信协议MACP概率模型检验

Probabilistic model checking of anonymity communication system MACP
下载PDF
导出
摘要 匿名通信技术是保护互联网用户隐私的最有力手段之一,但匿名通信协议的形式化验证仍是亟待解决的难题。对P2P匿名通信协议MACP进行了形式化验证与分析,将MACP协议的匿名路径建立过程模型化为一个离散时间马尔可夫链;然后利用概率计算树逻辑PCTL描述MACP协议的匿名性质,并采用概率模型检验器对MACP协议的匿名性进行检验。检验结果表明,通过增加匿名通道数,提高了MACP协议的匿名等级和抗攻击能力;MACP协议的匿名性随着规模的增大而增强,并没有因控制匿名路径的长度而降低。 Anonymity is one of most effective privacy enhancing technologies.However,formal verification of anonymous communication technologies is still a hard and open problem.This paper formally verified and analyzed MACP,a P2P anonymous communication protocol.It modeled the construction process of anonymous path of the MACP protocol as a discrete time Markov chain.Then it used PCTL to describe the MACP protocol's anonymity,and used the probability model checker to inspect it.The results show that,with the increasing number of anonymous channels,the proposed method improves anonymity level and anti-attack capability of MACP protocol are also improved.And with the expansion of the network size,it enhances the anonymity of the MACP protocol not affected by controlling length of anonymity path.
出处 《计算机应用研究》 CSCD 北大核心 2012年第11期4315-4319,共5页 Application Research of Computers
基金 国家重点基础研究发展计划资助项目(2007CB307102) 国家高技术研究发展计划资助项目(2006AA01Z449 2007AA01Z2A1)
关键词 匿名通信 P2P MACP 概率模型检验 anonymous communication peer-to-peer(P2P) MACP probabilistic model checking
  • 相关文献

参考文献8

  • 1HANSSON H, JONSSON B. A logic for reasoning about time and reliability[J]. Formal Aspects of Computing,1994,6(5) :512-535.
  • 2KWIATKOWSKA M, NORMAN G, PARKER D. PRISM:probabilistic model checking for performance and reliability analysis [ J ]. ACM SIGMETRICS Performance Evaluation Review, 2009,36 ( 4 ) : 40-45.
  • 3CLARKE E M, EMERSON E A, SISTLA A P. Automatic verification of finite-state concurrent systems using temporal logic specification [ J ]. ACM Trans on Programming Languages and Systems, 1986,8(2) :244-263.
  • 4PARKER D. Implementation of symbolic model checking for probabilistic systems[ D]. [ S. l. ] :University of Birmingham, 2002.
  • 5XU Jing, WANG Zhen-xing, ZHANG Lian-cheng. An anonymous multiplexing communication protocol based on IPv6 [ C ]//Proc of International Conference on e-Business and e-Government. Washington DC : IEEE Computer Society, 2010 : 2196- 2199.
  • 6SHMATIKOV V. Probabilistie analysis of anonymity [ C ]// Proc of the 15th IEEE Computer Security Foundations Workshop. Washington DC :IEEE Computer Society,2002 : 119-128.
  • 7REITER M K, RUBIN A D. Crowds : anonymity for Web transactions [J]. ACM Trans on Information and System Security, 1998,1 ( 1 ) :66-92.
  • 8GUAN Yong, FU Xin-wen, BETTATI R, et al. An optimal strategy for anonymous communication protocols [ C ]//Proc of the 22rid IEEE International Conference on Distributed Computing Systems. Washington DC : IEEE Computer Society,2002:257- 266.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部