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

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

Qiong 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 setting, and showed that the security of an optimistic fair exchange in a single-user setting may no longer be secure in a multi-user setting. Besides, they also proposed one and reviewed several previous construction paradigms and showed that they are secure in the multi-user setting. However, their proofs are either in the random oracle model, or involving a complex and very inefficient NP-reduction. Furthermore, they only considered schemes in the certified-key model in which each user has to show his knowledge of the private key corresponding to his public key. In this paper, we make the following contributions. First, we consider a relaxed model called chosen-key model in the context of optimistic fair exchange, in which the adversary can arbitrarily choose public keys without showing the knowledge of the private keys. We separate the security of optimistic fair exchange in the chosen-key model from the certified-key model by giving a concrete counterexample. Second, we strengthen the previous static security model in the multi-user setting to a more practical one which allows an adversary to choose a key adaptively. Third, we propose an efficient and generic optimistic fair exchange scheme in the multi-user setting and chosen-key model. The security of our construction is proven without random oracles. We also propose some efficient

اسناد مشابه

  • A new efficient optimistic fair exchange protocol without random oracles

    مقاله‌ی دسترسی آزاد۲۰۱۱International Journal of Information SecurityQiongHuang, GuominYang, Duncan S.Wong, WillySusilo

  • 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

  • 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 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

  • Efficient and Optimistic Fair Exchanges Based on Standard RSA with Provable Security

    سند علمی۲۰۰۴IACR Cryptology ePrint ArchiveZhenFeng ZHANG, YongBin ZHOU, DengGuo FENG

    In this paper, we introduce a new and natural paradigm for fair exchange protocols, called verifiable probabilistic signature scheme. A security model with precise and formal definitions is presented, and an RSA-based efficient and provably secure verifiable probabilistic signatu

  • Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements

    سند علمی۲۰۰۰EUROCRYPTMihir Bellare, Alexandra Boldyreva, Silvio Micali

    This paper addresses the security of public-key cryptosystems in a \multi-user" setting, namely in the presence of attacks involving the encryption of related messages under di erent public keys, as exempli ed by H astad's classical attacks on RSA. We prove that security in the s