4 research outputs found
On Designated Verifier Signature Schemes
Designated verifier signature schemes allow a signer to convince only the designated
verifier that a signed message is authentic. We define attack models on the
unforgeability property of such schemes and analyze relationships among the models. We
show that the no-message model, where an adversary is given only public keys, is
equivalent to the model, where an adversary has also oracle access to the verification
algorithm. We also show a separation between the no-message model and the chosen-message model,
where an adversary has access to the signing algorithm. Furthermore, we present a
modification of the Yang-Liao designated verifier signature scheme and prove its
security. The security of the modified scheme is based on the computational
Diffie-Hellman problem, while the original scheme requires strong Diffie-Hellman
assumption
New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures
Abstract. The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly verifiable digital signatures but have an additional functionality which allows any holder of a sig-nature to designate the signature to any desired verifier. This designated verifier can check that the message was indeed signed, but is unable to convince anyone else of this fact. We propose new efficient constructions for pairing-based short signatures. Our first scheme is based on Boneh-Boyen signatures and its security can be analyzed in the standard security model. We prove its resistance to forgery assuming the hardness of the so-called strong Diffie-Hellman problem, under the knowledge-of-exponent assumption. The second scheme is compatible with the Boneh-Lynn-Shacham signatures and is proven unforgeable, in the random oracle model, under the assumption that the computational bilinear Diffie-Hellman problem is untractable. Both schemes are designed for devices with constrained computation capabilities since the signing and the designation pro-cedure are pairing-free. Finally, we present extensions of these schemes in the multi-user setting proposed by Desmedt in 2003