摘要
Digital signature is one of the most important cryptographic primitives. We proposed a new digital signature scheme based on Catalano’s trapdoor. Since Catalano’s trapdoor is more efficient than existing trapdoors in number theory, our scheme need not modular exponentiation but several modular multiplications in the signing algorithm. We also proved our scheme is provably secure against adap-tively chosen message attack by using the Forking lemma.
Digital signature is one of the most important cryptographic primitives. We proposed a new digital signature scheme based on Catalano＇s trapdoor. Since Catalano＇s trapdoor is more efficient than existing trapdoors in number theory, our scheme need not modular exponentiation but several modular multiplications in the signing algorithm. We also proved our scheme is provably secure against adap-tively chosen message attack by using the Forking lemma.
基金
Supported by the National Natural Science Foundation of China (No. 60703086)
Program for Excellent Talents in Nanjing University of Posts and Telecommunications(No. NY209014)
