English  |  正體中文  |  简体中文  |  Items with full text/Total items : 55184/89457 (62%)
Visitors : 10668116      Online Users : 60
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45499


    Title: New threshold-proxy threshold-signature schemes
    Authors: 黃心嘉;Hwang, Shin-jia;Chen, Chiu-chin
    Contributors: 淡江大學資訊工程學系
    Date: 2005-01-01
    Issue Date: 2010-03-26 19:25:43 (UTC+8)
    Publisher: Elsevier
    Abstract: A new (t, n) threshold-proxy (c, m) threshold-signature scheme is proposed in this paper. In this scheme, only any t or more original signers of n original signers can authorize a proxy group of m proxy signers and then only c or more proxy signers can cooperatively generate threshold-proxy threshold-signatures. Our scheme provides the fair protection for the original and proxy groups. So original signers cannot forge the proxy signatures while the proxy signers cannot forge signatures on behalf of the original signers. Moreover, our scheme satisfies the seven conditions proposed by Mambo et al. Further, in our scheme, the verifier has to verify the correctness of the threshold proxy certificate before checking the correctness of the threshold-proxy threshold-signatures. To meet the practical situations, the proxy agreement is reached not only the original group but also the proxy group. To realize this new kind of agreement, the scheme provides two options for the generation of threshold-proxy certificates: threshold and total agreements. The total agreement option provides the flexible for the proxy group that the members cannot trust with each other. The best way to agree on the proxy authorization is the common view reached by all members.
    Relation: Computers and electrical engineering 31(1), pp.69-80
    DOI: 10.1016/j.compeleceng.2004.11.003
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File SizeFormat
    0KbUnknown225View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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