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

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

ZhenFeng 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 signature scheme is proposed. Our scheme works well with standard RSA signature schemes, and the proposed optimistic fair exchange protocol is much concise and efficient, and suitable for practical applications.

اسناد مشابه

  • 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

  • An optimistic fair exchange protocol and its security in the universal composability framework

    سند علمی۲۰۰۸IJACTYusuke Okada, Yoshifumi Manabe, Tatsuaki Okamoto

    Fair exchange protocols allow both or neither of two parties to obtain the other’s items, and this property is essential in e-commerce. In this paper, we construct an optimistic fair exchange protocol that is applicable to any digital signature by prescribing three forms of signa

  • A new efficient optimistic fair exchange protocol without random oracles

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

  • A traceable optimistic fair exchange protocol in the standard model

    مقاله۲۰۱۵The ISC International Journal of Information SecurityR. Ganjavi, M. Rajabzadeh Asaar, M. Salmasizadeh

    An Optimistic Fair Exchange (OFE) protocol is a good way for two parties to exchange their digital items in a fair way such that at the end of the protocol execution, both of them receive their items or none of them receive anything. In an OFE protocol there is a semi-trusted thi

  • 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

  • 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