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

Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments

Science in China(Series F) 2008年第7期51卷 896-909页

作者： LI XiaoPing1,2 & WU Cheng3 1 School of computer Science & engineering, Southeast University, Nanjing 210096, China 2 key laboratory of computer network and information Integration (Southeast University), Ministry of Education, Nanjing 210096, China 3 Department of Automation, Tsinghua University, Beijing 100084, China School of Computer Science & Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Nanjing China Department of Automation Tsinghua University Beijing China

No-wait flow shops with makespan minimization are classified as NP-hard. In this paper, the optimization objective is equivalently transformed to total idle-time minimization. The independence relationship between tasks is analyzed, and objective increment properties are established for the fundamental operators of the heuristics. The quality of the new schedules generated during a heuristic is judged only by objective increments and not by the traditional method, which computes and compares the objective of a whole schedule. Based on objective increments, the time complexity of the heuristic can be decreased by one order. A seed phase is presented to generate an initial solution according to the transformed objective. Construction and improvement phases are introduced by experimental analysis. The FCH （fast composite heuristic） is proposed and compared with the most effective algorithms currently available for the considered problem. Experimental results show that the effectiveness of the FCH is similar to that of the best methods but requires far less computation time. The FCH can also be efficient in real time scheduling and rescheduling for no-wait flow shops.

关键词： no-wait flow shops heuristic makespan Tabu search

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 Peer-to-Peer Resource Sharing Scheme Using Trusted Computing Technology

引用

Wuhan University Journal of Natural Sciences 2008年第5期13卷 523-527页

作者： CHEN Lu ZHANG Huanguo ZHANG Liqiang LI Song CAI Liang School of Computer Wuhan University/Key Laboratory ofAerospace Information Security and Trusted Computing of Ministryof Education Wuhan 430072 Hubei China State Key Laboratory of Software Engineering WuhanUniversity Wuhan 430072 Hubei China Department of Information Security Information EngineeringUniversity Zhengzhou 450004 Henan China

Facing the increasing security issues in P2P networks, a scheme for resource sharing using trusted computing technologies is proposed in this paper. We advance a RS-UCON model with decision continuity and attribute mutability to control the usage process and an architecture to illustrate how TC technologies support policy enforcement with bidirectional attestation. The properties required for attestation should include not only integrity measurement value of platform and related application, but also reputation of users and access history, in order to avoid the limitation of the existing approaches. To make a permission, it is required to evaluate both the authorization and conditions of the subject and the object in resource usage to ensure trustable resources to be transferred to trusted users and platform.

关键词： resource sharing trusted computing virtualization UCON （usage control） chain of trust

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient certificate-based signcryption scheme from bilinear pairings

引用

International Journal of computers and Applications 2008年第2期30卷 129-133页

作者： Li, F. Xin, X. Hu, Y. School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China Department of Information and Computing Science Zhengzhou University of Light Industry Zhengzhou 450002 China Key Laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 China

Signcryption is a public key cryptographic primitive that performs digital signature and public key encryption simultaneously, at lower computational costs and communication overheads than the signature-then-encryption approach. In this paper, an efficient certificate-based signcryption scheme based on bilinear pairings is proposed. As compared to traditional and identity-based signcryption schemes, the proposed scheme has the following advantages: it provides implicit certification;it does not have the private key escrow feature of identity-based signcryption schemes, we also analyze the proposed scheme from security and performance points of view.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Forgeability of Wang-Tang-Li's ID-Based Restrictive Partially Blind Signature Scheme

引用

Journal of computer Science & Technology 2008年第2期23卷 265-269页

作者：刘胜利陈晓峰张方国 Department of Computer Science and Engineering Shanghai Jiao Tong UniversityShanghai 200240China State Key Laboratory of Information SecurityInstitute of SoftwareChinese Academy of Sciences Beijing 100080China Department of Computer Science School of Information Science and TechnologySun Yat-Sen University Guangzhou 510275China Department of Electronics and Communication Engineering School of Information Science and Technology Sun Yat-Sen UniversityGuangzhou 510275China

Restrictive partially blind signature （RPBS） plays an important role in designing secure electronic cash system Very recently, Wang, Tang and Li proposed a neW ID-based restrictive partially blind signature （ID-RPBS） and gave the security proof. In this paper, we present a cryptanalysis of the scheme and show that the signature scheme does not satisfy the property of unforgeability as claimed. More precisely, a user can forge a valid message-signature pair （ID, msg, info＇, σ＇） instead of the original one （ID, msg, info, σ）, where info is the original common agreed information and info＇≠info. Therefore, it will be much dangerous if Wang-Tang-Li＇s ID-RPBS scheme is applied to the off-line electronic cash system. For example, a bank is supposed to issue an electronic coin （or bill） of $100 to a user, while the user can change the denomination of the coin （bill） to any value, say $100 000 000, at his will.

关键词： unforgeability restrictive partially blind signature ID-based cryptography electronic cash

来源：评论

学校读者我要写书评

暂无评论

ID-based threshold proxy signcryption scheme from bilinear pairings

引用

International Journal of security and networks 2008年第3期3卷 206-215页

作者： Li, Fagen Xin, Xiangjun Hu, Yupu School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 Sichuan China Department of Information and Computing Science Zhengzhou University of Light Industry Zhengzhou 450002 Henan China Key Laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 Shaanxi China

A (t, n) threshold proxy signcryption scheme allows t or more proxy signcrypters from a designated group of n proxy signcrypters to signcrypt messages on behalf of an original signcrypter. In this paper, a new identity-based threshold proxy signcryption scheme from bilinear pairings is proposed. Our construction is based on Baek and Zheng's pairing-based verifiable secret sharing scheme and Libert and Quisquater's identity-based signcryption scheme. As compared to Wang and Liu's identity-based threshold proxy signcryption scheme, our scheme is more secure and efficient. © 2008, Inderscience Publishers.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multiparty simultaneous quantum identity authentication with secret sharing

引用

Science China(Physics,Mechanics & Astronomy) 2008年第3期51卷 321-327页

作者： YANG YuGuang1,2,WEN QiaoYan3 & ZHANG Xing4,5 1 College of computer Science and Technology,Beijing University of Technology,Beijing 100022,China 2 State key laboratory of information security (Graduate University of the Chinese Academy of Sciences),Beijing 100049,China 3 School of Science,Beijing University of Posts and Telecommunications,Beijing 100876,China 4 Institute of Electronic Technology,information engineering University,Zhengzhou 450004,China 5 Trusted Computing laboratory,Beijing University of Technology,Beijing 100022,China College of Computer Science and Technology Beijing University of Technology Beijing China State Key Laboratory of Information Security (Graduate University of the Chinese Academy of Sciences) Beijing China School of Science Beijing University of Posts and Telecommunications Beijing China Institute of Electronic Technology Information Engineering University Zhengzhou China Trusted Computing Laboratory Beijing University of Technology Beijing China

Two multiparty simultaneous quantum identity authentication (MSQIA) protocols based on secret sharing are presented. All the users can be authenticated by a trusted third party (TTP) simultaneously. In the first protocol,the TTP shares a random key K with all the users using quantum secret sharing. The ith share acts as the authentication key of the ith user. When it is necessary to perform MSQIA,the TTP generates a random number R secretly and sends a sequence of single photons encoded with K and R to all the users. According to his share,each user performs the corresponding unitary operations on the single photon sequence sequentially. At last,the TTP can judge whether the impersonator exists. The sec-ond protocol is a modified version with a circular structure. The two protocols can be efficiently used for MSQIA in a network. They are feasible with current technol-ogy.

关键词： quantum identity authentication secret sharing quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：