English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94986/125531 (76%)
Visitors : 31031633      Online Users : 391
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
    政大機構典藏 > 理學院 > 資訊科學系 > 會議論文 >  Item 140.119/39857
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/39857

    Title: Efficient Short Signatures from Pairing
    Authors: 左瑞麟
    Contributors: 國立政治大學資訊科學系
    Keywords: Applied cryptography;Cell phone;Computation power;Information security;Low-bandwidth;Random Oracle model;Short signatures;Cellular telephone systems;Cryptography;Information technology;Telecommunication equipment;Network security
    Date: 2009-04
    Issue Date: 2010-05-27 16:51:52 (UTC+8)
    Abstract: Short signature schemes are useful for systems where signatures are typed in by a human or for systems with low-bandwidth channels and/or low-computation power such as PDAs or cell phones. In this paper, a new short signature scheme is proposed. Our scheme is more efficient than Zhang et al.'s scheme and BLS scheme. Based on the hardness of k-CAA Problem, we provide a rigorous proof for our scheme in the random oracle model. © 2009 IEEE.
    Relation: ITNG 2009 - 6th International Conference on Information Technology: New Generations,417-422
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1109/ITNG.2009.176
    DOI: 10.1109/ITNG.2009.176
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File SizeFormat

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

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