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

Universal provable security authentication protocol for multi-domain

Wuhan Daxue Xuebao (Xinxi Kexue Ban)/ Geomatics and information Science of Wuhan University 2008年第10期33卷 1051-1054页

作者： Zhu, Hui Li, Hui Yang, Jiaxi Wang, Yumin Key Laboratory of Computer Network and Information Security Xidian University 2 South Taibai Road Xi'an 710071 China

The problems of existing authentication frameworks are analyzed, and a universal authentication protocol is proposed for the multi-domain. Moreover, entity authentication for cross-domain is supported in the protocol. Especially, by using the modular approach under the Canetti-Krawczyk model, the security of entity authentication is analyzed. It is shown that the proposed protocol is secure and could achieve the security requirements, and the protocol is a secure and fast authentication with high expansibility. This protocol can be applied to the authentication between the networks which use the difference authentication frameworks.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Maximizing Universal Streaming Rate in Peer-to-Peer Streaming networks

Maximizing Universal Streaming Rate in Peer-to-Peer Streamin...

引用

International Conference on Grid and Cooperative Computing (GCC)

作者： Jiagao Wu Jun Tao Zhiqiang Zou Institute of Computer Technology College of Computer Nanjing University of Posts and Telecommunications Nanjing China Key Laboratory of Computer Network and Information Integration of Ministry of Education South-East University Nanjing China

ISBN: (纸本)9781424432806

Although a large number of different proposals have emerged in recent years, a fundamental problem of P2P streaming networks concerned about is to establish an optimal routing structure with achieving certain optimization metric. In this paper, we focus on the problem of maximizing universal streaming rate in P2P streaming networks with constrained neighborhood. Firstly, we extend the fluid-based model and propose a new P2P streaming network model taking the neighborhood constraint into account. Second, we formulate the problem of maximizing the universal streaming rate in the new model. After proving its NP-hardness, we propose a heuristic multiple trees packing algorithm and corresponding optimum strategies. The simulation results show that the algorithm can achieve the theoretical upper bound of the universal streaming rate in fluid-based model without constrained neighborhood. While neighborhood constraint is considered, in addition, the universal streaming rate will have different decline according to various intensity of neighborhood constraint.

关键词： Peer to peer computing Streaming media computer networks Grid computing Telecommunication computing Bandwidth Routing Educational technology Educational institutions Proposals

来源：评论

学校读者我要写书评

暂无评论

Real-time feature selection in traffic classification

引用

Journal of China Universities of Posts and Telecommunications 2008年第SUPPL.期15卷 68-72页

作者： ZHAO, Jing-jing HUANG, Xiao-hong SUN, Qiong MA, Yan Information Network Center Beijing University of Posts and Telecommunications Beijing 100876 China School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing 100876 China

Classification of network traffic using port-based or payload-based analysis is becoming increasingly difficult since many P2P applications are using port hopping and encryption to avoid detection. As a result, the attention of research has diverted to the application of machine learning (ML) techniques on traffic classification. Feature selection plays an important role in machine learning-based traffic classification scheme. However, most of the feature selection algorithms proposed so far are not effective in online traffic classification, in which the feature subsets selected cannot be used online. In this paper, different types of features used in traffic classification are presented, and meanwhile, the accuracy of different feature selection algorithms is analyzed and compared when they are used in traffic classification, especially in P2P traffic classification. In order to realize the online traffic classification, we propose a real-time feature subset. As the results show, very good performance will be achieved when the real-time feature subset is used in decision tree based ML algorithm. Meanwhile, the build time of real-time feature subset is shorter than that of other feature subsets, which makes it a good candidate for online traffic classification. © 2008 The Journal of China Universities of Posts and Telecommunications.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

A NEW HYBRID GENETIC ALGORITHM FOR THE BI-CRITERIA NO-WAIT FLOWSHOP SCHEDULING PROBLEM WITH MAKESPAN AND TOTAL FLOW TIME MINIMIZATION

A NEW HYBRID GENETIC ALGORITHM FOR THE BI-CRITERIA NO-WAIT F...

引用

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

作者： YOU-GEN LIU XIA ZHU XIAO-PING LI School of Computer Science and Engineering Southeast University Nanjing P.R.China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing P.R.China

Multi-objective flowshop scheduling problems have gained wide attention both in practical and academic fields. In this paper, a hybrid multi-objective genetic algorithm is proposed to solve multi-objective no-wait flowshop scheduling problems with both the makespan and the total flow time minimization. The proposed algorithm makes use of the principle of non-dominated sorting, coupled with the use of elitist solutions strategy. To improve efficiency, two effective multi-objective local search procedures based on objective increment are applied on each chromosome in the archive. Experimental results show that the proposal outperforms the other three heuristics both on effectiveness and efficiency.

关键词： Bi-criteria No-wait flowshop Objective increment Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast Access Control Algorithm in Wireless network

Fast Access Control Algorithm in Wireless Network

引用

International Conference on Grid and Pervasive Computing Workshops, GPC

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

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.

关键词： Access control Wireless networks Permission Artificial neural networks Laboratories computer networks information security computer science education Data communication Bandwidth

来源：评论

学校读者我要写书评

暂无评论

OBJECTIVE INCREMENT BASED HYBRID GA FOR NO-WAIT FLOWSHOPS

OBJECTIVE INCREMENT BASED HYBRID GA FOR NO-WAIT FLOWSHOPS

引用

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

作者： XIA ZHU XIAOPING LI QIAN WANG School of Computer Science and Engineering Southeast University Nanjing P.R.China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing P.R.China

No-wait flowshops with flowtime minimization are typical NP-Complete combinatorial optimization problems, widely existing in practical manufacturing systems. Different from traditional methods by which objective of a new schedule being completely computed objective increment methods are presented in this paper by which the objective of an offspring being obtained just by objective increments and computational time can be considerably reduced. HGAI (Hybrid GA based on objective Increment) is proposed by integrating genetic algorithm with a local search method. A heuristic is constructed to generate an individual of initial population and a crossover operator is introduced for mating process. HGAI is compared with two best so far algorithms for the considered problem on 110 benchmark instances. Computational results show that HGAI outperforms the existing two in effectiveness with a little more computation time.

关键词： No-wait flowshops Flowtime Objective increment Hybrid genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Fair Exchange Signature Schemes

Fair Exchange Signature Schemes

引用

International Conference on Advanced information networking and Applications Workshops (AINAW)

作者： Jingwei Liu Rong Sun Wenping Ma Ying Li Xinmei Wang Key Laboratory of Computer Network and Information Security Ministry of Education Xidian University Xi'an China

In this paper we propose an efficient Fair Exchange Signature Scheme(FESS) that allows two players to exchange digital signatures in a fair way. It may be considered as an interesting extension of concurrent signature presented in EURO CRYPT 2004 that is constructed from ring signatures. In our scheme, two unwakened signatures signed separately by two participants can be verified easily by the other player, but it would not go into effect until an extra piece of commitment keystone is released by one of the players. Once the keystone revealed, two signatures are both aroused and become effective. A key feature of the proposed scheme is that two players can exchange digital signatures simultaneously through a secret commitment keystone without involvement of any Trusted Third Party. Moreover, the efficiency of our signature scheme is higher than that of concurrent signature.

关键词： Protocols Digital signatures computer networks Application software Laboratories information security computer science education Electronic commerce Internet computer crashes

来源：评论

学校读者我要写书评

暂无评论

A Benefits-centric Multi-participant Trust Architecture for DRM-Enabling Digital Contents Value Chain Ecosystem

A Benefits-centric Multi-participant Trust Architecture for ...

引用

International Seminar on Business and information Management, ISBIM

作者： Zhiyong Zhang Qingqi Pei Jianfeng Ma Lin Yang Ministry of Education Key Laboratory of Computer Network & Information Security Xidian University Xi'an China

A multi-participant trust relationship is essential to implement a successful business transaction in DRM (digital rights management)-enabling digital contents industry. The simple adoption of several increasingly enhanced security policies does not necessarily establish the mutual trust relationship ultimately, and even has a negative effect on the usability and acceptability of DRM system. Therefore, various participantspsila benefits should be emphasized in the contents value chain. First, a general DRM contents value chain ecosystem was presented without a loss of generality. Then, a benefits-centric multi-participant trust architecture (abbr. MPTA), which is based on game-theoretic rational adoptions of security policies for participants, was proposed through an anatomy of existing value chain ecosystems. Finally, we formalized the definitions of the security component and service, the security policy and its utility, as well as the Nash equilibriums of the multi-participant game under pure and mixed security policy profile. Due to the introduction to game theory, MPTA enables participants to acquire optimal benefits balance when fundamental security requirements are met, and Nash equilibrium of the game is the chosen security policies combinations from the participantspsila perspectives.

关键词： Ecosystems Nash equilibrium Game theory computer network management information security Intellectual property Application software Seminars information management computer architecture

来源：评论

学校读者我要写书评

暂无评论

Storage requirements for key distribution in sensor networks

Storage requirements for key distribution in sensor networks

引用

2nd International Conference on Sensor Technologies and Applications, SENSORCOMM 2008

作者： Liu, Zhihong Jianfeng, Ma Huang, Qiping Moon, SangJae Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University China School of Communication Engineering Xidian University China Mobile Network Security Technology Research Center Kyungpook National University Korea Republic of

ISBN: (纸本)9780769533308

Sensor networks are resource-constrained, which makes developing efficient key distribution scheme a challenging problem. In general, many key distribution techniques are designed to address the trade-off between limited resources and security, no key distribution technique is ideal to all the scenarios where sensor networks are used. In this paper, we primarily focus on storage requirements of several key distribution schemes in sensor networks, and obtain their lower bounds on the amount of information each user has to keep secret by modeling the key distribution schemes with an information theoretic framework. © 2008 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

A pairwise key establishment scheme for heterogeneous sensor networks

A pairwise key establishment scheme for heterogeneous sensor...

引用

9th ACM International Symposium on Mobile Ad Hoc networking and Computing, MobiHoc'08 - 1st ACM International Workshop on Heterogeneous Sensor and Actor networks, HeterSanet 2008

作者： Liu, Zhihong Ma, Jianfeng Huang, Qiping Moon, SangJae Key Laboratory of Computer Networks and Information Security of Ministry of Education Xidian University Xi'an China School of Communication Engineering Xidian University Xi'an China Mobile Network Security Technology Research Center Kyungpook National University Korea Republic of

ISBN: (纸本)9781605581132

Motivated by a key agreement scheme proposed by Leighton and Micali (LM-KDS), we present a key establishment mechanism for heterogeneous sensor networks which combines random key pre-distribution schemes and LM-KDS. Using LM-KDS as its building block, proposed scheme divides nodes into groups and distributes a small number of micro key servers among nodes. This scheme consists of two phases. In the first one, some secret information is sent by the TA to every node off-line, then the TA assigns public keying material to every micro key server. In the second phase, if any pair of nodes cannot establish session key using their preloaded keying material, they may get public keying material from a micro key server through an open channel. Besides, all the public keying material preloaded in micro key servers does not need to be secret. This scheme preserves properties of LM-KDS yet takes advantage of flexibility of probabilistic approaches to yield improved resilience against node capture attacks by trading off increased communication overhead and storage complexity. © 2008 ACM.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：