ویراساینس.
سند علمی

Optimistic Fair Exchange in a Multi-user Setting

Yevgeniy 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 the optimistic fair exchange. First, we show how to break, in the multi-user setting, an optimistic fair exchange scheme provably secure in the single-user setting. This example separates the security of optimistic fair exchange between the single-user setting and the multi-user setting. We then define the formal security model of optimistic fair exchange in the multi-user setting, which is the first complete security model of optimistic fair exchange in the multi-user setting. We prove the existence of a generic construction meeting our multi-user security based on one-way functions in the random oracle model and trapdoor one-way permutations in the standard model. Finally, we revisit two well-known methodologies of optimistic fair exchange, which are based on the verifiably encrypted signature and the sequential two-party multisignature, respectively. Our result shows that these paradigms remain valid in the multi-user setting.

اسناد مشابه

  • Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles

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

    Optimistic fair exchange is a kind of protocols to solve the problem of fair exchange between two parties. Almost all the previous work on this topic are provably secure only in the random oracle model. In PKC 2007, Dodis et al. considered optimistic fair exchange in a multiuser

  • Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting

    سند علمی۲۰۱۰Public Key CryptographyXinyi Huang, Yi Mu, Willy Susilo, Wei Wu

    Recent research has shown that the single-user security of optimistic fair exchange cannot guarantee the multi-user security. This paper investigates the conditions under which the security of optimistic fair exchange in the single-user setting is preserved in the multi-user sett

  • Optimistic Fair Exchange with Multiple Arbiters

    سند علمی۲۰۰۹IACR Cryptology ePrint ArchiveAlptekin Küpçü, Anna Lysyanskaya

    Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchange protocol would guarantee that, even if one of them maliciously deviates from the protocol, either b

  • Optimistic fair exchange in the enhanced chosen-key model

    سند علمی۲۰۱۵Theor. Comput. Sci.Yang Wang, Man Ho Au, Willy Susilo

    Optimistic fair exchange (OFE) is a kind of protocol to guarantee fairness for the parties involved in an exchange with the help of an arbitrator. A fundamental work of optimistic fair exchange is to define security models capturing realistic attacks and design schemes secure in

  • Optimistic Fair Exchange of Ring Signatures

    سند علمی۲۰۱۱SecureCommLie Qu, Guilin Wang, Yi Mu

    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

  • Usable Optimistic Fair Exchange

    سند علمی۲۰۰۸CT-RSAAlptekin Küpçü, Anna Lysyanskaya

    Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be done without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can