Usable Optimistic Fair Exchange

Küpçü, Alptekin; Lysyanskaya, Anna

doi:10.1007/978-3-642-11925-5_18

Cited by 34 publications

(41 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, it will incur much communication overhead for a blockchain network, which is a p2p network. Setting a smart contract based on that protocol will be high in terms of Gas cost [27]. From another perspective, protocol in [15] has been proposed to achieve fair exchange of digital goods.…”

Section: Digital Supply Chain (Dsc)mentioning

confidence: 99%

Towards Secure and Fair IIoT-Enabled Supply Chain Management via Blockchain-Based Smart Contracts

Alahmadi

Lin

2019

ICC 2019 - 2019 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Integrating the Industrial Internet of Things (IIoT) into supply chain management enables flexible and efficient on-demand exchange of goods between merchants and suppliers. However, realizing a fair and transparent supply chain system remains a very challenging issue due to the lack of mutual trust among the suppliers and merchants. Furthermore, the current system often lacks the ability to transmit trade information to all participants in a timely manner, which is the most important element in supply chain management for the effective supply of goods between suppliers and the merchants. This thesis presents a blockchain-based supply chain management system in the IIoT. The proposed system takes advantage of blockchain technology in terms of its transparency and tamper-proof nature to support fair goods exchange between merchants and suppliers. Additionally, the decentralization and pseudonymity property will play a significant role in preserving the privacy of participants in the blockchain. In particular, fairness in the IIoT is first defined. Then, a design for a smart contract for fair goods exchange is presented to prevent malicious behavior through imposing penalties. The proposed system was prototyped on Ethereum and experiments were conducted to demonstrate its feasibility. This is for you, Dad. Even from across the sea, I can feel your love Arriving at this stage and writing this acknowledgement was always a dream I hoped to achieve one day. In my journey towards this degree, I met many people who I have to credit for helping me to arrive at this stage, otherwise this dream would not have been achieved. I will start with an inspiration, a teacher and brother, Dr. Xiaodong Lin, who was a pillar of support and a role model for me throughout my journey. He always believed in me and gave me this opportunity. Furthermore, he has always been there at all times providing his heartfelt help and support in addition to giving me invaluable suggestions and guidance in my quest for knowledge. I shall be eternally grateful to Dr. Xiaodong Lin for his assistance. I take great pleasure extending my appreciation to my colleagues in the BBCR Group at the University of Waterloo, for all their help and support. Special thanks to Li Ming , Dongxiao Liu , Yuan Zhang and Anjia Yang whose precious friendship I will always cherish. Special thanks also go to Dr. Ilias Kotsireas and my examining committee members for the time and effort they have given, and to all my friends at Durham College, especially prof. Karl Alexander for his support. Last but not least, I would like to thank all my family who provided me with unconditional love during my academic journey here in Canada.

show abstract

Section: Digital Supply Chain (Dsc)mentioning

confidence: 99%

Towards Secure and Fair IIoT-Enabled Supply Chain Management via Blockchain-Based Smart Contracts

Alahmadi

Lin

2019

ICC 2019 - 2019 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…Optimistic Models. Starting from the early work of [15], optimistic models for fair exchange have been studied in a long sequence of works [11,12,30,33,54,57]. An optimistic model for fair two-party computation using a semi-trusted third party was studied in [20,51].…”

Section: Related Workmentioning

confidence: 99%

Fairness in an Unfair World

Choudhuri

Green

Jain

et al. 2017

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security

View full text Add to dashboard Cite

Secure multiparty computation allows mutually distrusting parties to compute a function on their private inputs such that nothing but the function output is revealed. Achieving fairness-that all parties learn the output or no one does-is a long studied problem with known impossibility results in the standard model if a majority of parties are dishonest. We present a new model for achieving fairness in MPC against dishonest majority by using public bulletin boards implemented via existing infrastructure such as blockchains or Google's certificate transparency logs. We present both theoretical and practical constructions using either witness encryption or trusted hardware (such as Intel SGX). Unlike previous works that either penalize an aborting party or achieve weaker notions such as ∆-fairness, we achieve complete fairness using existing infrastructure.

show abstract

“…Optimistic fair exchange is a very useful primitive in distributed system design with many applications including contract signing, electronic commerce, or even peer-to-peer file sharing [1,2,3,4,6,7,11,13,15,16]. In a fair exchange protocol, Alice and Bob want to exchange some items, and they want to do so fairly.…”

Section: Introductionmentioning

confidence: 99%

“…Fairness intuitively refers to Alice getting Bob's item and Bob getting Alice's item at the end of the protocol, or neither of them getting anything, even if one of them maliciously deviates from the protocol. For technical definitions of optimistic fair exchange protocols, we refer the reader to [13].…”

Section: Introductionmentioning

confidence: 99%

“…But having a single trusted entity is one of the biggest problems that make the use of such protocols hard in practice. Therefore, the use of multiple arbiters is generally motivated by reducing the trust put on the arbiter [5,13]. 1 A very natural question is how to achieve fairness in the absence of a single trusted arbiter; for example, what if we have n arbiters only a fraction of whom we want to put our trust in?…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Brief announcement

Küpçü

Lysyanskaya

2009

Proceedings of the 28th ACM Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

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 two-party protocol can guarantee fairness in general; therefore the presence of a trusted arbiter is necessary. In optimistic fair exchange, the arbiter only gets involved in case of faults, but needs to be trusted. To reduce the trust put in the arbiter, it is natural to consider employing multiple arbiters.Expensive techniques like byzantine agreement or secure multi-party computation with Ω(n 2 ) communication can be applied to distribute arbiters in a non-autonomous way. Efficient protocols can be achieved by keeping the arbiters autonomous (non-communicating). Avoine and Vaudenay [5] employ multiple autonomous arbiters in their optimistic fair exchange protocol which uses global timeout mechanisms; all arbiters have access to loosely synchronized clocks.They left two open questions regarding the use of distributed autonomous arbiters: (1) Can an optimistic fair exchange protocol without timeouts provide fairness when employing multiple autonomous arbiters? (2) Can any other optimistic fair exchange protocol with timeouts achieve better bounds on the number of honest arbiters required? In this paper, we answer both questions negatively. To answer these questions, we define a general class of optimistic fair exchange protocols with multiple arbiters, called "distributed arbiter fair exchange" (DAFE) protocols. Informally, in a DAFE protocol, if a participant fails to send a correctly formed message, the other party must contact some subset of the arbiters and get correctly formed responses from them. The arbiters do not communicate with each other, but only to Alice and Bob. We prove that no DAFE protocol can meaningfully exist.

show abstract

Usable Optimistic Fair Exchange

Cited by 34 publications

References 40 publications

Towards Secure and Fair IIoT-Enabled Supply Chain Management via Blockchain-Based Smart Contracts

Towards Secure and Fair IIoT-Enabled Supply Chain Management via Blockchain-Based Smart Contracts

Fairness in an Unfair World

Brief announcement

Contact Info

Product

Resources

About