| Presentation | 2001/11/2 Security Analysis of Signature Schemes Based on Fast on-line Computation Takeshi Okamoto, Mitsuru Tada, Atsuko Miyaji, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Recently, the authors proposed two signature schemes[7, 6], which realize the fast signature generation in on line. In[7]we discussed the security under the possible key attack scenario. However there exists some problems such that whether the attack is valid or not for the security proof. In this paper, we analyze the security of ours, under the one key attack attack scenario, which is assumed to give more rigorous security than before. For preparation, we propose a new underlying problem, called extended finding order problem, and evaluate the difficulties to solve the problem by using the technique of reductions among functions. Consequently, we can show that, in the case that the number of factors of modulus n(a public key)is more than three, our schemes are as secure as the proposed problem(in the random oracle). We also show that, under the same setting, the other schemes also obtain provable security. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | On the Fly Signature / On Line Computation / Random Oracle Model / Finding Order Problem and Factoring Problem |
| Paper # | ISEC2001-79 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2001/11/2(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) | Security Analysis of Signature Schemes Based on Fast on-line Computation |
| Sub Title (in English) | |
| Keyword(1) | On the Fly Signature |
| Keyword(2) | On Line Computation |
| Keyword(3) | Random Oracle Model |
| Keyword(4) | Finding Order Problem 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 | 2001/11/2 |
| Paper # | ISEC2001-79 |
| Volume (vol) | vol.101 |
| Number (no) | 403 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |