ASIA unversity:Item 310904400/6529
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94286/110023 (86%)
造訪人次 : 21665517      線上人數 : 484
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/6529


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6529


    題名: Schemes for Digital Gift Certificates with Low Computation Complexity
    作者: Chang, C. C.;Chang Y. F
    關鍵詞: digital gift certificate;e-commerce
    日期: 2005-12
    上傳時間: 2009-12-17 06:58:28 (UTC+0)
    出版者: Asia University
    摘要: 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.
    關聯: Informatica 16(4): 503-518
    顯示於類別:[資訊工程學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0KbUnknown352檢視/開啟
    310904400-6529.doc43KbMicrosoft Word232檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.

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