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

    Title: Two-in-one oblivious signatures secure in the random oracle model
    Authors: 左瑞麟
    Tso, Ray-Lin
    Contributors: 資科系
    Keywords: Authentication;Cryptography;1-out-of-n signature;Oblivious signature;Oblivious transfer;Privacy protection;Schnorr signature;Network security
    Date: 2016
    Issue Date: 2017-08-31 14:49:38 (UTC+8)
    Abstract: An oblivious signature is a kind of digital signature providing privacy protection for the signature requester. According to the pioneer work introduced by Chen in 1994, it is defined in two different types; an oblivious signature with n messages and, an oblivious signature with n keys. In an oblivious signature with n messages, it allows a signature requester to get a signature on 1-out-of-n messages while during the signing process, the signer cannot find out which one of the n messages has been signed. In an oblivious signature with n keys, it allows a signature requester to get a signature signed by 1-out-of-n signers while during the signing process, no one except the requester can know who has really signed the message. In 2008, Tso et al. gave formal definitions on the models of oblivious signatures and gave an example on the construction of oblivious signatures based on the Schnorr signature. In this paper, we follow Tso et al.’s work but combine the two functionalities into one scheme. We called it Two-in-one oblivious signature. In out scheme, a signature requester can ask 1-out-of-n1 signers to sign 1- out-of-n2 messages. At the end of our protocol, no one (including the n1 possible-signers) knows who has really signed the message as well as which one of the n2 message has been signed. The scheme is useful in many applications such as e-cash, e-voting and e-auction etc. We will give a formal model on our scheme and give a rigorous security proof based on the random oracle model.
    Relation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),Volume 9955 LNCS, 2016, Pages 143-155
    10th International Conference on Network and System Security, NSS 2016; Taipei; Taiwan; 28 September 2016 到 30 September 2016; 代碼 184129
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1007/978-3-319-46298-1_10
    DOI: 10.1007/978-3-319-46298-1_10
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File SizeFormat
    155.pdf25918KbAdobe PDF264View/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