Sciweavers

139 search results - page 2 / 28
» On the Security of Two Key-Updating Signature Schemes
Sort
View
INFORMATICALT
2000
93views more  INFORMATICALT 2000»
13 years 4 months ago
A Secure Nonrepudiable Threshold Proxy Signature Scheme with Known Signers
In the (t, n) proxy signature scheme, the signature, originally signed by a signer, can be signed by t or more proxy signers out of a proxy group of n members. Recently, an efficie...
Min-Shiang Hwang, Iuon-Chang Lin, Eric Jui-Lin Lu
SCN
2010
Springer
116views Communications» more  SCN 2010»
13 years 3 months ago
Provably Secure Convertible Undeniable Signatures with Unambiguity
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...
Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata
ISW
1999
Springer
13 years 9 months ago
Cryptanalysis of Two Group Signature Schemes
Abstract. Group signature schemes allow a group member to anonymously sign on group’s behalf. Moreover, in case of anonymity misuse, a group authority can recover the issuer of a...
Marc Joye, Seungjoo Kim, Narn-Yih Lee
PKC
2012
Springer
212views Cryptology» more  PKC 2012»
11 years 7 months ago
Security of Blind Signatures Revisited
We revisit the definition of unforgeability of blind signatures as proposed by Pointcheval and Stern (Journal of Cryptology 2000). Surprisingly, we show that this established de...
Dominique Schröder, Dominique Unruh
AINA
2003
IEEE
13 years 8 months ago
Signature Schemes Based on Two Hard Problems Simultaneously
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang