ASIA unversity:Item 310904400/6512
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21700613      Online Users : 409
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/6512


    Title: An Efficient and Flexible Forward-Secure Signature Scheme
    Authors: Huang, H. F.;Chang, C. C.
    Keywords: forward-secure signature;cryptography
    Date: 2006-03
    Issue Date: 2009-12-17 06:58:23 (UTC+0)
    Publisher: Asia University
    Abstract: In 2001, Itkis and Reyzin proposed the first forward-secure signature scheme in which both the signing and the verifying are as efficient as the
    underlying ordinary signature scheme. However,their method will require to generate many larger primes for keys, and key update algorithm is very slow, making it impractical for some applications. This paper proposes a new efficient method to implement the forward-secure signature. The proposed method can solve the problem raised by Itkis and Reyzin?s scheme of finding many larger primes and the efficiency of this method is the same as the underlying signature scheme. In the proposed scheme, no modular exponentiation and inverse computations are required for the key update algorithm. Moreover, only four modular multiplications, three modular additions and two hashing computations are performed by the key update procedure. That is more efficient than Itkis and Reyzin?s key update algorithm. Comparing with the existing forward-secure signature schemes in the literatures, the proposed scheme reduces a large of computations for the key update procedure. Hence,
    the fast key update algorithm could be used for electronic checkbook application. Furthermore, in our scheme, the total number of time periods T could be extended to T+1 or more periods, and the storage space to store its keys and signatures is almost the same as in those ordinary signature schemes. Thus, the proposed scheme is more practical and has lower limitations.
    Relation: International Journal of Computer Science and Network 6(3B): 211-219
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    0KbUnknown490View/Open
    310904400-6512.doc33KbMicrosoft Word251View/Open


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


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback