Undeniable signatures were proposed to limit the public verification property of ordinary digital signature. In fact, the verification of such signatures cannot be obtained withou...
An expectation of a signature system is that a signatory cannot dispute a signature. Aiming at this, the following questions arise: Can documents in electronic commerce on the Inte...
In 2003, Hwang et al. proposed a new blind signature based on the RSA cryptosystem by employing Extended Euclidean algorithm. They claimed that the proposed scheme was untraceable...
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...