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

    Title: Certificateless aggregate signature with efficient verification
    Authors: Tso, Raylin
    Contributors: 資訊科學系
    Keywords: signature;aggregate signature;certificateless cryptography;certificateless aggregate signature;verification;security
    Date: 2015-09
    Issue Date: 2015-11-05 18:28:48 (UTC+8)
    Abstract: Certificateless public key cryptography (CL-PKC) is a cryptosystem solving the key escrow problem of identity-based cryptography. One of the applications of CL-PKC is certificateless aggregate signature (CLAS) that in practice can be used to efficiently verify concealed data aggregation in wireless sensor networks. CLAS is referred to as an extension of certificateless signature, which in particular performs verification for many signatures efficiently. Therefore, not only plenty of CLAS schemes have been proposed but also the security models of CLAS were introduced in the literature. Recently, some CLAS schemes are extended from specific certificateless signature (CLS) schemes. However, we found that two certificateless signature (CLS) and their corresponding CLAS schemes are not secure. In this paper, we simplify the relation of security definitions of CLS and CLAS. Then, a new CLAS scheme is proposed, which leads to the advantages of both certificateless cryptography and aggregate signature. Moreover, our scheme only depends on constant pairing operations to verify a large number of signatures per time, because pairing is a complicated operation with high cost in computations. Copyright © 2014 John Wiley & Sons, Ltd.
    Relation: Security and Communication Networks,8(13),2232-2243
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1002/sec.1166
    DOI: 10.1002/sec.1166
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description 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