高级检索
    谢佳, 胡予濮, 江明明. 前向安全的格基代理签名[J]. 计算机研究与发展, 2021, 58(3): 583-597. DOI: 10.7544/issn1000-1239.2021.20200321
    引用本文: 谢佳, 胡予濮, 江明明. 前向安全的格基代理签名[J]. 计算机研究与发展, 2021, 58(3): 583-597. DOI: 10.7544/issn1000-1239.2021.20200321
    Xie Jia, Hu Yupu, Jiang Mingming. Lattice-Based Forward Secure Proxy Signatures[J]. Journal of Computer Research and Development, 2021, 58(3): 583-597. DOI: 10.7544/issn1000-1239.2021.20200321
    Citation: Xie Jia, Hu Yupu, Jiang Mingming. Lattice-Based Forward Secure Proxy Signatures[J]. Journal of Computer Research and Development, 2021, 58(3): 583-597. DOI: 10.7544/issn1000-1239.2021.20200321

    前向安全的格基代理签名

    Lattice-Based Forward Secure Proxy Signatures

    • 摘要: 顾名思义, 前向安全的代理签名具备前向安全性和可代理性, 因而, 自提出以来, 已被广泛应用在移动通信、电子拍卖等众多应用场景中.目前现有的前向安全的代理签名基本上都是基于离散对数难题亦或是大整数分解问题.而这些问题随着量子计算机逐渐成为现实, 将会变得不再困难.因而, 寻找量子计算环境下前向安全的代理签名已迫在眉睫.现存的量子安全的公钥密码体制有4类, 分别为基于Hash的密码体制、基于编码的密码体制、多变量公钥密码体制以及格公钥密码体制.在这4类公钥密码体制中, 格公钥密码以其量子免疫性, 计算简单高效, 任意实例下的安全性和最坏实例下的安全性相当等优势在近10年得到了快速发展, 并已经取得了显著成就.在格上引入前向安全的代理签名这一概念并给出其安全性模型, 基于格上已知NP困难的小整数解问题(small integer solution, SIS)提出了2个前向安全的格基代理签名.在这2个签名中, 其中1个签名在随机预言机模型下被证明是不可伪造的, 能够抵抗恶意原始签名人和未被授权代理签名人攻击, 且与之前格基代理签名相比较, 以牺牲效率为代价, 达到了实现前向安全性的目的; 另外1个签名在标准模型下是安全的, 且能实现前向安全性.

       

      Abstract: With advantages of both forward security and proxy, the forward secure proxy signature has been widely applied in mobile communication and electronic auction since it was proposed. However, most of the existing forward secure proxy signatures are based on the classic number theory problem, such as the problem of discrete logarithms and the problem of factorization, which are no longer secure when the general quantum computers become a reality. So looking for the quantum-immune forward secure proxy signature is much urgent. Among the four quantum-immune public key cryptographies, lattice-based cryptography enters a rapid development period in the last ten years and has got many achievements, having the advantages of quantum-immune, computing simply and efficiently, and the worst-case to average-case security guarantees. In this paper, we firstly introduce the concept and the security model of forward secure proxy signature in lattice-based cryptography, and propose two forward secure proxy lattice-based signature schemes based on the small integer solution problem, which is the NP-hard problem. One is the first lattice-based forward proxy signature in the random oracle model, which is proven secure against the polynomial time adversary(both of the unauthorized proxy signer and the malicious original signer). And the forward security is satisfied at the expense of efficiency. The other is proven unforgeable and forward secure in the standard model, which is also the first lattice-based attempt in the standard model.

       

    /

    返回文章
    返回