JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/4452

Title: Efficient "on the fly" signature schemes based on integer factoring
Authors: Okamoto, Takeshi
Tada, Mitsuru
Miyaji, Atsuko
Issue Date: 2001
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 2247/2001
Start page: 275
End page: 286
DOI: 10.1007/3-540-45311-3
Abstract: 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
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
73-42.pdf149KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, Japan Advanced Institute of Science and Technology