期刊文献+

基于移动Ad Hoc网络的分布式RSA密钥生成机制

Distributed Generation of Shared RSA Keys in Mobile Ad Hoc Networks
下载PDF
导出
摘要 移动AdHoc网络(MANET)是一种具有全新概念的无线网络,不依赖于任何固定物理基础设施和集中式组织管理机构,通过无线信道实现移动节点之间的通信。然而AdHoc网络的固有特性使其更易遭受各种安全威胁,在基于分布式PKI/CA体制的安全解决方案中如何生成和分发CA密钥将是一个具有挑战性的问题。对现有的几种方案进行了分析讨论,指出了其中存在的问题,并就此提出了一种基于门限RSA密码体制的分布式CA密钥共享生成机制,提高了系统的安全性和鲁棒性。 Mobile Ad hoc NETworks(MANET) is a totally new concept in which mobile nodes are able to communicate together over wireless links in an independent manner,without needing any fixed physical infrastructure and centralized organizational/administrative infrastructure.However,the nature of ad hoc networks makes them very vulnerable to security threats.Generation and distribution of shared keys for CA(Certification Authority)is challenging in security solution based on distributed PKI/CA.Those solutions that have been proposed in the literature and some issues are discussed.This paper propose the solution of distributed generation of shared CA keys based on threshold RSA cryptosystems,with which the security and robustness of system is enhanced.
出处 《重庆大学学报(自然科学版)》 EI CAS CSCD 北大核心 2004年第11期63-65,70,共4页 Journal of Chongqing University
关键词 移动AD Hoe网络 密钥生成 自组织 RSA 安全 Mobile Ad Hoc Networks keys generation self-organization RSA security
  • 相关文献

参考文献8

  • 1[1]MACKER J, CORSON M. Mobile ad hoc networking and the IETF[J]. Mobile Computing and Communications Review, 1998,2(1):9-14.
  • 2[2]RFC 2501,Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations[S].
  • 3[3]ZHOU L, HAAS Z. Securing Ad Hoc Networks[J]. IEEE Network Magazine, 1999,13(6):24-30.
  • 4[4]YI S, KRAVETS R. Practical PKI for Ad Hoc Wireless Networks[R]. Urbana : University of Illinois, 2002.
  • 5[5]KONG J, ZERFOS P,LUO H,et al. Providing robust and ubiquitous security support for MANET[A]. Proceedings of 9th International Conference on Network Protocols(ICNP)[C].California: IEEE Computer Society Press,2001.251-260.
  • 6[6]SHAMIR A. How to Share a Secret[J]. Communications of the ACM, 1979,22(11):612-613.
  • 7[7]BEN-OR M, GOLDWASSER S, WIGDERSON A. Completeness theorems for non-cryptographic fault tolerant distributed computation[A].Proc.20th Annual ACM Symposium on Theory of Computing(STOC)[C]. New York:ACM Press ,1988.1-10.
  • 8[8]RIVEST R. Finding four million large random primes[A].Proceedings of Crypto'91[C]. London: Springer -Verlag,1991.625-626.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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