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

International Conference on Sensor Technologies and Applications, SensorComm

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

ISBN: (纸本)9781424432127

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.

关键词： Cryptography security Complexity theory Servers Entropy Memory management Protocols

来源：评论

学校读者我要写书评

暂无评论

keying material based key pre-distribution scheme

Keying material based key pre-distribution scheme

引用

IEEE International Conference on Intelligence and security Informatics, ISI

作者： Zhihong Liu Jianfeng Ma Qiping Huang SangJae Moon 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 South Korea

A key pre-distribution scheme is a method by which initially an off-line trusted authority T A distributes pieces of information among a set of users. Later, each member of a group of users can compute a common key for secure communication. In this paper we present a keying Material Based key Pre-distribution Scheme, i.e., a group of users, using secret information preloaded in their memory and some public information retrieved from a keying material server, can compute a common key. We first formally define the keying material based key pre-distribution scheme in terms of the entropy, and give lower bounds on the amount of information each user has to keep secret. Then, we describe its applications for sensor networks.

关键词： Base stations information security Moon information retrieval network servers Public key cryptography computer networks Electronic mail National security Protocols

来源：评论

学校读者我要写书评

暂无评论

Action-Based Access Control Modelt

引用

电子学报(英文版) 2008年第3期17卷 396-401页

作者： LI Fenghua WANG Wei MA Jianfeng Sang JaeMoon Key Laboratory of Computer Networks and Information Security (Ministry of Education) Xidian University Xi＇an 710071 China) Graduate School Beijing Electronic Science and Technology Institute Beijing 100070 China) Mobile Network Security Technology Research Center Kyungpook National UniversitySankyuk-dong~ Buk-ku~ Daeyu 702-701~ KoreaI

来源：评论

学校读者我要写书评

暂无评论

New trust model based on advanced D-S evidence theory for P2P networks

引用

Dianzi Yu Xinxi Xuebao/Journal of Electronics and information Technology 2008年第6期30卷 1480-1484页

作者： Tian, Chun-Qi Zou, Shi-Hong Wang, Wen-Dong Cheng, Shi-Duan Broadband Network Research Center State Key Lab. of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Department of Computer Science and Technology College of Electronic and Information Engineering Tongji University Shanghai 200092 China

Trust relationship between participants is indispensable to set up in a large-scale distributed P2P file-sharing system. A novel trust model for P2P system based on advanced D-S theory of evidence is proposed in this paper to solve this problem, in which mathematic analysis and some measures are presented to defense against several malicious attacks. The experimental results show that, compared to the current some trust models, the proposed model is more robust on trust security problems and more advanced in successful transaction rate.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of an Integrity Measurement System Based on Windows Trusted Computing Platform

Design and Implementation of an Integrity Measurement System...

引用

International Conference for Young computer Scientists, ICYCS

作者： Yang Yang Huanguo Zhang Li Wan Bingyu Zou School of Computer Wuhan University of China Wuhan China State Key Lab of Software Engineering Wuhan University of China Wuhan China Key Laboratory of Aerospace Information Security and Trust Computing Ministry of Education Wuhan China

This paper presents the design and implementation of an integrity measurement system based on Windows trusted computing platform. The trust chain is established from the BIOS up to the application layer, where the executable codes are taken the load-time measurements before execution. And the measurement system can generate an integrity proof for TPM-based remote attestation. In order to accurately reflect runtime integrity of critical applications, a light weight Clark-Wilson model is introduced for verify information flow integrity guarantee. Our experimental system strengthens the security posture of the platform. With the analysis of the tradeoff between performance and security, our system gives great consideration to the impact which the measurements cause to system performance.

关键词： Software measurement information security Runtime Performance analysis Operating systems Kernel computer architecture Grid computing Invasive software computer viruses

来源：评论

学校读者我要写书评

暂无评论

A Fine-Grained Digital Rights Transfer Policy and Trusted Distribution and Enforcement

A Fine-Grained Digital Rights Transfer Policy and Trusted Di...

引用

International Conference on Computational Intelligence and security

作者： Zhiyong Zhang Qingqi Pei Jianfeng Ma Lin Yang Kefeng Fan Key Lab of Computer Network & Information Security (Ministry of Education) Xidian University Xi'an Shaanxi China Electron. Inf. Engineering Coll. Henan University of Science and Technology Luoyang Henan China Research Institute China Electronic Equipment and Systems Engineering Corporation Beijing China China Electronics Standardization Institute Beijing China

ISBN: (纸本)9781424441969

Existing digital rights management (abbr. DRM) approaches lack a flexible fine-grained digital rights transfer policy, also could not guarantee the trustworthy distribution and enforcement of the transferable rights policy by using DRM agent. First, descriptions of extensible ODRL-based rights transfer policy were presented to complete OMA REL. Then, we introduced a remote attestation mechanism among entities, such as RI and DRM agent, based on trusted computing platform in order to implement trusted distribution and enforcement of the policy, also mainly proposed trustworthy distribution protocols of the rights object and transfer, as well as a trusted policy enforcement protocol. Final, the approach is made comparison with existing DRM schemes as to several functionality aspects on transferable rights granularity, restricted sharing, temporal limitation, trust of DRM agent. A conclusion is drawn that the proposed scheme is not restricted within local domain environment, and accomplishes fine-grained rights transfer and contents sharing between users without direct participations of rights issuer or local domain manager.

关键词： Protocols Content management information security Licenses Computational intelligence computer security computer networks computer science education Electrons Electronic equipment

来源：评论

学校读者我要写书评

暂无评论

Weak generalized self-shrinking generators

引用

Journal of Systems Engineering and Electronics 2007年第2期18卷 407-411页

作者： Dong Lihua Hu Yupu The Key Lab. of Computer Networks and Information Security the Ministry of Education Xidian Univ. Xi'an 710071 P. R. China

The security of certain classes of the generalized self-shrinking sequence （GSS） generators is analyzed. Firstly, it is shown that the security of these GSS generators is equivalent to the security of the GSS generators of the class-1, after which two effective key recovery attacks on the GSS generators of the class-1 are developed to evaluate their security.

关键词： Cryptography Stream cipher, key recovery attacks Generalized self-shrinking sequence.

来源：评论

学校读者我要写书评

暂无评论

Towards structural Web Services matching based on Kernel methods

引用

中国高等学校学术文摘·计算机科学 2007年第4期1卷 450-458页

作者： NAN Kai YU Jianjun SU Hao GUO Shengmin ZHANG Hui XU Ke Computer Network Information Center Chinese Academic of ScienceBeijing 100080China Computer Network Information Center Chinese Academic of ScienceBeijing 100080China Stat Key Lab Software Development Environment Beihang UniversityBeijing 100083China Stat Key Lab Software Development Environment Beihang UniversityBeijing 100083China

This paper describes a kernel methods based Web Services matching mechanism for Web Services discovery and *** matching mechanism tries to exploit the latent semantics by the structure of Web *** this paper,Web Services are schemed by WSDL(Web Services Description Language)as tree-structured XML documents,and their matching degree is calculated by our novel algorithm designed for loosely tree matching against the traditional *** order to achieve the task,we bring forward the concept of path subsequence to model WSDL documents in the vector ***,an advanced n-spectrum kernel function is defined,so that the similarity of two WSDL documents can be drawn by implementing the kernel function in the *** textual similarity and n-spectrum kernel values as features of low-level and mid-level,we build up a model to estimate the functional similarity between Web Services,whose parameters are learned by a ***,a set of experiments were designed to verify the model,and the results showed that several metrics for the retrieval of Web Services have been improved by our approach.

关键词： Web Services service matching Kernel methods ranking SVM

来源：评论

学校读者我要写书评

暂无评论

New signature scheme with fast revocation

引用

Journal of Computational information Systems 2007年第1期3卷 35-39页

作者： Yang, Chen Cheng, Xiangguo Ma, Wenping Wang, Xinmei Key Lab. of Computer Networks and Information Security Xidian University Xi'an 710000 China College of Information Engineering Qingdao University Qingdao 266071 China

Digital signature plays an important role in modern cryptography, but many signature schemes require high maintenance cost for certificate management and cannot provide immediate revocation either. In this paper, a new efficient mediated certificateless signature scheme with fast evocation is proposed. A special on-line partially trusted SEM (security Mediator) which is responsible for distributing partial signature token is introduced into proposed construction of the mediated signature scheme. The proposed scheme can perform the immediate revocation and is existential un-forgeable against the adversary under the ECFP assumption and Inverse Weil-pairing assumption.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Universally composable anonymous Hash certification model

引用

Science in China(Series F) 2007年第3期50卷 440-455页

作者： ZHANG Fan MA JianFeng SangJae MOON Key Laboratory of Computer Networks and Information Security (Ministry of Education) Xidian UniversityXi'an 710071 China Mobile Network Security Technology Research Center Kyungpook National University Sankyuk-dongBuk-ku Daeyu 702-701 Korea

Ideal function is the fundamental component in the universally composable security model. However, the certification ideal function defined in the universally composable security model realizes the identity authentication by binding identity to messages and the signature, which fails to characterize the special security requirements of anonymous authentication with other kind of certificate. Therefore, inspired by the work of Marten, an anonymous hash certification ideal function and a more universal certificate CA model are proposed in this paper. We define the security requirements and security notions for this model in the framework of universal composable security and prove in the plain model （not in the random-oracle model） that these security notions can be achieved using combinations of a secure digital signature scheme, a symmetrical encryption mechanism, a family of pseudorandom functions, and a family of one-way collision-free hash functions. Considering the limitation of wireless environment and computation ability of wireless devices, this anonymous Hash certification ideal function is realized by using symmetry primitives.

关键词： anonymous authentication Hash universal composable security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：