Exclusions and related trust relationships in multi-party fair exchange protocols

نویسندگان

  • Nicolás González-Deleito
  • Olivier Markowitch
چکیده

Some electronic commerce transactions are inherently performed between more than two parties. In this context, it is thus important to determine whether the underlying fair exchange protocols allowing the secure implementation of such transactions enable participants to exclude other entities from a protocol execution. This is an important point that has not been sufficiently addressed when analysing such kind of protocols, and that may be crucial for the successful accomplishment of multi-party electronic transactions. In this paper we define the properties related to exchange protocols and exclusions, study exclusion scenarios on two wellknown multi-party fair exchange protocols and point out the implications that exclusions may have on the trust relationships between participants, and, more generally, on electronic commerce. Two new protocols more robust than existing multi-party fair exchange protocols are therefore proposed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exclusion-Freeness in Multi-party Exchange Protocols

In this paper we define a property for multi-party protocols called exclusion-freeness. In multi-party protocols respecting the strongest definition of this property, participants are sure that they will not be excluded from a protocol’s execution and, consequently, they do not have to trust each other any more. We study this property on a wellknown multi-party fair exchange protocol with an on...

متن کامل

Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation

Multi-party fair exchange (MFE) and fair secure multi-party computation (fair SMPC) are under-studied fields of research, with practical importance. We examine MFE scenarios where every participant has some item, and at the end of the protocol, either every participant receives every other participant’s item, or no participant receives anything. This is a particularly hard scenario, even though...

متن کامل

Secure Group Barter: Multi-party Fair Exchange with Semi-Trusted Neutral Parties

The recent surge in popularity of e-commerce prompted a lot of activity in the area of electronic payments. Solutions have been developed for cash, credit card and check-based electronic transactions. Much less attention has been paid to non-monetary commerce such as barter. In this paper we discuss the notion of \secure group barter" or multi-party fair exchange. We develop a classiication of ...

متن کامل

Optimizing One Fair Document Exchange Protocol

This paper presents an efficient fair document exchange protocol. The exchange of the documents will be between two parties. The protocol is based on the verifiable and recoverable encryption of a document’s key. This verifiable and recoverable encryption of the document’s key will allow one party to verify the encrypted key. It will also ensure this party that the Semi Trusted Third Party will...

متن کامل

Optimistic Fair Exchange with Multiple Arbiters

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 both of them get the desired content, or neither of them do. It is known that no twoparty protocol can guarantee fairn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Commerce Research and Applications

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2007