Sciweavers

175 search results - page 3 / 35
» A Directed Signature Scheme Based on RSA Assumption
Sort
View
ASIACRYPT
2006
Springer
13 years 9 months ago
New Approach for Selectively Convertible Undeniable Signature Schemes
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 ...
Kaoru Kurosawa, Tsuyoshi Takagi
PKC
2004
Springer
146views Cryptology» more  PKC 2004»
13 years 11 months ago
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
Huafei Zhu
EUROCRYPT
2001
Springer
13 years 10 months ago
Practical Threshold RSA Signatures without a Trusted Dealer
We propose a threshold RSA scheme which is as efficient as the fastest previous threshold RSA scheme (by Shoup), but where two assumptions needed in Shoup’s and in previous schem...
Ivan Damgård, Maciej Koprowski
ICICS
2001
Springer
13 years 10 months ago
Threshold Undeniable RSA Signature Scheme
Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almo...
Guilin Wang, Sihan Qing, Mingsheng Wang, Zhanfei Z...
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
11 years 8 months ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman