摘要
盲环签名可保护签名者和签名持有者的个人隐私,故其在个人隐私保护领域能发挥重要作用。根据Gentry和Peikert等提出的基于格的签名方案构造一个基于格的盲环签名方案,并在随机预言模型下基于选择目标求逆问题CTTI(Chosen target trapdoor inversion)证明了该方案满足在固定环攻击下的one-more不可伪造性,此外,还证明了该方案具备无条件匿名性和盲性。
Blind ring signatures can protect the privacies of signer and signature-holder, so it plays an important role in privacy protection applications. We constructed a lattice-based blind ring signature scheme according to the lattice-based signature scheme proposed by Gentry and Peikert et al. , and proved in random oracle model and based on chosen target trapdoor inversion (CTYI) problem that the proposed scheme satisfies the bne-more unforgeability under fixed-ring attacks. Moreover, we also proved the unconditional anonymity and the blindness of the proposed scheme.
出处
《计算机应用与软件》
CSCD
2015年第7期301-304,共4页
Computer Applications and Software
基金
河北省高等学校科学技术研究项目(ZD2010102)
关键词
盲环签名
可证明安全
随机预言模型
不可伪造性
格
Blind ring signature Provable security Random oracle model Unforgeability Lattices