Efficient key-evolving protocol for the GQ signature
| dc.citation.epage | 769 | en_US |
| dc.citation.issue | 4 | en_US |
| dc.citation.spage | 763 | en_US |
| dc.citation.volume | 20 | en_US |
| dc.citation.woscount | 2 | |
| dc.contributor.author | Lu, CF | en_US |
| dc.contributor.author | Shieh, S | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:38:52Z | |
| dc.date.available | 2014-12-08T15:38:52Z | |
| dc.date.issued | 2004-07-01 | en_US |
| dc.description.abstract | Several key-evolving protocols for the Guillou-Quisquater (GQ) signature have been proposed. However, the computational loads are still high, which require the multiplication of several modular exponentiations of at least 1024-bit length. In this paper, we present a low-complexity key-evolving protocol with two additional benefits. First, it ensures the secrecy of other signing keys, even when the si.-ning keys in some periods are compromised. Second, it provides the basic time-stamping service, which is important for legal or notary applications. Related schemes are also compared with our scheme. | en_US |
| dc.identifier.issn | 1016-2364 | en_US |
| dc.identifier.journal | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/26624 | |
| dc.identifier.wosnumber | WOS:000222616000010 | |
| dc.language.iso | en_US | en_US |
| dc.subject | cryptography | en_US |
| dc.subject | key management signature scheme | en_US |
| dc.subject | key-evolving protocol | en_US |
| dc.subject | GQ scheme | en_US |
| dc.title | Efficient key-evolving protocol for the GQ signature | en_US |
| dc.type | Article | en_US |