An Efficient Signature Scheme with Fast Online Signing
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Youn, Taek-Young | - |
dc.contributor.author | Park, Young-Ho | - |
dc.contributor.author | Lim, Jongin | - |
dc.date.accessioned | 2021-09-08T12:44:55Z | - |
dc.date.available | 2021-09-08T12:44:55Z | - |
dc.date.created | 2021-06-11 | - |
dc.date.issued | 2009-10 | - |
dc.identifier.issn | 0916-8508 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/119141 | - |
dc.description.abstract | In 1999, Gennaro, Halevi and Rabin proposed a signature which achieves provable security without assuming the random oracles, and it is the first RSA-type signature whose security is proved in the standard model. Since that time, several signatures have been proposed to achieve better efficiency or useful property along with the provable security in the standard model. In this paper, we construct a trapdoor hash function, and design an efficient online/online signature by using the trapdoor hash function. Our signature scheme requires only one non-modular multiplication of two small integers for online signing, and it provides the fastest online signing among all online/offline signatures that achieve provable security in the standard model. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG | - |
dc.subject | SECURE | - |
dc.title | An Efficient Signature Scheme with Fast Online Signing | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lim, Jongin | - |
dc.identifier.doi | 10.1587/transfun.E92.A.2431 | - |
dc.identifier.scopusid | 2-s2.0-84883871720 | - |
dc.identifier.wosid | 000272394500006 | - |
dc.identifier.bibliographicCitation | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, v.E92A, no.10, pp.2431 - 2437 | - |
dc.relation.isPartOf | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | - |
dc.citation.title | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | - |
dc.citation.volume | E92A | - |
dc.citation.number | 10 | - |
dc.citation.startPage | 2431 | - |
dc.citation.endPage | 2437 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | SECURE | - |
dc.subject.keywordAuthor | online/offline signature | - |
dc.subject.keywordAuthor | trapdoor hash function | - |
dc.subject.keywordAuthor | strong RSA assumption | - |
dc.subject.keywordAuthor | division intractability | - |
dc.subject.keywordAuthor | discrete logarithm with short exponent problem | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.