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

    Title: Convertible ring signatures with gradual revelation of non-signers
    Authors: 左瑞麟
    Contributors: 資科系
    Keywords: convertible ring signature;hash function;privacy protection;random oracle model;reveal non-signers;ring signature
    Date: 2012.03
    Issue Date: 2014-08-07 14:42:04 (UTC+8)
    Abstract: A ring signature enables a member of a group to sign any message on behalf of the group while hiding the identity of the real signer. On the other hand, a convertible ring signature is a kind of ring signature in which the real signer can convert it into an ordinary signature. In this way, the real signer can prove the ownership of a ring signature if necessary. In this paper, we introduce a new convertible ring signature with an additional property. That is, before converting a ring signature into an ordinary signature, we allow the real signer to reveal the identity of non-signers gradually. In other words, if there are n possible signers in a ring, then, by revealing one non-signer, it will become a ring signature with n − 1 possible signers. By revealing n − 1 non-signers, then, the ring signature comes to an ordinary signature, and anyone can verify who is the real signer. This property is useful when some non-signers of a ring signature are not trusted by a verifier (i.e., the signature will not be accepted if someone is a possible signer). Rivest, Shamir, and Tauman first mentioned this problem and gave a solution as their modified ring signature scheme. However, their modified scheme can only guarantee computational anonymity. Our new scheme provides the same property on one hand and still guarantees unconditional anonymity on the other hand. The security is rigorously proved in the random oracle model according to the formal definition.
    Relation: Security and Communication Networks,5(3),279-286
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1002/sec.334
    DOI: 10.1002/sec.334
    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