Generic homomorphic undeniable signatures

We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diffie-Hellman, and RSA. As an application, we propose a generic undeniable signature scheme which generalizes the MOVA schemes. Our scheme is generic in the sense that we transform a private group homomorphism from public groups G to H (the order of H being public) into an undeniable signature scheme. It is provably secure in the random oracle model provided that the interpolation problem is hard and it offers the advantage of making the signature size arbitrarily short (depending on a security level). We (im)prove some security results from MOVA. We also propose a new example with complexity similar to RSA and with 3-byte signatures


Published in:
The 10th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2004, 3329, 354-371
Presented at:
The 10th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2004, Jeju Island, South Korea, December 5-9, 2004
Year:
2004
Keywords:
Other identifiers:
Laboratories:




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

n/a:
MV04d_note - Download fulltextPDF
MV04d - Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

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