| Presentation | 2000/9/21 Efficient Signature Schemes Based on Factoring Takeshi Okamoto, Mitsuru Tada, Atsuko Miyaji, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Recently, Poupard and Stern proposed on the fly signature schemes, that aim at minimizing the on-line computational work for the signer[26, 27]. So this signature is suitable for a smart card application, whose CPU power or memory is rather limited. However there exist some drawbacks, like requiring much work in the verification etc. In this paper, we propose efficient on the fly signature schemes which are derived from three pass identification scheme. To make the protocols, we improve the Poupard-Stern scheme[27]in the computational work of both signature generation and verification, and also in the bit size of signatures by extending two primes of RSA modulus to three or more primes. The efficiency of our scheme is a bit surprising: the complexity of off-line and on-line signature generation, and that of verification are reduced by at least 55%, 33% and 47% respectively, and the size of signature is also reduced by at least 23%, which is compared with the previous scheme. Furthermore our schemes can be linked naturally with user's certification data. From the practical point of view, our scheme is more desirable since it can manage public key efficiently. We also show that our schemes obtain provable security based on factoring problem. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | On the Fly Signature / Identification / Zero-Knowledge / Certification Data / Computational Work and Factoring Problem |
| Paper # | ISEC2000-61 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2000/9/21(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Information Security (ISEC) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Efficient Signature Schemes Based on Factoring |
| Sub Title (in English) | |
| Keyword(1) | On the Fly Signature |
| Keyword(2) | Identification |
| Keyword(3) | Zero-Knowledge |
| Keyword(4) | Certification Data |
| Keyword(5) | Computational Work and Factoring Problem |
| 1st Author's Name | Takeshi Okamoto |
| 1st Author's Affiliation | School of Information Science, Japan Advanced Institute of Science and Technology(JAIST)() |
| 2nd Author's Name | Mitsuru Tada |
| 2nd Author's Affiliation | School of Information Science, Japan Advanced Institute of Science and Technology(JAIST) |
| 3rd Author's Name | Atsuko Miyaji |
| 3rd Author's Affiliation | School of Information Science, Japan Advanced Institute of Science and Technology(JAIST) |
| Date | 2000/9/21 |
| Paper # | ISEC2000-61 |
| Volume (vol) | vol.100 |
| Number (no) | 323 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |