期刊文献+

限定节点查看信息的网络编码签名方案

Network coding signature scheme with limitation of nodes to check news
下载PDF
导出
摘要 现有网络编码研究关注的是信息传送效率的增加而忽略了网络编码使信息在网络传送中过于泛滥,这对信息的安全造成威胁。为了解决这个问题,设计了限定节点查看消息的网络编码签名方案。依据网络环境中需要查看信息节点的个数,提出了两种方案:一是少数节点查看信息,使用接收节点的公钥签名,而只有拥有公钥对应私钥的节点才可以解密得到信息的方法;二是多个节点之间通信,为了避免没有权限的节点查看信息,需要通信的节点预先建立会话钥,利用会话钥进行签名信息传递的方法。新方案通过权限限制了节点查看到信息的内容,从而保证了信息在网络中的安全性。新方案使用网络编码有效的在提高信息传送效率的同时保证了信息在网络中传送的安全性。 The existing network coding research focuses on the increase of the transmission efficiency of information on the network yet ignoring the information's overflow in the transmission caused by the network coding,which poses a threat to information security and even all message in the network's can be revealed by network nodes.In order to solve this problem,a new method was designed.Based on the different number of information nodes needed to check in different network environments,there are two solutions: one is only a few nodes,using the public key signature of receiving information node,can check information.Meanwhile only the nodes with the private key corresponds to the public key can decrypt and get information.The other one is communication between multiple nodes.In order to avoid that the node with no permission checks information,session keys should be established between communication nodes and be used to transfer the information.The new scheme limits the nodes to check the information though the authority,and consequently ensures the security of information in the network.The usage of network coding in new scheme effectively improves the efficiency of information transmission while assuring the safety of transferring information in the network.
出处 《计算机应用》 CSCD 北大核心 2011年第7期1868-1871,1879,共5页 journal of Computer Applications
基金 国家自然科学基金资助项目(61063041) 国家教育部科学技术研究重点项目(208148)
关键词 网络编码 节点限定 签名 公钥 私钥 权限 network coding node limition signature security of internet public key private key authortity
  • 相关文献

参考文献2

二级参考文献65

  • 1付琳,付志雄.网络编码研究[J].科技资讯,2007,5(7):94-95. 被引量:1
  • 2崔凯,王丽.网络编码技术及其在通信网络中的应用[J].黑龙江科技信息,2007(02X):46-46. 被引量:2
  • 3Ramanathan S. Multicast tree generation in networks with asymmetric links [J]. IEEE/ACM Trans, Networking, 1996,4 (4) :558-568. 被引量:1
  • 4Moses Charikar, Chandra Chekuri, To-yat Cheung, et al. Approximation algorithms for directed Steiner problems[C]. Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), 1998, 192-200. 被引量:1
  • 5Leonid Zosin, Samir Khuller. On directed steiner trees[C]. In: 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), 2002, 59-63. 被引量:1
  • 6Bollobas B. Graph theory an introductory course [M]. New York : Springer-Verlag, 1979. 被引量:1
  • 7Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, et al. Network information flow [J]. IEEE Trans. Inform. Theory, 2000, 46(4) : 1204-1216. 被引量:1
  • 8Agarwal A, Charikar M. On the advantage of network coding for improving network throughput [Z]. Information Theory Workshop, 2004. IEEE 24-29 Oct. 2004, 247-249 被引量:1
  • 9Lun D, Ramakar N, Koetter R, et al. Achieving minimum-cost multicast: a decentralized approach based on network coding [C]. In: Proceedings of IEEE INFOCOM, Mar, 2005. 被引量:1
  • 10Fragouli C, Soljanin E. Decentralized network coding[Z]. Information Theory Workshop, 2004. IEEE 24-29 Oct. 2004: 310-314. 被引量:1

共引文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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