|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Survey of information security显示文摘The 21st century is the age of information when information becomes an important strategic resource. The information obtaining, processing and security guarantee capability are playing critical roles in comprehensive national power, and information security is related to the national security and social stability. Therefore, we should take measures to ensure the information security of our country. In recent years, momentous accomplishments have been obtained with the rapid development of information security technology. There are extensive theories about information security and technology. However, due to the limitation of length, this article mainly focuses on the research and development of cryptology, trusted computing, security of network, and information hiding, etc. | SHEN ChangXiang ZHANG HuangGuo FENG DengGuo CAO ZhenFu HUANG JiWu | 2007 | Science in China(Series F)2007，50，3： | 39 |
| 2 | Efficient Certificateless Authenticated Key Agreement Protocol from Pairings显示文摘In the area of secure Web information system, mutual authentication and key agreement are essential between Web clients and servers. An efficient certificateless authenticated key agreement protocol for Web client/server setting is proposed, which uses pairings on certain elliptic curves. We show that the newly proposed key agreement protocol is practical and of great efficiency, meanwhile, it satisfies every desired security requirements for key agreement protocols. | WANG Shengbao CAO Zhenfu WANG Licheng | 2006 | Wuhan University Journal of Natural Sciences2006，11，5： | 23 |
| 3 | Designing efficient proxy signature schemes for mobile communication显示文摘Proxy signature is an active cryptographic research area,and a wide range of litera- tures can be found nowadays suggesting improvement and generalization of existing protocols in various directions.However,from the efficiency view,many proposed proxy signature schemes in these literatures are not satisfying and cannot fit to the mobile communication.Therefore,there is a desire to design efficient proxy sig- nature schemes.Based on Boneh et al's pairing-based short signature,this paper presents two proxy signature schemes.One is proxy-protected signature scheme, and the other is proxy aggregate signature scheme.Since both of them can achieve high efficiency,it is believed that they are specially suitable for mobile communica- tion environment. | LU RongXing DONG XiaoLei CAO ZhenFu | 2008 | Science in China(Series F)2008，51，2： | 9 |
| 4 | Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode显示文摘The majority of existing escrowable identity-based key agreement protocols only provide partial forward secrecy. Such protocols are, arguably, not suitable for many real-word applications, as the latter tends to require a stronger sense of forward secrecy—perfect forward secrecy. In this paper, we propose an efficient perfect forward-secure identity-based key agreement protocol in the escrow mode. We prove the security of our protocol in the random oracle model, assuming the intractability of the Gap Bilinear Diffie-Hellman (GBDH) problem. | WANG ShengBao CAO ZhenFu CHENG ZhaoHui CHOO Kim-Kwang Raymond | 2009 | Science in China(Series F)2009，52，8： | 9 |
| 5 | Identity-based signature scheme based on quadratic residues显示文摘Identity-based(ID-based)cryptography has drawn great concerns in recent years,and most of ID-based schemes are constructed from bilinear parings.Therefore,ID-based scheme without pairing is of great interest in the field of cryptography.Up to now, there still remains a challenge to construct ID-based signature scheme from quadratic residues.Thus,we aim to meet this challenge by proposing a concrete scheme.In this paper,we first introduce the technique of how to calculate a 2lth root of a quadratic residue,and then give a concrete ID-based signature scheme using such technique. We also prove that our scheme is chosen message and ID secure in the random oracle model,assuming the hardness of factoring. | CHAI ZhenChuan CAO ZhenFu DONG XiaoLei | 2007 | Science in China(Series F)2007，50，3： | 7 |
| 6 | THRESHOLD PROXY RE-SIGNATURE显示文摘纸是设计探讨半的一个有效、安全的答案的这的焦点在代理重新签名计划信任了问题,即,代理从用户 A 知道重新签名钥匙到用户 B ,他因此能翻译用户 A 做到用户 B 的任何签名,它损坏代理重新签名计划的必要要求(非否认性质)。在这份报纸,作者首先为阀值代理重新签名计划定义安全模型,然后基于 Ateniese-Hohenbergers 和 Shao-Cao-Wang-Liangs 途径建议二个阀值代理重新签名计划。 | Piyi YANG Zhenfu CAO Xiaolei DONG | 2011 | Journal of Systems Science & Complexity2011，24，4： | 6 |
| 7 | Provably secure robust threshold partial blind signature显示文摘Threshold digital signature and blind signature are playing important roles in cryptography as well as in practical applications such as e-cash and e-voting systems. Over the past few years, many cryptographic researchers have made considerable headway in this field. However, to our knowledge, most of existing threshold blind signature schemes are based on the discrete logarithm problem. In this paper, we propose a new robust threshold partial blind signature scheme based on improved RSA cryptosystem. This scheme is the first threshold partial blind signature scheme based on factoring, and the robustness of threshold partial blind signature is also introduced. Moreover, in practical application, the proposed scheme will be especially suitable for blind signature-based voting systems with multiple administrators and secure electronic cash systems to prevent their abuse. | CAO Zhenfu ZHU Haojin LU Rongxing | 2006 | Science in China(Series F)2006，49，5： | 5 |
| 8 | Identity based signature scheme based on cubic residues显示文摘We propose a novel method to compute a cubic root of a cubic residue in Eisenstein ring.By applying our method,a new identity based signature scheme is proposed based on cubic residues.We formally prove that our scheme is secure against existential forgery on the adaptive chosen message and identity attacks assuming the hardness of factoring.Our scheme is the first identity based signature scheme based on cubic residues. | XING DongSheng CAO ZhenFu DONG XiaoLei | 2011 | Science China(Information Sciences)2011，54，10： | 4 |
| 9 | New trends of information security—how to change people's life style?显示文摘Ciphertext refers to encrypted data.During the years of 2007 and 2008,we proposed and solved two problems in information security,namely ciphertext access control and biometric feature matching without storing any biometric features.In 2008,we completed the development of encrypted data sharing mobile devices and then in 2011,we further studied the techniques to address these two problems and embedded them into chips. | Zhenfu CAO | 2016 | Science China(Information Sciences)2016，59，5： | 4 |
| 10 | Conjugate adjoining problem in braid groups and new design of braid-based signatures显示文摘The development of quantum computation casts serious threats to the securities of most existing public-key cryptosystems. Braid-based cryptography is one of the alternatives that have potential advantages in resisting quantum attacks. In this paper, the state of the art of braid cryptography is surveyed, and then a new cryptographic problem-conjugate adjoining problem related to braid groups is proposed. Based on this problem, we design a new braid-based signature scheme. This scheme is efficient and provably secure in the random oracle model. Further, we present the comparison between braid-based signatures and RSA-based ones. The signing process of the braid-based schemes is more efficient than that of RSA-based ones, while the verifying process of the braid-based ones is observably slow. Hence, braid-based signatures are suitable for scenarios where the signing process has to be as quick as possible but delays are permitted in the verifying process, for example, in off-line e-cash systems. The key sizes in braid-based schemes are considerably large-about 2K bits in the case of secret keys and 12K bits in the case of public keys. However, braid operations are much simpler and more efficient than modular exponential operations. Therefore, braid-based schemes can be embedded into devices with low computational ability and large memory space. The capability of braid cryptosystems to resist currently known quantum attacks is also discussed from the perspective of hidden subgroup problems. | WANG LiCheng WANG LiHua CAO ZhenFu YANG YiXian NIU XinXin | 2010 | Science China(Information Sciences)2010，53，3： | 3 |
| 11 | An Identity-Based Strong Designated Verifier Proxy Signature Scheme显示文摘In a strong designated verifier proxy signature scheme, a proxy signer can generate proxy signature on behalf of an original signer, but only the designated verifier can verify the validity of the proxy signature. In this paper, we first define the security requirements for strong designated verifier proxy signature schemes. And then we construct an identity-based strong designated verifier proxy signature scheme. We argue that the proposed scheme satisfies all of the security requirements. | WANG Qin CAO Zhenfu | 2006 | Wuhan University Journal of Natural Sciences2006，11，6： | 3 |
| 12 | Traceable and revocable CP-ABE with shorter ciphertexts显示文摘Dear editor,As a sophisticated mechanism for secure finegrained access control on encrypted data,Ciphertext-policy attribute-based encryption(CPABE)is a highly promising solution for commercial applications such as cloud computing and social networks.However,there exists an important and practical issue in current CP-ABE systems awaiting to solve.As a one-to-many encryption mechanism,the same ciphertexts | Jianting NING Zhenfu CAO Xiaolei DONG Lifei WEI | 2016 | Science China(Information Sciences)2016，59，11： | 2 |
| 13 | Secure key-aggregation authorized searchable encryption显示文摘Dear editor,Selective sharing of encrypted documents with other users makes the cloud st,or age system more flexible and effective[1].For safety reasons,data owners use different keys to encrypt different,documents.However,data owners need to distribute all keys to the query users for data sharing.Similarly,the query users must,submit the same number of trapdoors in order to complete search queries over the entire encrypted documents.Key-aggregation searchable encryption(KASE)cryptosystem was proposed to solve the above problem. | Haijiang WANG Xiaolei DONG Zhenfu CAO Dongmei LI Nanyuan CAO | 2019 | Science China(Information Sciences)2019，62，3： | 2 |
| 14 | Security Analysis and Improvement of Some Threshold Proxy Signature Schemes显示文摘 | XUE Qingshui CAO Zhenfu | 2005 | 通讯和计算机(中英文版)2005，2，1： | 2 |
| 15 | Proxy Blind Multi-signature Scheme Without a Secure Channel显示文摘 | Lu Rongxing Cao Zhenfu Zou Yuan | | 0，，01： | 1 |
| 16 | Secure thresh- old multi authority attribute based encryption without a cen- tral authority 显示文摘 | Lin H uang Cao Zhenfu Liang Xiaohui | 2010 | Information Sciences2010，180，13： | 1 |
| 17 | Escrow-Free Certificate-Based Authenticated Key Agreement Protocol from Pairings显示文摘Key agreement protocols are essential for secure communications. In this paper, to solve the inherent key escrow problem of identity-based cryptography, an es- crow-free certificate-based authenticated key agreement (CB-AK) protocol with perfect forward secrecy is proposed. Our protocol makes use of pairings on elliptic curves. The protocol is described and its properties are discussed though comparison with Smart’s protocol. | WANG Shengbao CAO Zhenfu | 2007 | Wuhan University Journal of Natural Sciences2007，12，1： | 1 |
| 18 | Privacy-preserving large-scale systems of linear equations in outsourcing storage and computation显示文摘Along with the prevalence of cloud computing, it can be realised to efficiently outsource costly storage or computations to cloud servers. Recently, secure outsourcing mechanism has received more and more attention. We focus on secure outsourcing storage and computation for large-scale systems of linear equations(LEs) in this paper. Firstly, we construct a new efficient matrix encryption scheme. Then we exploit this encryption scheme to develop a new algorithm which can implement outsourcing storage and computation for large-scale linear equations in the semi-honest setting. Compared with the previous work,the proposed algorithm requires lower storage overhead and is with competitive efficiency. | Dongmei LI Xiaolei DONG Zhenfu CAO Haijiang WANG | 2018 | Science China(Information Sciences)2018，61，3： | 1 |
| 19 | Simple three-party key exchangeprotocol 显示文摘 | LU Rongxing CAO Zhenfu | 2007 | Computer Security2007，26，1： | 1 |
| 20 | Proxy Blind Multi-signature Scheme Without a Secure Channel显示文摘 | Lu Rongxing Cao Zhenfu Zhou Yuan | 2005 | Applied Mathematics and Cumputation2005，164，1： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员