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

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

来源：评论

学校读者我要写书评

暂无评论

Detecting the MB1 with Higher-Order Statistics

Detecting the MB1 with Higher-Order Statistics

引用

International Conference on Computational Intelligence and security

作者： Donghui Hu Lina Wang Xiaqiu Jiang Tingting Zhu Yuntao Yue School of Computer Science and Information Hefei University of Technology Hefei China School of Computer Science Wuhan University of China Wuhan Hubei China The Key Laboratory of Aerospace Information Security and Trust Computing Ministry of Education Wuhan Hubei China

ISBN: (纸本)9781424441969

MB1 is a very promising steganography. In this paper, a novel steganalysis scheme is presented to detect MB1. Many experiments are carried out based on high order features, and some useful propositions are learned from those experimental results. Based on those propositions we propose an effective MB1 detection algorithm. Experimental results show that the new proposed method has outperformed the existing MB1 steganalysis method in detection reliability.

关键词： Higher order statistics Steganography Information security Computer science Detection algorithms Art Calibration Histograms Computational intelligence Computer security

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Testing of Trusted computing Supporting Software Based on Genetic Algorithms

Evolutionary Testing of Trusted Computing Supporting Softwar...

引用

International Symposium on Knowledge Acquisition and Modeling, KAM

作者： Fan He Jing Len Huanguo Zhang Yonghua Tan College of Computer Wuhan University of China Wuhan Hubei China Department of Information Technology Hubei University of Police Wuhan Hubei China Key Laboratory of AeroSpace Information Security and Trusted Computing Ministry of Education Wuhan Hubei China Development and Reform Bureau of Laoshan Qingdao Shandong China

The rapid development of trusted computing (TC) technology has become a milestone in the field of information security. There is an increasing application of trusted computing platform (TCP) with trusted computing supporting software (TCSS) providing support for the trusted platform module (TPM) of TCP. There is an urgent need to test TCSS according to the specification of TC to ensure its quality. A promising approach to enhance the efficiency of the test process is evolutionary testing. This paper presents a test method of TCSS by using genetic algorithms-firstly making security function division of TCSS based on the common criteria (CC), then giving a model of evolutionary testing for TCSS, describing the concrete implementation of the testing prototype system, and finally testing a concrete TCSS product.

关键词： Software testing Genetic algorithms System testing Data security Application software ISO standards Information security Concrete Personal digital assistants Protection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Secure mutual password authentication scheme with user anonymity

引用

Wuhan Daxue Xuebao (Xinxi Kexue Ban)/ Geomatics and Information Science of Wuhan University 2008年第10期33卷 1073-1075页

作者： Wang, Bangju Zhang, Huanguo Wang, Zhangyi Wang, Yuhua School of Computer Wuhan University 129 Luoyu Road Wuhan 430079 China School of Science Huazhong Agricultural University 1 Shizi Hill Wuhan 430070 China Key Laboratory of Aerospace Information Security and Trust Computing Wuhan University 129 Luoyu Road Wuhan 430079 China College of Information Science and Engineering Henan University of Technology Lianhua Street Zhengzhou 450052 China

A new improved password authentication scheme is proposed, which is user anonymity, can fix the Hwang-Yeh's scheme and provide more other security properties such as server spoofing attacks, forge attacks, etc. According to security properties comparisons among Peyravian-Zunic's scheme, Hwang-Yeh's scheme, Peyravian-Jeffries scheme, and our proposed scheme, the proposed scheme is more secure and practical over insecure network.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of a robust protocol for generating shared RSA parameters

Cryptanalysis of a robust protocol for generating shared RSA...

引用

IET Conference on Wireless, Mobile and Sensor networks 2007, CCWMSN'07

作者： Kong, Fanyu Yu, Jia Zhang, Guangqing Li, Daxing Institute of Network Security Shandong University Jinan 250100 China Key Laboratory of Cryptographic Technology and Information Security Ministry of Education Jinan 250100 China College of Information Engineering Qingdao University Qingdao 266071 China

ISBN: (纸本)9780863418365

At IMA-Crypto & Coding' 99, A. M. Barmawi et al. proposed a robust protocol for generating shared RSA parameters, which was claimed to be secure and robust from cheaters and malicious parties. In this paper, we propose a cryptanalysis of A. M. Barmawi's protocol and show that every valid participating party can recover the factorization of the RSA modulus N with the computational complexity O(log3N). Therefore, the secret RSA key parameters p, q, d are exposed to all the participating parties and A. M. Barmawi' s protocol is totally broken.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation on IEEE 802.11e considering emergency calls in congested situation

引用

中国邮电高校学报（英文版） 2007年第S1期14卷 50-54页

作者： CUI Lu-ming OKADA Kazunori KATO Toshihiko CHEN Xing-yi Information Security Center National Institute of Information and Communications Technology Tokyo 184-8795 Japan Department of Information Network System Science The University of Electro-Communications Tokyo 182-8585 Japan States Key Laboratory of Networking and Switching Beijing University of Posts and Telecommunications Beijing 100876 China

To enhance the quality of service (QoS) support in IEE 802.11, IEEE 802.11e has been studied, which introduces the so-called hybrid coordination function (HCF). HCF includes two medium access mechanisms: contention-based channel access (EDCA), and contention-free channel access (HCCA). Although IEEE 802.11e has provided differentiated channel access mechanism, when call demand rises for important festivals such as New Year's Day or large scale natural disasters such as earthquakes, the delay of voice will increase and the QoS of voice nodes will drop down rapidly. Through our simulation study, in order to guarantee the QoS of emergency voice calls in congested situation, a higher priority for these calls will be required.

关键词： IEEE 802.11e EDCA HCCA HCF emergency call wireless LAN (WLAN) congested situation QoS

来源：评论

学校读者我要写书评

暂无评论

Provable Efficient Certificateless Group key Exchange Protocol

引用

Wuhan University Journal of Natural Sciences 2007年第1期12卷 41-45页

作者： CAO Chunjie MA Jianfeng MOON Sangjae Key Laboratory of Computer Networks and InformationSecurity Ministry of Education Xidian University Xi＇ an 710071Shaanxi China Mobile Network Security Technology Research Center Kyungpook National University Daeyu 702701 Korea

Certificateless public key cryptography （CL-PKC） avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our protocol is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol.

关键词： group key exchange certificateless public key cryptography provable security bilinear pairings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：