期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

Dining Cryptographer安全协议及工程分析 被引量：1

Dining Cryptographer Protocol and Its Engineering Analysis
下载PDF
导出
摘要 网络信息安全包括信息内容的加密及通讯的匿名性质 .DiningCryptographer (DC net)协议[1,2 ] 就是一个基于数学不可解特性的基础安全匿名通信协议 ,其主要特点是通过提供匿名信息服务来避免恶意攻击 .本文在介绍DC net协议工作原理的基础上 ,从工程应用角度给出了如何构建基于DC net协议的分布式安全信息服务 ,并对运行时的有关问题进行了研究 . Network Information Security includes context security and the anonymous property of Network Communication. Dining Cryptographer (DC-net) Protocol is a famous anonymous communication protocol based on mathematically non-solved property. Its main characteristic focuses on that it can avoid being maliciously attacked by providing anonymous information service. After introducing basic DC-net protocol principle, we discuss some problems from engineering view point like how to construct distributed security information service based on DC-net protocol and analyze its run-time problems.
作者 陶志红 Hans KleineBuing 张世琨 王立福
机构地区 南京大学数学系 Paderborn大学计算机系 北京大学计算机系
出处 《电子学报》 EI CAS CSCD 北大核心 2005年第2期262-265,共4页 Acta Electronica Sinica
基金 国家 8 63项目 (No 2 0 0 1AA1 1 31 71 ) 国家 973项目 (No .2 0 0 2CB31 2 0 0 6)
关键词 安全协议 形式化分析 电子商务 INTERNET网络 DC—net(Dining Cryptographer net)协议 Cryptography Data communication systems Electronic commerce Formal languages Internet Network protocols
分类号 TP309.7 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献14

  • 1卿斯汉.安全协议的设计与逻辑分析[J].软件学报,2003,14(7):1300-1309. 被引量：69
  • 2David Chaum.Untraceable electronic mail,return addresses,and digital pseudonyms [J].Communications of the ACM,1981,24(2):84-88.
  • 3David Chaum.The dining cryptographers problem:unconditional sender and recipient untraceability[J].Journal of Cryptology 1988,1(1):65-75.
  • 4E M Clarke,E A Emerson.Design and synthesis of synchronization skeletons using branching time temporal logic[A].Logic of Programs:Workshop[C].Yorktoen Heights,NY:Springer,LNCS,May 1981.131.52-71.
  • 5C Diot,et al.Deployment issues for the IP multicast service and architecture[J].IEEE Networks,2000,14(1):78-88.
  • 6Dolev D,Yao A.On the security of public key protocols[J].IEEE Transactions on Information Theory,1983,29(2):198-208.
  • 7R Fagin,J Halpern,Y Moses,M Vardi.Reasoning about Knowledge[M].Cambridge MA:MIT Press,1995.
  • 8G Holzmann.Design and Validation of Computer Protocols [M].Prentice Hall,1991.
  • 9G Holzmann.The spin model checker [J].IEEE Trans.Software Engineering,1997,23(5):279-295.
  • 10D M Nessett.A critique of the burrows,abadi and needham logic[J].ACM Operating Systems Review,1990,24(2):35-38.

二级参考文献2

共引文献68

同被引文献10

  • 1李梦君,李舟军,陈火旺.基于进程代数安全协议验证的研究综述[J].计算机研究与发展,2004,41(7):1097-1103. 被引量：25
  • 2刘道斌,郭莉,白硕.基于Petri网的安全协议形式化分析[J].电子学报,2004,32(11):1926-1929. 被引量：5
  • 3顾永跟,傅育熙.基于进程演算和知识推理的安全协议形式化分析[J].计算机研究与发展,2006,43(5):953-958. 被引量：7
  • 4C Meadows. Formal methods for cryptographic protocol analysis:Emerging issues and trends[J]. IEEE Journal On selected Areas in Communications, 2003,21 ( 1 ) :44 - 54.
  • 5M Boreale. Symbolic trace analysis of cryptographic protocols [ A]. In: Proc of the 28th Int'l Conf on Automata, Language and Programming ( ICALP' 01 ), LNCS 2076 [ C ]. Geneva, Switzerland: Springer Verlag,2001.667 - 681.
  • 6M Abadi, A D Gordon. A calculus for cryptographic protocols: The spi calculus [ A ]. The 4th ACM Conf on Computer and Communications Security [C]. Zurich, Switerland, 1997.36 - 47.
  • 7Anupam Datta, Ante Derek, John C. Mitchell, Amab Roy. Protocol Composition Logic (PCL) [J]. Electronic Notes in Theoretical Comouter Science (ENTCS),2007, 172:311 - 358.
  • 8D Dolev,A Yao. On the security of public key protocols[J]. IEEE Trans on Information Theory, 1983,29(2): 198- 208.
  • 9MICALI S. Simple and Fast Optimistic Protocols for Fair Electronic Exchange[A]. A Proceedings of 22nd annual symposium on Principles of distributed computing [ C]. Boston ( MA,USA), 2003. New York ( NY, USA) : ACM Press, 2003.12 - 19.
  • 10卿斯汉.安全协议20年研究进展[J].软件学报,2003,14(10):1740-1752. 被引量：118

引证文献1

二级引证文献1

电子学报
2005年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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