30 search results - page 2 / 6 » 3-Move Undeniable Signature Scheme |
ASIACRYPT
2006
Springer
13 years 9 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 ...
AMC
2005
13 years 5 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...
SCN
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. This paper shows some efficient and provably-secure convertible undeniable signature schemes (with both selective conversion and all conversion), in the standard model an...
IJNSEC
2008
13 years 4 months ago
2008
Recently non-abelian groups have attracted the attention of cryptographers for constructing public-key cryptographic protocols. In this paper we use the conjugacy problem in non-a...
ICICS
2007
Springer
13 years 11 months ago
2007
Springer
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...