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

    Title: Design and analysis of ";flexible";k-out-of-n signatures
    Authors: Tso, Ray-Lin;Yi, X.;Ito, T.;Okamoto, T.;Okamoto, E.
    Contributors: 資科系
    Keywords: Design and analysis;Discrete logarithm problems;DL problem;Electronic Negotiations;Extra computations;K-out-of-n;One way hash functions;Random Oracle model;Ring signatures;Threshold ring signatures;threshold-flexibility;Algebra;Hash functions;Network security;Authentication
    Date: 2010
    Issue Date: 2015-04-17 16:49:27 (UTC+8)
    Abstract: This paper presents a new kind of (k,n)-threshold ring signature ((k,n)-ring signature) which is just a combination of k (1,n)-ring signatures. Our construction guarantees that a single signer can close at most one ring so the result of the combination is the required (k,n)-ring signature. This construction is useful in, for example, electronic negotiations or games where gradual revelation on how many people signed a given document is required. It also provides flexibility of the threshold k. The threshold-flexibility means that, in our scheme, we can change a (k,n)-ring signature into a (k′,n)-ring signature for any k′ ≤ n without revoking the original (k,n)-ring signature. This is useful for signers to withdraw their signatures afterward and/or is useful for new signers to add their (partial of the ring) signatures into the original ring signature. In addition, when k′ < k, this modification requires no extra computation. The security of the proposed scheme is proved in the random oracle model based on the hardness of the discrete logarithm problem and the intractability of inverting cryptographic one-way hash functions. © 2010 Springer-Verlag.
    Relation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1007/978-3-642-16576-4_19
    DOI: 10.1007/978-3-642-16576-4_19
    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