Universal Designated Verifier Signature without Random Oracles
Yong Hong Yu · Microelectronics & Computer · 2007
The security of previously known universal designated verifier signature schemes are mostly proven when the random oracles are assumed,but security in the random oracle model does not imply security in the real world. Based on the short signature scheme without random oracles proposed by Zhang et al, a universal designated verifier signature scheme whose security can be proven without random oracles was proposed, and its security proof was given. Its strong unforgeability relies on k+1 square roots assumption and knowledge-of-exponent assumption. The proposed scheme achieves unconditional non-transferability against adaptive chosen public key attack and chosen message attack. The length of the proposed scheme is 1366 bits, which is shorter than that of most existing schemes.