English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93244/123616 (75%)
Visitors : 27796759      Online Users : 530
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/77973
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/77973

    Title: Strongly secure certificateless short signatures
    Authors: Tso, Raylin
    Susilo, Willy
    Huang, Xinyi
    Contributors: 資科系
    Keywords: Bilinear pairing;Certificateless signature;Random oracle;Short signature;Strongly secure
    Date: 2012-06
    Issue Date: 2015-08-24 15:20:11 (UTC+8)
    Abstract: Short certificateless signatures have come into limelight in recent years. On the one hand, the property of certificateless eliminates the certificate management problem in traditional PKI and the key-escrow problem in some ID-based signature schemes. On the other hand, due to the short signature length, short certificateless signatures can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power, such as PDAs or cell phones. However, there has been a trade-off between short certificateless signature schemes and their security levels. All existing short certificateless signature schemes can only be proven secure against a normal type adversary rather than a stronger one, who can obtain valid certificateless signatures under public keys replaced by the adversary. In this paper, we solve this open problem by given an efficient strongly secure short certificateless signature scheme. The proposed scheme has the following features. Firstly, it is strongly unforgeable. Secondly, the security can be reduced to the Computational Diffie–Hellman (CDH) assumption – a classic complexity assumption. Lastly, the proposed scheme is provably secure against adversaries with access to a super signing oracle which generates valid certificateless signatures of messages and public keys chosen by the adversary (without providing the corresponding secret values).
    Relation: Journal of Systems and Software, 85(6), 1409-1417
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/j.jss.2012.01.016
    DOI: 10.1016/j.jss.2012.01.016
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    1409-1417.pdf408KbAdobe PDF469View/Open

    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