18 search results - page 1 / 4 » Short Undeniable Signatures Based on Group Homomorphisms |
JOC
2011
12 years 7 months ago
2011
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
ASIACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diï¬...
MYCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at ...
CTRSA
2005
Springer
13 years 10 months ago
2005
Springer
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible un...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
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. I...