期刊文献+

实名制网络中动态认证体系的研究

下载PDF
导出
摘要 本文基于动态认证技术、手机实名制及移动终端的特性,提出了一套动态的认证体系,可屏蔽网络的接入模式、接入方式等因素,实现对访问者的身份认证,重点解决网站类应用在开放式访问体系下被恶意攻击的隐患,使得网站类应用的访问可控,同时也可推动手机实名制的进一步发展。
出处 《中国信息技术教育》 2019年第15期155-157,180,共4页 China Information Technology Education
  • 相关文献

参考文献2

二级参考文献16

  • 1JOHANSSON F, KAATI L, SHRESTHA A. Detec- ting multiple aliases in social media [C]//Proceedings of the International Conference on Advances in Social Networks Analysis and Mining. Piscataway, NJ, USA: IEEE Communication Society, 2013: 1004- 1011.
  • 2AN Ning, JIANG Lili, WANG Jianyong, et al. To- ward detection of aliases without string similarity [J]. Information Sciences, 2014, 261(10): 89-100.
  • 3ANWAR T, ABULAISH M. Namesake alias mining on the Web and its role towards suspect tracking [J]. Information Sciences, 2014, 276(20): 123-145.
  • 4LIU Zhaoli, QIN Tao, GUAN Xiaohong, et al. Alias detection across multi-online applications based on user's behavior characteristics [C] //Proceedings of the 2015 IEEE Trustcom. Piscataway, NJ, USA.. IEEE Computer Society, 2015: 1154-1159.
  • 5KUMAR S, ZAFARANI R, LIU Huan. Understand- ing user migration patterns in social media [C]// Pro- ceedings of the 25th AAAI Conference on Artificial In- telligence. New York, USA: ACM, 2011: 1-6.
  • 6BEKKERMAN R, MCCALLUM A. Disambiguating Web appearances of people in a social network [C]// Proceedings of the International Conference on World Wide Web. New York, USA.. ACM, 2005: 463-470.
  • 7HIRSCHBERG D S. Algorithms for the longest com- mon subsequence problem [J]. Journal of the ACM, 1977, 24(4): 664-675.
  • 8WANG Chenxu, GUAN Xiaohong, QIN Tao. Who are active? an in-depth measurement on user activity characteristics in Sina Microblog [C] // Proceedings of the 2012 IEEE Global Communications Conference. Piscataway, NJ, USA: IEEE Communication Society, 2012: 2083-2088.
  • 9LEVENSHTEIN V I. Binary codes capable of correc- ting deletions, insertions and reversals [J]. Soviet Physics Doklady, 1965, 163(4) : 845-848.
  • 10AHO A V, HIRSCHBERG D S, ULLMAN J D. Bounds on the complexity of the longest common sub- sequence problem [J]. Journal of the ACM, 1976, 23 (1) : 104-109.

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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