检索结果-内蒙古大学图书馆

Study on user's identification system in insider threats

Tongxin Xuebao/Journal on Communications 2009年第11 A期30卷 121-126页

作者： Pei, Qing-Qi Zhao, Peng Zhang, Hong-Bin Wang, Chao Yin, Hao Institute of China Electronic System Engineering Corporation Beijing 100141 China Key Lab. of Computer Networks and Information Security of Ministry of Education Xidian University Xi'an 710071 China Institute of Information Science and Engineering Hebei University of Science and Technology Shijiazhuang 050018 China

Monitoring user's abnormal behaviors, which is an effective method to detect impersonation, is used for impersonation detection in insider threats. A model is built by using TAN-based Bayesian network to reflect the characteristics of user's behavior. When the deviation from the model is found, the system can determine the identity of the user. As a result, experiments show that the monitoring numbers of processes called by users can be very effective on detecting impersonation and can identify the identity of the attacker.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Fast access control algorithm in wireless network

Fast access control algorithm in wireless network

引用

3rd International Conference on Grid and Pervasive Computing Symposia/Workshops, GPC 2008

作者： Wang, Kun Ma, Zhixin Key Laboratory of Computer Network and Information Security Ministry of Education Xidian University Xi'an 710071 China

ISBN: (纸本)9780769531779

This paper presents an access control algorithm which bases on artificial neural network (ANN). It uses selected roles as input vectors. Then, considering role inheritance, the matching roles that may mutual exclude are picked as the output vectors to train the role-role ANN. After that, it removes all conflicts from the output of the former ANN and makes them as the new input vectors. And it employs users' final permissions as the output vectors to train the role-permission ANN according to users' current sessions. This algorithm has high efficiency and can assign users various permissions in different session. It need not re-compute trained ANN if we add or delete users in the system without changing the mapping between the roles and permissions. It exploits bit strings to express roles and permissions, which reduces the data transmission and fits for low bandwidth networks. © 2008 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of a self-learning worm based on good point set scanning

Modeling and analysis of a self-learning worm based on good ...

引用

International Wireless Communications and Mobile Computing Conference, IWCMC 2008

作者： Wang, Fangwei Zhang, Yunkai Ma, Jianfeng Key Laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 China Network Center Hebei Normal University Shijiazhuang 050016 China Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China

ISBN: (纸本)9781424422029

In order to speed up the propagating process, the worms need to scan many IP addresses to target vulnerable hosts. However, the distribution of IP addresses is highly non-uniform, which results in many scans wasted on invulnerable addresses. Inspired by the theory of good point set, this paper proposes a new scanning strategy, referred to as good point set scanning (GPSS), for worms. Experimental results show that GPSS can generate more distinct IP addresses and less unused IP addresses than the permutation scanning. Combined with group distribution, a static optimal GPSS is derived. Since the information can not be easily collected before a worm is released, a self-learning worm with GPSS is designed. Such worm can accurately estimate the underlying vulnerable-host distribution when a sufficient number of IP addresses of infected hosts are collected. We use a modified Analytical Active Worm Propagation (AAWP) to simulate data of Code Red and the performance of different scanning strategies. Experimental results show that once the distribution of vulnerable hosts is accurately estimated, a selflearning worm can propagate much faster than other worms. © 2008 IEEE.

关键词： Scanning

来源：评论

学校读者我要写书评

暂无评论

A new approach for UC security concurrent deniable authentication

引用

Science in China(Series F) 2008年第4期51卷 352-367页

作者： FENG Tao LI FengHua MA JianFeng SangJae MOON Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China School of Computer and Communications Lanzhou University of Technology Lanzhou 730050 China Mobile Network Security Technology Research Center Kyungpook National University Sankyuk-dong Buk-ku Daeyu 702-701 Korea

Deniable authentication protocols allow a sender to authenticate a message for a receiver, in a way which the receiver cannot convince a third party that such authentication ever took place. When we consider an asynchronous multi-party network with open communications and an adversary that can adaptively corrupt as many parties as it wishes, we present a new approach to solve the problem of concurrent deniable authentication within the framework of universally composable （UC） security. We formulate a definition of an ideal functionality for deniable authentication. Our constructions rely on a modification of the verifiably smooth projective hashing （VSPH） with projection key function by trapdoor commitment. Our protocols are forward deniable and UC security against adaptive adversaries in the common reference string model. A new approach implies that security is preserved under concurrent composition of an unbounded number of protocol executions; it implies non-malleability with respect to arbitrary protocols and more. The novelty of our schemes is the use of witness indistinguishable protocols and the security is based on the decisional composite residuosity （DCR） assumption. This new approach is practically relevant as it leads to more efficient protocols and security reductions.

关键词： information security concurrent deniable authentication universally composable verifiably smooth projective hashing the decisional composite residuosity assumption

来源：评论

学校读者我要写书评

暂无评论

A congestion avoidance and performance enhancement scheme for mobile ad hoc networks

A congestion avoidance and performance enhancement scheme fo...

引用

4th International Conference on Mobile Ad-hoc and Sensor networks, MSN 2008

作者： Chen, Chen Pei, Qingqi Ma, Jianfeng Key Lab. of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China

ISBN: (纸本)9780769534572

Based on the analysis of the node selfishness and the drawback of min-hop selection method as the unique routing selection criteria in Ad Hoc networks,a non-intrusive multi-metric Ad Hoc Routing Protocol-NIMR is *** computing and storing the node fame,NIMR greatly attenuates the influence of node selfishness;By crossing-design between MAC layer and network layer,we employ a non-intrusive real-time available bandwidth measurement scheme to solve the congestion ***,we propose a new metric as the routing selection criteria, which combines fame, available bandwidth and minimum hops by *** results show,Compared with DSR, fairness between nodes is improved and congestion control and load balance is implemented using NIMR without additionally increasing the network *** the same time average life-span and end-to-end throughput is increased, average end-to-end delay is decreased using NIMR. © 2008 IEEE.

关键词： network layers

来源：评论

学校读者我要写书评

暂无评论

Node-failure tolerance of topology in wireless sensor networks

引用

International Journal of network security 2008年第2期7卷 261-264页

作者： Wang, Liang-Min Ma, Jian-Feng Guo, Yuan-Bo The Computer School Jiangsu University Zhenjiang 212013 China Key Laboratory of Computer Network and Information Security of Education Ministry Xidian University Xi'an Shaanxi 710071 China School of Electronic Technology Engineering University of PLA Zhengzhou 450004 China

Three basic questions are presented and answered in researching on nodefailure topology in wireless sensor network. First, what is the definition of nodefailure tolerance? Second, how to evaluate this tolerance abilit... 详细信息

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Attack-tolerant node localization in wireless sensor networks

引用

Wuhan Ligong Daxue Xuebao/Journal of Wuhan University of Technology 2008年第7期30卷 111-115页

作者： Ye, A-Yong Ma, Jian-Feng Key Lab. of the Ministry of Education for Computer Networks and Information Security Xidian University Xi'an 710071 China Key Lab. of the Network Security and Cryptology Fujian Normal University Fuzhou 350007 China

It is essential to ensure that sensors can determine their location for wireless sensor networks. However, most of existing location discovery protocols became vulnerable in the presence of malicious attacks. So the authors presented an attack-tolerant node localization algorithm called AtLoc. In AtLoc, a least safe reference set was randomly built up according to the unbiased estimation of variance. Based on this, prediction residual of the least safe reference set was used to stepwise diagnose the remained references were abnormal or not, which significantly enhanced the resilience of localization system against attacks. Finally, the authors provided theoretical analysis and simulations to evaluate the proposed techniques.

关键词： Node localization security Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Trust valuation model in MANET

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2008年第5期45卷 765-771页

作者： Ye, Ayong Ma, Jianfeng Key Laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 China Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou 350007 China

Being infrastructureless, node trust plays an important role in security and reliability of mobile ad hoc networks. A new trust valuation model based on the experience of node is given to evaluate trustworthiness between network nodes. To improve the accuracy and rationality of node trust evaluation in a mobile network, the evidence theory is introduced to evaluate trust and combine multilateral experience from others. In addition, observation-frame is introduced to incorporate experience's time-sensitivity, which provides adequate support to cope with strategically altering behaviors of malicious nodes efficiently. A low-cost recommendation technique based on sleep mechanism is provided for neighboring nodes to share experience information, which obtains faster convergence rate and reduces the whole energy dissipation. Together, recommendation trust is quantitatively evaluated by a fuzzy similarity measure, which significantly increases the resilience against dishonest feedbacks. In comparison with the existing works, a complete trust valuation model is designed, with emphasis on its adaptability to dynamics of trust, robustness and resource-saving. This model can be used in coordination and security decision for network services. Finally, the theoretical analysis and simulations is given to evaluate the proposed techniques.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Threshold quantum secret sharing between multi-party and multi-party

引用

Science China(Physics,Mechanics & Astronomy) 2008年第9期51卷 1308-1315页

作者： YANG YuGuang1,2,3 & WEN QiaoYan4 1 College of computer Science and Technology,Beijing University of Technology,Beijing 100124,China 2 State key laboratory of Integrated Services network,Xidian University,Xi’an 710071,China 3 State key laboratory of information security (Graduate University of Chinese Academy of Sciences),Beijing 100049,China 4 State key laboratory of networking and Switching Technology,Beijing University of Posts and Tele-communications,Beijing 100876,China College of Computer Science and Technology Beijing University of Technology Beijing 100124 China State Key Laboratory of Integrated Services Network Xidian University Xi’an 710071 China State Key Laboratory of Information Security (Graduate University of Chinese Academy of Sciences) Beijing 100049 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

A threshold quantum secret sharing (TQSS) scheme between multi-party and multi-party was proposed using a sequence of single photons,which is useful and efficient when the parties of communication are not all present. We described the process of this TQSS scheme and discussed its security. It was shown that entan-glement is not necessary for quantum secret sharing. Moreover,the theoretic effi-ciency was improved to approach 100% as almost all the instances can be used for generating the private key,and each photon can carry one bit of information. This protocol is feasible with the present-day technique.

关键词： threshold quantum secret sharing quantum cryptography single photon multi-party and multi-party

来源：评论

学校读者我要写书评

暂无评论

Quantum threshold group signature

引用

Science China(Physics,Mechanics & Astronomy) 2008年第10期51卷 1505-1514页

作者： YANG YuGuang1,2,3 & WEN QiaoYan4 1 College of computer Science and Technology, Beijing University of Technology, Beijing 100124, China 2 State key laboratory of Integrated Services network, Xidian University, Xi’an 710071, China 3 State key laboratory of information security (Graduate University of Chinese Academy of Sciences), Beijing 100049, China 4 State key laboratory of networking and Switching Technology, Beijing University of Posts and Tele-communications, Beijing 100876, China College of Computer Science and Technology Beijing University of Technology Beijing 100124 China State Key Laboratory of Integrated Services Network Xidian University Xi’an 710071 China State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

In most situations, the signer is generally a single person. However, when the message is written on behalf of an organization, a valid message may require the approval or consent of several persons. Threshold signature is a solution to this problem. Generally speaking, as an authority which can be trusted by all members does not exist, a threshold signature scheme without a trusted party appears more attractive. Following some ideas of the classical Shamir’s threshold signature scheme, a quantum threshold group signature one is proposed. In the proposed scheme, only t or more of n persons in the group can generate the group signature and any t-1 or fewer ones cannot do that. In the verification phase, any t or more of n signature receivers can verify the message and any t-1 or fewer receivers cannot verify the validity of the signature.

关键词： threshold quantum signature trusted party quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：