An attribute-based ring signature scheme in lattice was proposed in this paper. In this signature scheme, an entity’s attributes correspond to the columns of a lattice matrix, and the signature was generated by using...An attribute-based ring signature scheme in lattice was proposed in this paper. In this signature scheme, an entity’s attributes correspond to the columns of a lattice matrix, and the signature was generated by using a subset of these attributes. The entities possessing these attributes form a ring. The scheme is computationally efficient than the schemes based on the integer factor problem and discrete logarithm problem, furthermore it is still secure in quantum computing environment.展开更多
基于格上SIS(Short Integral Solution)问题的困难性假设,在盆景树模型下,利用盆景树签名构造了一个格上的环签名。环签名的安全性是基于格上SIS问题的困难性。方案实现了签名者身份的完全匿名性,在标准模型下(无随机预言机)证明环签名...基于格上SIS(Short Integral Solution)问题的困难性假设,在盆景树模型下,利用盆景树签名构造了一个格上的环签名。环签名的安全性是基于格上SIS问题的困难性。方案实现了签名者身份的完全匿名性,在标准模型下(无随机预言机)证明环签名方案满足存在性不可伪造。展开更多
基金Supported by National High Technology Research and Development Plan of China (2009AA01Z403, 2009AA01Z435)
文摘An attribute-based ring signature scheme in lattice was proposed in this paper. In this signature scheme, an entity’s attributes correspond to the columns of a lattice matrix, and the signature was generated by using a subset of these attributes. The entities possessing these attributes form a ring. The scheme is computationally efficient than the schemes based on the integer factor problem and discrete logarithm problem, furthermore it is still secure in quantum computing environment.
