ASIA unversity:Item 310904400/6466
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94286/110023 (86%)
Visitors : 21717560      Online Users : 118
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/6466


    Title: A New t-out-n Oblivious Transfer with Low Bandwidth
    Authors: Huang, H. F.;Chang, C. C.
    Keywords: Two-lock cryptosystem;private information retrieval;elliptic curve
    Date: 2007-03
    Issue Date: 2009-12-17 06:58:07 (UTC+0)
    Publisher: Asia University
    Abstract: 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.
    Relation: Applied Mathematics Sciences 1(7): 311-320
    Appears in Collections:[Department of Computer Science and Information Engineering] Journal Artical

    Files in This Item:

    File Description SizeFormat
    0KbUnknown472View/Open
    310904400-6466.doc74KbMicrosoft 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