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

Koblitz Elliptic Curves Generating Based on Evolutionary Cryptography Theory and Verifying Parameters Recommended by NIST

引用

China Communications 2011年第4期8卷 41-49页

作者：王潮张焕国刘礼黎 Key Lab of Specialty Fiber Optics and Optical Access Network Ministry of Education Shanghai University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Computer School Wuhan University Huawei Technologies Co. Ltd

Elliptic curve cryptography is one of the most important public-key *** Koblitz Curve is a special kind of elliptic curve in ECC and its security mainly depends on the base *** on Evolutionary Cryptography theory,which becomes a principal concept for cryptography design and cryptanalysis,we propose a new algorithm for secure EC generation based on Ant Colony Optimization(ACO)to accelerate the search process of safe base *** preliminarily deal with secure Koblitz curve selecting over the field F(2800).Experiments show that the base field and base point of secure curves generated by ant colony algorithm have gone beyond the parameter range of Koblitz curves recommended by *** can present many new secure Koblitz curves,including base field and base point,which are not recommended by *** maximum size of our secure Koblitz curve has gone beyond *** algorithm in this paper follows the same cryptography criteria recommended by the ***,it can resist current *** analysis and experimental results prove that the new algorithm is effective and successful,and it is the first successful practice of Evolutionary Cryptography theory in public cryptography research.

关键词： evolutionary cryptography ECC secure curves ACO

来源：评论

学校读者我要写书评

暂无评论

Strong security enabled certificateless aggregate signatures applicable to mobile computation

Strong security enabled certificateless aggregate signatures...

引用

3rd IEEE International Conference on Intelligent networking and CollaborativeSystems, INCoS 2011

作者： Hu, Xiong Wu, Qianhong Chen, Zhong Key Laboratory of Network and Software Security Assurance of the Ministry of Education School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan University Ministry of Education China Universitat Rovira i Virgili Department of Computer Engineering and Mathematics UNESCO Av. Països Catalans 26 E-43007 Tarragona Spain

ISBN: (纸本)9780769545790

An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identitybased cryptography. In this paper, we present a new efficient certificateless aggregate signature scheme. Compared with up-todate certificateless aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model;(2) the security is proven in the strongest security model so far;(3) the signers do not need to be synchronized;and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized. © 2011 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

A Markov Chain-based Availability Model of Virtual Cluster Nodes

A Markov Chain-based Availability Model of Virtual Cluster N...

引用

International Conference on Computational Intelligence and security

作者： Jianhua Che Tao Zhang Weimin Lin Houwei Xi Information & Network Security Key Laboratory of State Grid State Grid Electric Power Research Institute Nanjing China

Benefiting from the virtualization technology, virtual cluster system possesses a lot of advantages different from traditional cluster system. However, the availability analysis of virtual cluster system is still short of efficient methods. The availability analysis of virtual cluster node is the base of analyzing the availability of virtual cluster system. In this paper, we summarize a typical architecture paradigm of virtual cluster node by studying the overall architecture of virtual cluster system and the deployment style of virtual cluster nodes, i.e., two active virtual cluster nodes building on a physical machine and their standby virtual cluster nodes building on another physical machine, and give its state transition diagram by analyzing the complete lifecycle of virtual cluster node and the transition conditions of different node states, and design a Markov Chain-based availability model for this typical architecture paradigms of virtual cluster node. This model enables to characterize the lifecycle state and state transition of virtual cluster node and provide an efficient method to understand the availability level of each virtual cluster node in a complicate virtual cluster system or cloud data center. Finally, the practicability of the proposed model was proved by numerical simulation experimental results.

关键词： Availability Analytical models Virtual machining Markov processes Switches Computational modeling Numerical models

来源：评论

学校读者我要写书评

暂无评论

Transparent Encrypting Office Document Based on Plug-in Software

引用

Procedia Engineering 2011年 23卷 260-264页

作者： Zhou Zhen-liu Tian Ling Li Zhuo-ling Shenyang Key Laboratory of Information Security for Power System Institute of Engineering Shenyang 110136 China Department of network and electronic engineering Information Engineering School Shenyang 110000 China

More and more file encrypting about office document are required in personal application environment. Limitations about encrypting file system, virtual disk encryption and filtrating driver encryption, are analyzed in this paper, then a kind of encryption system for office document, combing with plug-in software and smart u-key, is put forward and implemented. File's encrypting procedure in this system is transparent, self-determination and visible, and the whole system is convenient to migrate. Mow word and excel files can be encrypted using this system.

关键词： plug-in software office document file encryption smart u-key

来源：评论

学校读者我要写书评

暂无评论

Research on Auto-generation of Operation Order for Distribution network

Research on Auto-generation of Operation Order for Distribut...

引用

The Second International Conference on High Performance networking, computing,and Communication Systems（ICHCC 2011）

作者： Yanwei Zheng Qingdong Meng Xuejun Lv Zhiquan Feng School of Information Science and Engineering University of Jinan Shandong Provincial Key Laboratory of Network based Intelligent Computing University of Jinan Department of Production Technology Yanggu Power Supply Corporation Department of City Power Supply Linyi Power Supply Corporation

To meet the requirements of operation orders auto-generation, a topology information data structure is designedAbove this, several algorithms are proposed, which support to generate operation orders for the tasks of cell maintenance, cell transmission, full circuitry maintenance, range of circuitry maintenance, and switch load algorithmsThese algorithms can use in the distribution networkThe auto-generation only accords the topology information that distilled from the graphicIt is easily use for the maintain personnel.

关键词： Auto-generation,Operation order,Distribution network,topology information

来源：评论

学校读者我要写书评

暂无评论

Strong security Enabled Certificateless Aggregate Signatures Applicable to Mobile Computation

Strong Security Enabled Certificateless Aggregate Signatures...

引用

International Conference on Intelligent networking and Collaborative Systems (INCOS)

作者： Hu Xiong Qianhong Wu Zhong Chen Key Laboratory of Network and Software Security Assurance of the Ministry of Education Institute of Software School of Electronics Engineering and Computer Science Peking University Beijing China Department of Computer Engineering and Mathematics UNESCO Chair in Data Pr Universitat Rovira i Virgili Tarragona Spain Key Laboratory of AeroSpace Information Security and Trusted Computing Ministry of Education School of Computer Wuhan University of China China

An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identity-based cryptography. In this paper, we present a new efficient certificate less aggregate signature scheme. Compared with up-to-date certificate less aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model, (2) the security is proven in the strongest security model so far, (3) the signers do not need to be synchronized, and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized.

关键词： Aggregates Games Generators Synchronization Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Signature with Policy-and-Endorsement Mechanism

引用

Journal of Computer Science & Technology 2010年第6期25卷 1293-1304页

作者：王怀习朱岩冯荣权 Stephen S.Yau LMAM School of Mathematical SciencesPeking University Electronic Engineering Institute Institute of Computer Science and Technology Peking University Key Laboratory of Network and Software Security Assurance (Peking University) Ministry of Education Information Assurance Center and School of Computing Informatics and Decision Systems Engineering Arizona State University

In this paper a new signature scheme,called Policy-Endorsing Attribute-Based Signature,is developed to correspond with the existing Ciphertext-Policy Attribute-Based *** signature provides a policy-and-endorsement *** this mechanism a single user,whose attributes satisfy the predicate,endorses the *** signature allows the signer to announce his endorsement using an access policy without having to reveal the identity of the *** security of this signature,selfless anonymity and existential unforgeability,is based on the Strong Diffie-Hellman assumption and the Decision Linear assumption in bilinear map groups.

关键词： cryptography fine-grained access control attribute-based signature policy-and-endorsement selfless anonymity existential unforgeability

来源：评论

学校读者我要写书评

暂无评论

Threshold signature scheme based on non-interactive Diffie-Hellman signature

Threshold signature scheme based on non-interactive Diffie-H...

引用

1st International Conference on networking and Distributed computing, ICNDC 2010

作者： Wang, Xiuqun Huang, Lican Key Laboratory for Information System Security Ministry of Education Tsinghua University and Beijing Certification Authority Beijing China Institute of Network and Distributed Computing Zhejiang Sci-Tech University Hangzhou China

ISBN: (纸本)9780769542072

We present a threshold signature based on non-interactive Diffie-Hellman signature. It works in asynchronous communication system and can tolerate Byzantine faults with optimal resiliencen ≥ 3t + 1, where n is the number of the participants and t is the number of the fault participants. The security of this scheme bases on discrete logarithm intractability assumption. We give the security analysis of our proposed threshold signature scheme. © 2010 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

information system security function validating using model checking

Information system security function validating using model ...

引用

2010 2nd International Conference on Computer Engineering and Technology, ICCET 2010

作者： Ma, Jianli Xu, Guoai Yang, Yixian Ji, Yong Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Network and Information Attack Defense Technology of MOE Beijing University of Posts and Telecommunications Beijing China China Electronics System Engineering Computing station Beijing China

ISBN: (纸本)9781424463503

information systems will be encountered more and more security threats due to the development of computer attack method and technology. Generally, different security policies are used to protect the sensitive information in these systems. There has been a lot of study on security policy conformance and completeness verification and validation. However, there have few researches to validate whether the system behaviors satisfy the security policies. A model checking based information system security function validation method is proposed to validate the conformance between the system security solutions and the security policies in this paper. The system behaviors and the security policies are modeled separately, and the consistency between them is validated using the model checker SPIN. © 2010 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Enhancing fairness: A novel C2C e-commerce community member reputation algorithm based on transaction social networks

Enhancing fairness: A novel C2C e-commerce community member ...

引用

IADIS International Conference WWW/Internet 2010

作者： Feng, Wangsen Zhang, Bei Xia, Yunni Li, Jiajing Meng, Tao Key Laboratory of Network and Software Security Assurance of Ministry of Education Computing Center Peking University Beijing 100871 China College of Computer Science Chongqing University Chongqing 400044 China School of Mechanical Electronic and Information Engineering China University of Mining and Technology Beijing 100083 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9789728939250

Today, almost all the C2C e-commerce community member reputation evaluating algorithms are time sensitive. The reputation of a community member is accumulated after transactions and the increment of reputation after a successful transaction is computed based on the score given by his or her transaction partner. Since people always tend to do business with those with high reputation value, the reputation of members joined in C2C community at different time will vary greatly although they may provide the same commodity quality and service. It is unfair to new comers. In this paper, we propose a novel algorithm to overcome the shortcoming. Based on the transaction social network, our algorithm employs the random walk strategy to compute member reputation and enhance system fairness. © 2010 IADIS.

关键词： Electronic commerce

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：