A (t, n) threshold signature scheme allows t or more group members to generate signatures on behalf of a group with n members, while any t−1 or less members cannot do the same th...
We propose a convertible undeniable signature scheme without random oracles. Our construction is based on the Waters signatures proposed in Eurocrypt 2005. The security of our sche...
Tsz Hon Yuen, Man Ho Au, Joseph K. Liu, Willy Susi...
This paper describes new methods in pairing-based signature schemes for identifying the invalid digital signatures in a batch, after batch verification has failed. These methods ef...
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...