Hierarchical ID-Based Blind Signature from Lattices
Liang Chen, Yongquan Cui, Xueming Tang +2 more
Blind signature offer the protection for sender's privacy and become an important primitive for electronic commerce. In this paper, we present a technique of matrix-vector-blinding for lattice-based blind signature. Building on this result, we propose two hierarchical ID-based blind signature schemes from lattice with and without random oracle, which are secure against quantum attacks. We apply the latest technique of "lattice basis delegation in fixed dimension" from ABB10's[1] scheme to our constructions which contribute to shorter public key and signature. Both of our blind signature schemes are proven to hold the properties of perfect blindness and one-more unforgeableability. Our hierarchical ID-based blind signature schemes are communicationally efficient and needs only one round data exchanges between the signer and the user, and with a shorter public key and signature in comparison with similar schemes[2, 3]. We prove that our scheme is secure assuming that the short integer solution (SIS) problem is hard.
International Conference on Computational Intelligence and Security (CIS)•Dec 1, 2011•4 citations