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


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


    題名: A New t-out-n Oblivious Transfer with Low Bandwidth
    作者: Huang, H. F.;Chang, C. C.
    關鍵詞: Two-lock cryptosystem;private information retrieval;elliptic curve
    日期: 2007-03
    上傳時間: 2009-12-17 06:58:07 (UTC+0)
    出版者: Asia University
    摘要: The most efficient previously proposed oblivious transfer schemes require t calls of 1-out-n oblivious transfer (OT) to construct the t-out-n OT. Its computational requirements and bandwidth consumption are quite demanding. Therefore, to guarantee the quality of growing popular communication service, an efficient t-out-n OT scheme with low bandwidth is urgently desired. Based on elliptic curve cryptosystems, we propose a new t-out-n OT scheme in this paper. Compared with existing OT schemes based on modular exponentiations, our scheme can reduce many computation and communication loads for both the sender and the receiver. Owing to its smaller bandwidth and faster computation speed, our scheme is very suitable for mobile clients and smart-card users. Moreover, our scheme provides a simple algorithm and fewer parameter requirements.
    關聯: Applied Mathematics Sciences 1(7): 311-320
    顯示於類別:[資訊工程學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0KbUnknown474檢視/開啟
    310904400-6466.doc74KbMicrosoft Word251檢視/開啟


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


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