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

密钥覆盖问题的NP完全性证明 被引量：1

On the proof of the NP-completeness of key covering problem in the group rekeying
原文传递
导出
摘要 给出了密钥覆盖问题的模型建立过程,并从顶点覆盖问题的判定形式出发,证明了密钥覆盖问题的判定形式是NP完全问题,为组通信安全的研究,尤其是多播安全的研究奠定了更为坚实的基础. The process of modeling the key covering problem is preserted. And the NP-completeness of the decision version for the key covering problem is proved as well. Our proof is given based on the decision version of the vetex covering problem. Therefore, the further research on group security, especially for the multicast security, can have much solod foundation.
作者 陆正福 洪孙焱
机构地区 云南大学数学系
出处 《云南大学学报（自然科学版）》 CAS CSCD 北大核心 2006年第3期201-205,共5页 Journal of Yunnan University(Natural Sciences Edition)
基金 国家自然科学基金资助项目(10561009) 云南省自然科学基金资助项目(2002F0012M) 云南大学理(工)科校级重点科研项目资助(2003Z010C)
关键词 组密钥管理 组合优化 计算复杂性 顶点覆盖问题 密钥覆盖问题 group key management combinatorial optimization computational complexity vertex cover- ing problem key covering problem
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1WONG C K,GOUDA M,LAM S.Secure group communications using key graphs[J].Proceedings of ACM SIGCOMM'98,1998,28(4):68-79.
  • 2WONG C K,GOUDA M,LAM S.Secure group communications using key graphs[J].IEEE/ACM Trans on Networking,2000,8(1):16-30.
  • 3陆正福,李亚东,何英.IP多播组密钥管理方案分类体系研究[J].计算机工程与科学,2004,26(10):23-26. 被引量：13
  • 4陆正福,叶锐,王国栋.基于移动代理的多播水印协议[J].云南大学学报（自然科学版）,2004,26(4):306-311. 被引量：7
  • 5陆正福,叶锐,王国栋.多播水印协议MAMWP的BAN逻辑分析[J].云南大学学报（自然科学版）,2005,27(1):18-21. 被引量：4
  • 6陆正福,李亚东,于光德.多播安全中批量密钥更新问题研究[J].云南大学学报（自然科学版）,2002,24(5):335-340. 被引量：5
  • 7PAPADIMITRIOU C H.Computational Complexity[M].Boston:Addison Wesley,2004.
  • 8GAREY M R,JOHNSON D S.Computers and intractability:a guide to the theory of NP-Completeness[M].W H Freeman,1979.
  • 9CORMEN T H,LEISERSON C E,RIVEST R L.Introduction to algorithms[M].Cambridge:MIT Press,1989.
  • 10DORIT S Hochbaum.Approximation algorithms for NP-hard problems[M].Boston:PWS Publishing Company,1997.

二级参考文献38

  • 1陆正福,叶锐,王国栋.基于移动代理的多播水印协议[J].云南大学学报（自然科学版）,2004,26(4):306-311. 被引量：7
  • 2[3]JUDGE P,AMMAR M.WHIM:Water-marking multicast video with a hierarchy of inter-mediaries[J].Computer Networks:The International Journal of Computer and Telecommunications Networking,2002,39(6):699-712.
  • 3[4]BROWN I,PERKINS C,CROWCROFT J.Watercasting:distributed watermarking of multicast media[A].Proceedings of the First International Workshop on Networked Group Communication[C].Berlin:Springer-Verlag,1999.286-300.
  • 4[5]CHU Hao-hua,QIAO Lin-tian,NAHRSTEDT K.A secure multicast protocol with copyright protection[A].Proceedings of the IS&T/SPIE Conference on Security and Watermarking of Multicast Contents[C].Calif San Jose Jan,1999.460-471.
  • 5[6]PARVIAINEN R,PARNES P.Large scale distributed watermarking of multicast media through encryption.Communications and Multimedia Security[EB/OL].http://citeseer.nj.nec.com/447585.html,2003-09-20.
  • 6[7]MITCHELL D S,AHMED H T.Multimedia data-embedding and watermarking technologies[J].Proceedings of the IEEE,1998,86(6):1064-1087.
  • 7[8]WAGNER N R.Fingerprinting.Symposium on Security and Privacy,IEEE[EB/OL].http://citeseer.nj.nec.com/447585.html,2003-09-20.
  • 8[9]BONEH D,SHAW J.Collusion-secure finger-printing for digital data[A].Crypto'95,LNCS 963[C].Berlin:Springer-Verlag,1995.452-465.
  • 9[11]FRITZ H.Time-limited blackbox security:protecting mobile agents from malicious Hosts[A].Mobile Agent Security,LNCS,1419[C].Berlin:Springer-Verlag,1996.92-113.
  • 10JUDGE P, AMMAR M. WHIM: Watermarking multicast video with a hierarchy of intermediaries[J]. Computer Networks: The International Journal of Computer and Telecommunications Networking, 2002, 39 (6) :699-712.

共引文献17

同被引文献16

  • 1陆正福,李亚东,何英.IP多播组密钥管理方案分类体系研究[J].计算机工程与科学,2004,26(10):23-26. 被引量：13
  • 2韩秀玲,王行愚.大型动态多播群组的分布式密钥管理方案[J].小型微型计算机系统,2004,25(12):2199-2202. 被引量：6
  • 3陆正福,洪孙焱.密钥覆盖问题的建模、变换及近似算法[J].小型微型计算机系统,2007,28(7):1189-1194. 被引量：1
  • 4GENNARO R, ISHAI Y, KUSHILEVITA E, et al. The round complexity of verifiable secret sharing and secure muhicast [ C ]. Proc. 33 rd ACM symposium on Theory of computing(STOC) ,2001,580-589.
  • 5KATZ J, KOO C Y. Round - efficient secure computation in point - to - point networks [ C ]. Advances in Cryptology - Euro- crypt, 2007,311-328.
  • 6BEAVER D, MICALI S, ROGAWAY P. The round complexity of secure protocols [C ]. Proc 22nd ACM Symposium on the Theory of Computing( STOC), 1990,503-513.
  • 7FITZI M, GARAY J. Round - optimal and efficient verifiable secret sharing [ C ]. 3rd Theory of Cryptography Conference ( TCC ), 2006,329 -342.
  • 8KATZ J, KOO C Y. Improving the round complexity of VSS in point - to - point networks [ J ]. Information and Computation, 2008,207 ( 8 ) : 889 -899.
  • 9HUANG J H, MISHRA S. Mykil:A highly scalable key distribution protocol for large group muhicast[ C ]. Global Telecommunications Conference, GLOBECOM' 03. IEEE ,2003,3 (3) : 1 476-1 480.
  • 10SAROIT I A, E1 -ZOGHDY S F, MATAR M. A scalable and distributed security protocol for multicast communications [ J ]. Internation Journal of Network Security,2011,12 (2) :61-74.

引证文献1

二级引证文献2

云南大学学报（自然科学版）
2006年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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