为满足云计算对高安全、高效率密码方案的需求,该文提出一种安全增强密码工作模式——密码反馈"一组一密"(Cipher FeedBack one Block one Key,CFB-BK)模式,并基于数学密码和光学密码组合实现:光学密码对数据分组进行"...为满足云计算对高安全、高效率密码方案的需求,该文提出一种安全增强密码工作模式——密码反馈"一组一密"(Cipher FeedBack one Block one Key,CFB-BK)模式,并基于数学密码和光学密码组合实现:光学密码对数据分组进行"一组一密"加解密,数学密码利用光学密码密文生成供光学密码下一组数据加解密使用的密钥。安全性分析表明,攻击者在密码学技术范围内,只能采用穷举密钥攻击方式,攻击复杂度高;效率分析表明,比基于数学密码实现的模式效率更高。展开更多
The differences among the extended Canetti ＆ Krawezyk 2007 model （ECK2007） and other four models, i.e., the Bellare ＆ Rogaway （1993, 1995）models （BR93,BR95）, the Bellare, Pointcheval ＆ Rogaway （2000） model ...The differences among the extended Canetti ＆ Krawezyk 2007 model （ECK2007） and other four models, i.e., the Bellare ＆ Rogaway （1993, 1995）models （BR93,BR95）, the Bellare, Pointcheval ＆ Rogaway （2000） model （BPR2000） and the Canetti ＆ Krawczyk （2001） model （CK2001） are given. The relative strength of security among these models is analyzed. To support the implication or non-implication relation among these models, the formal proof or the counter-example is provided.展开更多
Certificateless public key cryptography is a new paradigm introduced by Al-Riyami and Paterson.It eliminates the need of the certificates in traditional public key cryptosystems and the key escrow problem in IDentity-...Certificateless public key cryptography is a new paradigm introduced by Al-Riyami and Paterson.It eliminates the need of the certificates in traditional public key cryptosystems and the key escrow problem in IDentity-based Public Key Cryptography(ID-PKC).Due to the advantages of the certificateless public key cryptography,a new efficient certificateless pairing-based signature scheme is presented,which has some advantages over previous constructions in computational cost.Based on this new signature scheme,a certificateless blind signature scheme is proposed.The security of our schemes is proven based on the hardness of computational Diffie-Hellman problem.展开更多
A new attack is proposed to show that a specified group of verifiers can cooperate to forge the signature for any message by secret key substitution due to the leaked secret key or by the group public key adjustment b...A new attack is proposed to show that a specified group of verifiers can cooperate to forge the signature for any message by secret key substitution due to the leaked secret key or by the group public key adjustment because of the renewed members. This paper presents the improvement scheme which overcomes the security weakness of Laih and Yen's scheme.展开更多
The Boolean functions in an affine equivalence class are of the same algebraicdegree and nonlinearity, but may satisfy different order of correlation immunity and propa-gation criterion. A method is presented in this ...The Boolean functions in an affine equivalence class are of the same algebraicdegree and nonlinearity, but may satisfy different order of correlation immunity and propa-gation criterion. A method is presented in this paper to find Boolean functions with higherorder correlation immunity or satisfying higher order propagation criterion in an affine equiv-alence class. 8 AES s-box functions are not better Boolean functions in their affine equiva-lence class.展开更多
Based on elliptic curve Diffie-Hellman algorithm, an Elliptic Curve Authenticated Key Agreement (ECAKA) protocol with pre-shared password is proposed. Its security relies on the Elliptic Curve Discrete Logarithm Probl...Based on elliptic curve Diffie-Hellman algorithm, an Elliptic Curve Authenticated Key Agreement (ECAKA) protocol with pre-shared password is proposed. Its security relies on the Elliptic Curve Discrete Logarithm Problem (ECDLP). It provides identity authentication, key validation and perfect forward secrecy, and it can foil man-in-the-middle attacks.展开更多
In this paper, we analyze two signcryption schemes on elliptic curves proposed by Zheng Yu-liang and Hideki Imai. We point out a serious problem with the schemes that the elliptic curve based signcryption schemes lose...In this paper, we analyze two signcryption schemes on elliptic curves proposed by Zheng Yu-liang and Hideki Imai. We point out a serious problem with the schemes that the elliptic curve based signcryption schemes lose confidentiality to gain non-repudiation. We also propose two improvement versions that not only overcome the security leak inherent in the schemes but also provide public verifiability or forward security. Our improvement versions require smaller computing cost than that required by signature-then-encryption methods.展开更多
The threshold group signature is an important kind of signature. So far, many threshold group signature schemes have been proposed, but most of them suffer from conspiracy attack and are insecure. In this paper, a sec...The threshold group signature is an important kind of signature. So far, many threshold group signature schemes have been proposed, but most of them suffer from conspiracy attack and are insecure. In this paper, a secure threshold group signature scheme is proposed. It can not only satisfy the properties of the threshold group signature, but also withstand the conspiracy attack.展开更多
Two digital multisignature schemes based on bilinear pairings were proposed. One of them is the sequential digital multisignature, and the other is the broadcasting digital multisignature. The scheme has the same secu...Two digital multisignature schemes based on bilinear pairings were proposed. One of them is the sequential digital multisignature, and the other is the broadcasting digital multisignature. The scheme has the same security as JI and LIs multisignature scheme, but the new scheme has the lower computation. So the new scheme is the multisignature which has high security and low computation. It has the theory meaning and extensive application under the condition of SmartCard, etc.展开更多
The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing....The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols.展开更多
This paper proposes a general method to construct 1-resilient Boolean functions by modifying the Tu-Deng and Tang-Carlet-Tang functions. Cryptographic properties such as algebraic degree, nonlinearity and algebraic im...This paper proposes a general method to construct 1-resilient Boolean functions by modifying the Tu-Deng and Tang-Carlet-Tang functions. Cryptographic properties such as algebraic degree, nonlinearity and algebraic immunity are also considered. A sufficient condition of the modified func- tions with optimal algebraic degree in terms of the Siegenthaler bound is proposed. The authors obtain a lower bound on the nonlinearity of the Tang-Carlet-Tang functions, which is slightly better than the known result. If the authors do not break the ＂continuity＂ of the support and zero sets, the functions constructed in this paper have suboptimal algebraic immunity. Finally, four specific classes of 1-resilient Boolean functions constructed from this construction and with the mentioned good cryptographic properties are proposed. Experimental results show that there are many 1-resilient Boolean functions have higher nonlinearities than known l-resilient functions modified by Tu-Deng and Tang- Carlet-Tang functions.展开更多
It is already known that there are several nonlinearity criteria such asalgebraic degree nonlinearity, distance to linear structures, correlation immune, propagationcriterion, differential uniformity, which are used t...It is already known that there are several nonlinearity criteria such asalgebraic degree nonlinearity, distance to linear structures, correlation immune, propagationcriterion, differential uniformity, which are used to check whether a cryptographic function is weakor not. In this paper we will discuss these criteria from a valuation point of view, and considerthe largest transformation group which leave a criterion invariant, which is named its symmetrygroup. It can serve as a way of comparing the stability of nonlinearity criteria under the action ofinvertible transformations.展开更多
文摘为满足云计算对高安全、高效率密码方案的需求,该文提出一种安全增强密码工作模式——密码反馈"一组一密"(Cipher FeedBack one Block one Key,CFB-BK)模式,并基于数学密码和光学密码组合实现:光学密码对数据分组进行"一组一密"加解密,数学密码利用光学密码密文生成供光学密码下一组数据加解密使用的密钥。安全性分析表明,攻击者在密码学技术范围内,只能采用穷举密钥攻击方式,攻击复杂度高;效率分析表明,比基于数学密码实现的模式效率更高。
文摘The differences among the extended Canetti ＆ Krawezyk 2007 model （ECK2007） and other four models, i.e., the Bellare ＆ Rogaway （1993, 1995）models （BR93,BR95）, the Bellare, Pointcheval ＆ Rogaway （2000） model （BPR2000） and the Canetti ＆ Krawczyk （2001） model （CK2001） are given. The relative strength of security among these models is analyzed. To support the implication or non-implication relation among these models, the formal proof or the counter-example is provided.
基金the National Natural Science Foundation of China (No.60673070)the Natural Science Foundation of Jiangsu Province (No.BK2006217)the Open Project of the Key Lab. on Computer Networks and Information Security (Xidian University) of Ministry of Education of China(No.20040105)
文摘Certificateless public key cryptography is a new paradigm introduced by Al-Riyami and Paterson.It eliminates the need of the certificates in traditional public key cryptosystems and the key escrow problem in IDentity-based Public Key Cryptography(ID-PKC).Due to the advantages of the certificateless public key cryptography,a new efficient certificateless pairing-based signature scheme is presented,which has some advantages over previous constructions in computational cost.Based on this new signature scheme,a certificateless blind signature scheme is proposed.The security of our schemes is proven based on the hardness of computational Diffie-Hellman problem.
基金Project (No. 10271037) supported by the National Natural Science Foundation of China
文摘A new attack is proposed to show that a specified group of verifiers can cooperate to forge the signature for any message by secret key substitution due to the leaked secret key or by the group public key adjustment because of the renewed members. This paper presents the improvement scheme which overcomes the security weakness of Laih and Yen's scheme.
文摘The Boolean functions in an affine equivalence class are of the same algebraicdegree and nonlinearity, but may satisfy different order of correlation immunity and propa-gation criterion. A method is presented in this paper to find Boolean functions with higherorder correlation immunity or satisfying higher order propagation criterion in an affine equiv-alence class. 8 AES s-box functions are not better Boolean functions in their affine equiva-lence class.
基金Supported by "973" Program of China (No.G1999035805), "863" Program of China(No.2002AA143041), and RGC Project (No.HKU/7144/03E) of the Hong Kong SpecialAdministrative Region, China.
文摘Based on elliptic curve Diffie-Hellman algorithm, an Elliptic Curve Authenticated Key Agreement (ECAKA) protocol with pre-shared password is proposed. Its security relies on the Elliptic Curve Discrete Logarithm Problem (ECDLP). It provides identity authentication, key validation and perfect forward secrecy, and it can foil man-in-the-middle attacks.
文摘In this paper, we analyze two signcryption schemes on elliptic curves proposed by Zheng Yu-liang and Hideki Imai. We point out a serious problem with the schemes that the elliptic curve based signcryption schemes lose confidentiality to gain non-repudiation. We also propose two improvement versions that not only overcome the security leak inherent in the schemes but also provide public verifiability or forward security. Our improvement versions require smaller computing cost than that required by signature-then-encryption methods.
基金Supported in part by the National Natural Science Foundation of China under the Grant 60172060
文摘The threshold group signature is an important kind of signature. So far, many threshold group signature schemes have been proposed, but most of them suffer from conspiracy attack and are insecure. In this paper, a secure threshold group signature scheme is proposed. It can not only satisfy the properties of the threshold group signature, but also withstand the conspiracy attack.
基金Natural Science Foundation of Fujian Province of China( Z0511024)
文摘Two digital multisignature schemes based on bilinear pairings were proposed. One of them is the sequential digital multisignature, and the other is the broadcasting digital multisignature. The scheme has the same security as JI and LIs multisignature scheme, but the new scheme has the lower computation. So the new scheme is the multisignature which has high security and low computation. It has the theory meaning and extensive application under the condition of SmartCard, etc.
基金supported by the National Natural Science Foundation of China(Grant Nos.61303212,61170080,61202386)the State Key Program of National Natural Science of China(Grant Nos.61332019,U1135004)+2 种基金the Major Research Plan of the National Natural Science Foundation of China(Grant No.91018008)Major State Basic Research Development Program of China(973 Program)(No.2014CB340600)the Hubei Natural Science Foundation of China(Grant No.2011CDB453,2014CFB440)
文摘The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols.
基金supported by the National Key Basic Research Program of China under Grant No.2013CB834203the National Natural Science Foundation of China under Grant Nos.61472417 and 61472120the Research Council of Norway
文摘This paper proposes a general method to construct 1-resilient Boolean functions by modifying the Tu-Deng and Tang-Carlet-Tang functions. Cryptographic properties such as algebraic degree, nonlinearity and algebraic immunity are also considered. A sufficient condition of the modified func- tions with optimal algebraic degree in terms of the Siegenthaler bound is proposed. The authors obtain a lower bound on the nonlinearity of the Tang-Carlet-Tang functions, which is slightly better than the known result. If the authors do not break the ＂continuity＂ of the support and zero sets, the functions constructed in this paper have suboptimal algebraic immunity. Finally, four specific classes of 1-resilient Boolean functions constructed from this construction and with the mentioned good cryptographic properties are proposed. Experimental results show that there are many 1-resilient Boolean functions have higher nonlinearities than known l-resilient functions modified by Tu-Deng and Tang- Carlet-Tang functions.
基金This research is supported by the National Natural Science Foundation of China(19831070)
文摘It is already known that there are several nonlinearity criteria such asalgebraic degree nonlinearity, distance to linear structures, correlation immune, propagationcriterion, differential uniformity, which are used to check whether a cryptographic function is weakor not. In this paper we will discuss these criteria from a valuation point of view, and considerthe largest transformation group which leave a criterion invariant, which is named its symmetrygroup. It can serve as a way of comparing the stability of nonlinearity criteria under the action ofinvertible transformations.
