loading...
A Strong RSA Signature Scheme and Its Application
Haier International Training Center, Qingdao, China July 30-August 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD.2007.33Eighth ACIS International Conference ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Zhengjun Cao, Shanghai University, China
Lihua Liu, Shanghai Maritime University, China
We present an efficient improvement of the strong RSA signature scheme [1], which is very similar to Fischlin signature [2]. Both two signatures are based on strong RSA assumption. In the original scheme, the signer has to choose a prime with prescribed length in signing phase. Except that, three generators of QR_n should be chosen in the setup phase. Our scheme removes or relaxes these restrictions. It only needs to choose two generators of QR_n and an odd. Our scheme saves about 1/2 computational cost of the original scheme. Moreover, we propose a blind signature scheme and a partially blind signature scheme based on the basic scheme. To the best of our knowledge, it?s the first time to propose such a blind signature scheme and a partially blind signature scheme based on strong RSA assumption.
Citation:
Zhengjun Cao, Lihua Liu, "A Strong RSA Signature Scheme and Its Application," snpd, vol. 1, pp.111-115, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.