سند علمی

Optimistic Fair Exchange of Ring Signatures

چکیده

An optimistic fair exchange (OFE) protocol is an effective tool helping two parties exchange their digital items in an equitable way with assistance of a trusted third party, called arbitrator, who is only required if needed. In previous studies, fair exchange is usually carried out between individual parties. When fair exchange is carried our between two members from distinct groups, anonymity of the signer in a group could be necessary for achieving better privacy. In this paper, we consider optimistic fair exchange of ring signatures (OFERS), i.e. two members from two different groups can exchange their ring signatures in a fair way with ambiguous signers. Each user in these groups has its own public-private key pair and is able to sign a message on behalf of its own group anonymously. We first define the security model of OFFERS in the multi-user setting under adaptive chosen message, chosen-key and chosen public-key attacks. Then, based on verifiable encrypted ring signatures (VERS) we construct a concrete scheme by combining the technologies of ring signatures, publickey encryption and proof of knowledge. Finally, we show that our OFERS solution is provably secure in our security model, and preserving signer-ambiguity of ring signatures. To the best of our knowledge, this is the first (formal) work on this topic.

اسناد مشابه

  • Optimistic Fair Exchange of Digital Signatures Optimistic Fair Exchange of Digital Signatures

    سند علمی۱۹۹۷N. Asokan, Victor Shoup, Michael Waidner

    LIMITED DISTRIBUTION NOTICE This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents and will be distributed outside of IBM up to one

  • POFE: Privacy-Preserving Optimistic Fair Exchange of Digital Signatures

    سند علمی۲۰۱۳Qiong Huang, Duncan S. Wong, Willy Susilo

    How to sign an electronic contract online between two parties (say Alice and Bob) in a fair manner is an interesting problem, and has been studied for a long time. Optimistic Fair Exchange (OFE) is an efficient solution to this problem, in which a semi-trusted third party named a

  • The Construction of Ambiguous Optimistic Fair Exchange from Designated Confirmer Signature without Random Oracles

    سند علمی۲۰۱۲Inf. Sci.Qiong Huang, Duncan S. Wong, Willy Susilo

    Ambiguous Optimistic Fair Exchange (AOFE), introduced by Huang et al. in ASIACRYPT 2008, is an extension of OFE that enhances the fairness of the two communicating parties in the exchange of signatures. The first scheme was proven secure without random oracles while its partial s

  • P2OFE: Privacy-Preserving Optimistic Fair Exchange of Digital Signatures

    سند علمی۲۰۱۴CT-RSAQiong Huang, Duncan S. Wong, Willy Susilo

    How to sign an electronic contract online between two parties (say Alice and Bob) in a fair manner is an interesting problem, and has been studied for a long time. Optimistic Fair Exchange (OFE) is an efficient solution to this problem, in which a semi-trusted third party named a

  • Constructing Optimistic Fair Exchange Protocols from Committed Signatures

    سند علمی۲۰۰۳IACR Cryptology ePrint ArchiveHuafei Zhu

    In PODC 2003, Park et al. [32] first introduce a connection between fair exchange and sequential two-party multi-signature scheme and provide a novel method of constructing fair exchange protocol by distributing the computation of RSA signature. This approach avoids the design of

  • Optimistic Fair Exchange in a Multi-user Setting

    سند علمی۲۰۰۷IACR Cryptology ePrint ArchiveYevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum

    This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-user setting guarantees the security in a multi-user setting, we show that the situation is different in