Abstract

We propose the first universal designated verifier signature (UDVS) scheme whose security can be proven without random oracles, whereas the security of all previously known UDVS schemes are proven only when random oracles are assumed. To achieve our goal, we present a new short signature scheme without random oracles, which is a variant of BB04 scheme [4]. We also give new security definitions to UDVS. We note that our weakest security definitions are even stronger than any of previously known security definitions: We allow adversaries to behave more adaptively in oracle accessing and we also consider adaptive chosen public key attacks. The security of our UDVS scheme is then proven according to the new security definitions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call