Chameleon Signature Schemes over Lattices in the Standard Model
As an ideal designated verifier signature,Chameleon Signature(CS)can solve the problem of signature secondary transmission more subtly by embedding an efficient Chameleon Hash Function(CHF)into the signing algorithm.In addition to non-transferability,CS also should satisfy unforgeability,deniability,non-repudiation for the signer,and so on.To solve the problems that cryptosystems based on the traditional number theory problems,such as the large integer factorization or discrete logarithm cannot resist quantum computing attacks,and the schemes that provably secure in the random oracle model may not be secure in a practical implementation,a lattice-based CS scheme in the standard model is proposed;Furthermore,to solve the problem of requiring a significant local storage to obtain deniability for the signer,a lattice-based CS scheme without local storage in the standard model is proposed,the new scheme completely eliminates the signer's dependence on the local signature library,and enables the signer to assist an arbitrator to reject a forged signature of any adversary without storing the original message and signature.Particularly,based on the hardness of the small integer solution problem and learning with errors problem,both schemes are proved secure in the standard model.
Chameleon Signature(CS)LatticeNon-transferabilityStandard modelWithout local storage