Institutional Repository
| toward real-life implementation of signature schemes from the strong rsa assumption | |
| Yu Ping; Xue Rui | |
| 2012 | |
| Conference Name | 15th International Conference on Financial Cryptography and Data Security, FC 2011 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 3-12 |
| Conference Date | February 28, 2011 - March 4, 2011 |
| Conference Place | St. Lucia, QLD, Australia |
| Indexed Type | EI ; SPRINGER |
| ISSN | 0302-9743 |
| ISBN | 9783642298882 |
| Department | (1) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China |
| English Abstract | This paper introduces our work on performance improvement of signature schemes based on the strong RSA assumption for the purpose of real-life implementation and deployment. Many signature schemes based on the strong RSA assumption have been proposed in literature. The main advantage of these schemes is that they have security proofs in the standard model, while the traditional RSA scheme can only be demonstrated secure in the Random Oracle Model. However, the downside is the loss of efficiency among these schemes. Almost all these schemes double the computational cost of signature generation in the RSA scheme. So far the research in this area is more focusing on theoretical aspect. In this paper, we introduce techniques which greatly improve the performance of available schemes, and obtain a state-of-the-art signature scheme in the strong RSA family. In a typical setting where the RSA modulus is 1024 bits, it needs only one exponentiation calculation at the cost of about 160 modular multiplications, and a 162-bit prime number generation. This cost is even lower than the RSA signature scheme. Our work brings the current theoretical results into real-life implementation and deployment. © 2012 Springer-Verlag.; This paper introduces our work on performance improvement of signature schemes based on the strong RSA assumption for the purpose of real-life implementation and deployment. Many signature schemes based on the strong RSA assumption have been proposed in literature. The main advantage of these schemes is that they have security proofs in the standard model, while the traditional RSA scheme can only be demonstrated secure in the Random Oracle Model. However, the downside is the loss of efficiency among these schemes. Almost all these schemes double the computational cost of signature generation in the RSA scheme. So far the research in this area is more focusing on theoretical aspect. In this paper, we introduce techniques which greatly improve the performance of available schemes, and obtain a state-of-the-art signature scheme in the strong RSA family. In a typical setting where the RSA modulus is 1024 bits, it needs only one exponentiation calculation at the cost of about 160 modular multiplications, and a 162-bit prime number generation. This cost is even lower than the RSA signature scheme. Our work brings the current theoretical results into real-life implementation and deployment. © 2012 Springer-Verlag. |
| Keyword | Authentication Costs Cryptography Efficiency Electronic Document Identification Systems |
| Sponsorship | Office of Naval Research Global; Research in Motion; East Caribbean Financial Holding; Google; Lime |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15690 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Yu Ping,Xue Rui. toward real-life implementation of signature schemes from the strong rsa assumption[C],2012:3-12. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment