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

中国密码学会2009年会

作者： Xie Min 谢敏 Li Juan 李娟 Zhang Feng-rong 张凤荣 Key laboratory of computer network and information security(Xidian University) Xi'an 710071 Guangdo 西安电子科技大学计算机网络与信息安全教育部重点实验室西安 710071 广东省信息安全技术重点实验室(广州大学)广州 510405 School of Electrical Engineering(Northwest University of Nationalities) Lanzhou 730030 西北民族大学电气工程学院兰州 730030 Key laboratory of computer network and information security(Xidian University) Xi'an 710071 西安电子科技大学计算机网络与信息安全教育部重点实验室西安 710071

在密码体制的构造中，布尔函数被广泛地应用，对分组密码中S-盒和流密码中组合生成器等的研究，实质上可归结为对布尔函数的分析.通过分析Bent函数的性质，利用级联的方法，构造了一类五谱值函数.该类函数没有非零线性结构、平衡、代数... 详细信息

在密码体制的构造中，布尔函数被广泛地应用，对分组密码中S-盒和流密码中组合生成器等的研究，实质上可归结为对布尔函数的分析.通过分析Bent函数的性质，利用级联的方法，构造了一类五谱值函数.该类函数没有非零线性结构、平衡、代数次数可达到变元个数的一半.并且，该类函数的代数免疫阶等于所级联的Bent函数的代数免疫阶加1.

关键词：密码学五谱值函数代数次数代数免疫阶

来源：评论

学校读者我要写书评

暂无评论

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

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

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 nonuniform, 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 self- learning worm can propagate much faster than other worms.

关键词： Grippers IP networks Internet Routing Servers Equations Web server

来源：评论

学校读者我要写书评

暂无评论

Adaptive genetic algorithm and its application to multi-literal multi-issue competitive e-commerce

引用

Dianzi Yu Xinxi Xuebao/Journal of Electronics and information Technology 2008年第11期30卷 2613-2616页

作者： Li, Jian Jing, Bo Yang, Yi-Xian Information Security Center State Key Lab. of Network and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Dept. of Computer Technology Beijing Institute of Applied Meteorology Beijing 100029 China

To make the agents negotiate more efficiently in multi-lateral multi-issue negotiation in multi-agent based competitive e-commerce, an agent negotiation model in competitive environment is presented, and the Adaptive Genetic Algorithm (AGA) is applied to the model to enhance the negotiation efficiency. In the experiments, two kinds of genetic algorithms are used to compare with, they are Standard Genetic Algorithm (SGA) and AGA. After 1000 times of experiments for the two kinds of agents to gain the satisfying result, SGA averagely needs negotiation of 183 runs, while the AGA averagely needs only 152 runs. The experiment results show that the AGA can gain the satisfying negotiation result more efficiently than SGA in competitive multi-lateral multi-issue negotiation.

关键词： Electronic commerce

来源：评论

学校读者我要写书评

暂无评论

A Congestion Avoidance and Performance Enhancement Scheme for Mobile Ad Hoc networks

A Congestion Avoidance and Performance Enhancement Scheme fo...

引用

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

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

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 presented. By 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 problem. Finally, we propose a new metric as the routing selection criteria, which combines fame, available bandwidth and minimum hops by weight. Simulation 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 load. At the same time average life-span and end-to-end throughput is increased, average end-to-end delay is decreased using NIMR.

关键词： Mobile ad hoc networks Routing protocols Ad hoc networks computer networks information analysis Bandwidth Throughput Waste materials Mobile computing information security

来源：评论

学校读者我要写书评

暂无评论

Improvement on WLAN multicast key management protocol

Improvement on WLAN multicast key management protocol

引用

2008 International Conference on Computational Intelligence and security, CIS 2008

作者： Huixian, Li Liaojun, Pang Dept. of Comput. Sci. and Engineering Northwestern Polytechnical Univ. Xi'an 710072 China Ministry of Edu. Key Lab. of Computer Networks and Information Security Xidian University Xi'an 710071 China

ISBN: (纸本)9780769535081

Multicasting is an important business in the field of the Wireless Local Area network (WLAN). The access point (AP) usually has to seed the same message to each station (STA) of a specific group, and the multicasting is one of the most efficient communication ways. To assure the validity of the entity and the privacy of the message, we should first solve the problem of the multicast key secure distribution. In WLAN security standards, LEEE802.11i and Chinese WLAN Authentication and Privacy Infrastructure (WAPL), multicast key announcement protocols are inefficient. In this paper, a new multicast key distribution protocol is proposed, and it can be used to substitute the multicast key management protocol in IEEE802.11i or WAPL Analyses show that the proposed protocol can achieve all functional requirements of WLAN, and is more efficient than that in IEEE802.11i or WAPL. © 2008 IEEE.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

CRMS: A Collusion-Resistant Matrix System for Group key Management in Wireless networks

CRMS: A Collusion-Resistant Matrix System for Group Key Mana...

引用

IEEE International Conference on Communications (ICC)

作者： W. Wang J. Ma S. Moon Key Laboratory of Computer Networks and Information Security (Ministry of Education) Xidian University Xi'an China Mobile Network Security Technology Research Center Kyungpook National University Daegu South Korea

In this paper, a collusion-resistant matrix system (CRMS) for group key managements is presented. The CRMS is defined as a collection of subsets of users, and the keys held by users in CRMS are organized in a hierarchical matrix manner. After describing the join and leave protocols, we prove that CRMS has lceil2N/trceil-collusion resistant capability. Moreover, the suggestion of how to select the parameters in CRMS is given. The simulated experiments show that CRMS is a practical group key management in wireless networks.

关键词： Wireless networks computer network management Communications Society laboratories information security computer science education Protocols Technology management Moon National security

来源：评论

学校读者我要写书评

暂无评论

A Novel Generation key Scheme Based on DNA

A Novel Generation Key Scheme Based on DNA

引用

International Conference on Computational Intelligence and security

作者： Xin-she Li Lei Zhang Yu-pu Hu Xi'an Research Inst. of Hi-Tech Xi'an China Ministry of Education Key Laboratory of Computer Network & Information Security XiDian University Xi'an China

A novel generation key scheme based on DNA is proposed. By using a key expansion matrix, the scheme improves the independence and the strict avalanche of the key. Although it increases computation amount because of using the matrix operation, the random number can be generated by the DNA sequence directly and the speed of the computation is greatly improved. Therefore, the new scheme has wide application in the field of the block cipher, data signature, identity authentication, et al.

关键词： Sequences Random number generation Databases information security DNA computing Authentication Computational intelligence computer security computer science education laboratories

来源：评论

学校读者我要写书评

暂无评论

AN ADULT SHORT MESSAGE RECOGNITION ALGORITHM BASED ON RESTRICTED CLOSE TEST OPTIMIZATION

AN ADULT SHORT MESSAGE RECOGNITION ALGORITHM BASED ON RESTRI...

引用

2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

作者： QIN-DONG SUN XIN-BO HUANG JIU-LONG ZHANG Network Computing and Security Tech.Key Lab.of Shaanxi Province Xi'an University of Technology Xi' College of Electronics and Information Xi'an Polytechnic University Xi'an 710048 China Network Computing and Security Tech.Key Lab.of Shaanxi Province Xi'an University of Technology Xi'

The flooding of adult short message has become an urgent problem of safety of message content. Existing researches on short message filtering pay much attention to rubbish and advertising short messages, and the granularity of categorization were too coarse. With an analysis of the characteristics of adult short messages, and considering the effectiveness and real time performance of filtering algorithm, this paper proposes an adult short message discriminating algorithm based on adultism-degree computation, and a threshold selecting algorithm based on close test optimization. Experiments show that the proposed algorithm can effectively discriminate adult short message with a 94.4％ correction rate, meanwhile it can meet the requirements of practical processing.

关键词： Content security Adult short message Content filtering Threshold selecting

来源：评论

学校读者我要写书评

暂无评论

MPMAC and its security analysis

引用

Beijing Gongye Daxue Xuebao / Journal of Beijing University of Technology 2008年第SUPPL. 2期34卷 62-66页

作者： Zhang, Shao-Lan Yang, Yi-Xian Xing, Guo-Bo Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Key Laboratory of Network and Information Attack and Defense Technology of MOE Beijing University of Posts and Telecommunications Beijing 100876 China School of Computer Science and Technology Shandong Jianzhu University Jinan 250101 China

According to the weakness of mode of operation, a modified parallelizable message authentication code (MPMAC) is proposed. The mode to process the last block of message is improved to avoid the forgery attack with random message by using the fact that the block cipher has same output with the same input using a key. Its security is proved by quantifying the advantage of distinguishing message authentication code from the random function in terms of the quality of the block cipher as a pseudo-random permutation.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Linear programming models for jamming attacks on network traffic flows

Linear programming models for jamming attacks on network tra...

引用

International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless networks (WiOpt)

作者： Patrick Tague David Slater Radha Poovendran Guevara Noubir Network Security Lab (NSL) Department of Electrical Engineering University of Washington Seattle WA USA College of Computer and Information Science Northeastern University Boston MA USA

ISBN: (纸本)9781424431212

We present a new class of network attacks, referred to as flow-jamming attacks , in which an adversary with multiple jammers throughout the network jams packets to reduce traffic flow. We propose a linear programming framework for flow-jamming attacks, providing a foundation for the design of future protocols to mitigate flow-jamming. We propose metrics to evaluate the effect of a flow-jamming attack on network flow and the resource expenditure of the jamming adversary. We develop, evaluate, and compare a variety of flow-jamming attacks using the proposed metrics and the linear programming formulation. In addition, we formulate two approaches for distributed flow-jamming attacks for a set of jammers operating without centralized control and compare the performance to the centralized attacks using the linear programming formulation.

关键词： Linear programming Jamming Telecommunication traffic Traffic control Protocols computer crime US Government information security Centralized control Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：