In order to achieve secure signcryption schemes in the quantum era, Li Fagen et al. [Concurrency and Computation： Practice and Experience, 2012, 25（4）： 2112-2122] and Wang Fenghe et al. [Applied Mathematics ＆ Inf...In order to achieve secure signcryption schemes in the quantum era, Li Fagen et al. [Concurrency and Computation： Practice and Experience, 2012, 25（4）： 2112-2122] and Wang Fenghe et al. [Applied Mathematics ＆ Information Sciences, 2012, 6（1）： 23-28] have independently extended the concept of signcryption to lattice-based cryptography. However, their schemes are only secure under the random or- acle model. In this paper, we present a lattice-based signcryp- tion scheme which is secure under the standard model. We prove that our scheme achieves indistinguishability against adaptive chosen-ciphertext attacks （IND-CCA2） under the learning with errors （LWE） assumption and existential unforgeability against adaptive chosen-message attacks （EUF- CMA） under the small integer solution （SIS） assumption.展开更多
Attribute-based signature is a versatile class of digital signatures. In attribute-based signature, a signer obtains his private key corresponding to the set of his attributes from a trusted authority, and then he can...Attribute-based signature is a versatile class of digital signatures. In attribute-based signature, a signer obtains his private key corresponding to the set of his attributes from a trusted authority, and then he can sign a message with any predicate that is satisfied by his attributes set. Unfortunately, there does not exist an attributebased signature which is resistance to the quantum attacks. This means we do not have secure attribute-based signature schemes in a post-quantum world. Based on this consideration, an attribute-based signature on lattices,which could resist quantum attacks, is proposed. This scheme employs "bonsai tree" techniques, and could be proved secure under the hardness assumption of small integer solution problem.展开更多
本文构建了一种新的格上基于身份的可链接环签名方案(identity-based linkable ring signature scheme on lattices,L_IBLRS),基于身份的可链接环签名是基于身份的环签名中加入链接属性得到的签名方案.现有的可链接环签名方案的链接性...本文构建了一种新的格上基于身份的可链接环签名方案(identity-based linkable ring signature scheme on lattices,L_IBLRS),基于身份的可链接环签名是基于身份的环签名中加入链接属性得到的签名方案.现有的可链接环签名方案的链接性是通过判断链接标签是否相等而得到两个合法签名是否具有链接性.而本文构建的基于身份的可链接环签名方案的链接性判断与此不同,是通过判断两个集合中相同元素的个数是否达到一定数量作为判断条件.文中方案的签名算法构造中利用环成员的公钥与真实签名者的私钥作为Hash函数输入而得到的输出代替其它方案中选择的服从于离散高斯分布的向量.由于签名输出中包含公钥与真实签名者的私钥作为Hash函数输入而得到的输出作为判断链接性的重要条件,这使得文中构建的基于身份的可链接环签名方案不是无条件匿名的,在获得环中所有成员私钥的情况下,就可以在签名输出中确定环成员中真实签名者的身份.此外,文中给出了L_IBLRS安全模型的形式化定义,在随机谕言模型下将不可伪造性归约到小整数解问题并利用统计距离定义及其性质给出匿名性的证明.展开更多
代理重签名作为一种特殊的数字签名,在电子认证和电子商务方面越来越重要.格密码作为抵抗量子攻击密码体制的代表之一,具有更高的安全性和更高的计算效率,因此基于格出现了一系列代理重签名方案.Tian M M给出了拥有较高效率的身份基代...代理重签名作为一种特殊的数字签名,在电子认证和电子商务方面越来越重要.格密码作为抵抗量子攻击密码体制的代表之一,具有更高的安全性和更高的计算效率,因此基于格出现了一系列代理重签名方案.Tian M M给出了拥有较高效率的身份基代理重签名方案,但该方案中代理重密钥需要委托者和受托者的私钥才能生成,且需要基于身份密钥托管.本文针对这两点不足进行改进,利用无抽样技术和格上的陷门生成算法、原像取样算法,构造了效率较高的格上无证书代理重签名方案.在随机预言机模型下证明了新方案的正确性,并且基于小整数解问题SIS的困难性证明了新方案对外部攻击和内部攻击在选择身份和选择消息下是存在不可伪造的.与已有格上的代理重签名相比,该方案能抵抗中间人攻击,具有更好的安全性和较高的效率.展开更多
基金This work was supported by the National Natural Science Foundation of China （Grant Nos. 61272057, 61202434, 61170270, 61100203, 61003286, 61121061）, the Fundamental Research Funds for the Central Universities （2012RC0612, 2011YB01）, Langfang Teachers University Youth Fund （LSZQ200804）, Hebei Education Funds for Youth Project （Q2012020, QN20131077）.
文摘In order to achieve secure signcryption schemes in the quantum era, Li Fagen et al. [Concurrency and Computation： Practice and Experience, 2012, 25（4）： 2112-2122] and Wang Fenghe et al. [Applied Mathematics ＆ Information Sciences, 2012, 6（1）： 23-28] have independently extended the concept of signcryption to lattice-based cryptography. However, their schemes are only secure under the random or- acle model. In this paper, we present a lattice-based signcryp- tion scheme which is secure under the standard model. We prove that our scheme achieves indistinguishability against adaptive chosen-ciphertext attacks （IND-CCA2） under the learning with errors （LWE） assumption and existential unforgeability against adaptive chosen-message attacks （EUF- CMA） under the small integer solution （SIS） assumption.
基金the National Natural Science Foundation of China(Nos.61133014 and 60903189)
文摘Attribute-based signature is a versatile class of digital signatures. In attribute-based signature, a signer obtains his private key corresponding to the set of his attributes from a trusted authority, and then he can sign a message with any predicate that is satisfied by his attributes set. Unfortunately, there does not exist an attributebased signature which is resistance to the quantum attacks. This means we do not have secure attribute-based signature schemes in a post-quantum world. Based on this consideration, an attribute-based signature on lattices,which could resist quantum attacks, is proposed. This scheme employs "bonsai tree" techniques, and could be proved secure under the hardness assumption of small integer solution problem.
文摘本文构建了一种新的格上基于身份的可链接环签名方案(identity-based linkable ring signature scheme on lattices,L_IBLRS),基于身份的可链接环签名是基于身份的环签名中加入链接属性得到的签名方案.现有的可链接环签名方案的链接性是通过判断链接标签是否相等而得到两个合法签名是否具有链接性.而本文构建的基于身份的可链接环签名方案的链接性判断与此不同,是通过判断两个集合中相同元素的个数是否达到一定数量作为判断条件.文中方案的签名算法构造中利用环成员的公钥与真实签名者的私钥作为Hash函数输入而得到的输出代替其它方案中选择的服从于离散高斯分布的向量.由于签名输出中包含公钥与真实签名者的私钥作为Hash函数输入而得到的输出作为判断链接性的重要条件,这使得文中构建的基于身份的可链接环签名方案不是无条件匿名的,在获得环中所有成员私钥的情况下,就可以在签名输出中确定环成员中真实签名者的身份.此外,文中给出了L_IBLRS安全模型的形式化定义,在随机谕言模型下将不可伪造性归约到小整数解问题并利用统计距离定义及其性质给出匿名性的证明.
文摘代理重签名作为一种特殊的数字签名,在电子认证和电子商务方面越来越重要.格密码作为抵抗量子攻击密码体制的代表之一,具有更高的安全性和更高的计算效率,因此基于格出现了一系列代理重签名方案.Tian M M给出了拥有较高效率的身份基代理重签名方案,但该方案中代理重密钥需要委托者和受托者的私钥才能生成,且需要基于身份密钥托管.本文针对这两点不足进行改进,利用无抽样技术和格上的陷门生成算法、原像取样算法,构造了效率较高的格上无证书代理重签名方案.在随机预言机模型下证明了新方案的正确性,并且基于小整数解问题SIS的困难性证明了新方案对外部攻击和内部攻击在选择身份和选择消息下是存在不可伪造的.与已有格上的代理重签名相比,该方案能抵抗中间人攻击,具有更好的安全性和较高的效率.
