toward real-life implementation of signature schemes from the strong rsa assumption
文献类型：会议论文
| 作者 | Yu Ping ; Xue Rui |
| 出版日期 | 2012 |
| 会议名称 | 15th International Conference on Financial Cryptography and Data Security, FC 2011 |
| 会议日期 | February 28, 2011 - March 4, 2011 |
| 会议地点 | St. Lucia, QLD, Australia |
| 关键词 | Authentication Costs Cryptography Efficiency Electronic document identification systems |
| 页码 | 3-12 |
| 中文摘要 | 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. |
| 收录类别 | EI ; SPRINGER |
| 会议主办者 | Office of Naval Research Global; Research in Motion; East Caribbean Financial Holding; Google; Lime |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 语种 | 英语 |
| ISSN号 | 0302-9743 |
| ISBN号 | 9783642298882 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15690]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Yu Ping,Xue Rui. toward real-life implementation of signature schemes from the strong rsa assumption[C]. 见:15th International Conference on Financial Cryptography and Data Security, FC 2011. St. Lucia, QLD, Australia. February 28, 2011 - March 4, 2011. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。