37 search results - page 3 / 8 » Undeniable Signatures |
82
Voted
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows ...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
Many variants of Chaum and van Antwerpen’s undeniable signatures have been proposed to achieve specific properties desired in real-world applications of cryptography. Among them...
ASIACRYPT
2004
Springer
15 years 2 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...
72
Voted
MYCRYPT
2005
Springer
15 years 3 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 ...
AMC
2005
14 years 9 months ago
2005
At the fourth ACM conference on electronic commerce (EC'03), S. Han, K.Y. Yeung and J. Wang proposed an ID-based confirmer signature scheme using pairings (actually, this is a...