Undeniable Signatures Based on Characters: How to Sign with One Bit

We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. Its asymptotic complexity is attractive: the asymptotic complexity of all algorithms (even the key setup) are quadratic in the size of the modulus n in bits when the other parameters are fixed. The practical complexity can be quite low depending on parameter and variant choices. We present also a proof of security of our scheme containing the standard security requirements of an undeniable signature.


Published in:
Public Key Cryptography - PKC 2004, 7th International Workshop on Theory and Practice in Public Key Cryptography, 2947, 69-85
Year:
2004
Other identifiers:
Laboratories:




 Record created 2007-01-19, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)