|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4452
|
| タイトル: | Efficient "on the fly" signature schemes based on integer factoring |
| 著者: | Okamoto, Takeshi
Tada, Mitsuru
Miyaji, Atsuko |
| 発行日: | 2001 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 2247/2001 |
| 開始ページ: | 275 |
| 終了ページ: | 286 |
| DOI: | 10.1007/3-540-45311-3 |
| 抄録: | In 1999, Poupard and Stern proposed on the fly signature scheme (PS-scheme), which aims at minimizing the on-line computational work for a signer. In this paper, we propose more efficient on the fly signature schemes by improving the PS-scheme. In PS-scheme, the size of secret-key is fixed by modulus n, so that this feature leads to some drawbacks in terms of both the computational work and the communication load. The main idea of our schemes is to reduce the size of secret-key in PS-scheme by using a public element g which has a specific structure. Consequently, our schemes are improved with respect to the computational work (which means the computational cost for "precomputation", "(on-line) signature generation" and "verification") and the data size such as a secret-key and a signature. |
| Rights: | This is the author-created version of Springer, Takeshi Okamoto, Mitsuru Tada, Atsuko Miyaji, Lecture Notes in Computer Science, 2247/2001, 2001, 275-286.The original publication is available at www.springerlink.com, http://www.springerlink.com/content/48q8qkhl2n7g5d56 |
| URI: | http://hdl.handle.net/10119/4452 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 73-42.pdf | | 149Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
