English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21661816      Online Users : 459
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
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/6529


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


    Title: Schemes for Digital Gift Certificates with Low Computation Complexity
    Authors: Chang, C. C.;Chang Y. F
    Keywords: digital gift certificate;e-commerce
    Date: 2005-12
    Issue Date: 2009-12-17 06:58:28 (UTC+0)
    Publisher: Asia University
    Abstract: Recently, e-commerce becomes widespread; hence electronic department stores come into being. As a result, Chan and Chang proposed a scheme for digital gift certificates in 2002. Because it is hard to estimate the number of the clients of the electronic department stores, reducing the computation complexity of the electronic department stores becomes an important issue. Due to the need, we propose two schemes for digital gift certificates. Our proposed schemes are very practical since the computation load is light. So the schemes can be applied to the terminals with low computation power.
    Relation: Informatica 16(4): 503-518
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    0KbUnknown349View/Open
    310904400-6529.doc43KbMicrosoft Word232View/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