¡@

Designated confirmer signatures, initially introduced by Chaum in 1994, eliminated the undeniable signature shortcoming in which the signature can only be verified through the cooperation of the original signer. This paper proposes several practical constructions to multiple designated confirmer signature schemes. We employ the message-dependent proof of equality of the discrete logarithm and trap-door commitments to construct a new type of multiple confirmer scheme, where specified verifiers designated by the signer would have an advantage in verifying a signature where only one (out of n) confirmer is needed for a confirmation. Other verifiers, who the signer did not designate, must ask all n confirmers to collaboratively confirm this signature. This paper also provides an efficient and practical solution in applying the threshold functions on the designated confirmer signatures.

Keywords: cryptography, undeniable signature, designated confirmer signatures, zeroknowledge proof, threshold signature

Retrieve PDF document (200611_06.pdf)

Received September 8, 2004; revised March 3, 2005; accepted May 5, 2005.
Communicated by Randy Chow.
^* This work was supported in part by the National Science Council of Taiwan, R.O.C., under contract No. NSC 89-2218-E-214-020.