Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3320269.3384749acmconferencesArticle/Chapter ViewAbstractPublication Pagesasia-ccsConference Proceedingsconference-collections
research-article

OptiSwap: Fast Optimistic Fair Exchange

Published: 05 October 2020 Publication History

Abstract

Selling digital commodities securely over the Internet is a challenging task when Seller and Buyer do not trust each other. With the advent of cryptocurrencies, one prominent solution for digital exchange is to rely on a smart contract as a trusted arbiter that fairly resolves disputes when Seller and Buyer disagree. Such protocols have an optimistic mode, where the digital exchange between the parties can be completed with only minimal interaction with the smart contract. In this work we present OptiSwap, a new smart contract based fair exchange protocol that significantly improves the optimistic case of smart contract based fair exchange protocols. In particular, OptiSwap has almost no overhead in communication complexity, and improves on the computational overheads of the parties compared to prior solutions. An additional feature of OptiSwap is a protection mechanism against so-called grieving attacks, where an adversary attempts to violate the financial fairness of the protocol by forcing the honest party to pay fees. We analyze OptiSwap's security in the UC model and provide benchmark results over Ethereum.

Supplementary Material

MP4 File (3320269.3384749.mp4)
Selling digital commodities securely over the Internet is a challenging task when Seller and Buyer do not trust each other. With the advent of cryptocurrencies, one prominent solution for digital exchange is to rely on a smart contract as a trusted arbiter that fairly resolves disputes when Seller and Buyer disagree. In this work we present OptiSwap, a new smart contract based fair exchange protocol that significantly improves the optimistic execution, where both parties are honestly. In particular, OptiSwap has almost no overhead in communication complexity, and improves on the computational overheads of the parties compared to prior solutions. An additional feature of OptiSwap is a protection mechanism against so-called grieving attacks, where an adversary attempts to violate the financial fairness of the protocol by forcing the honest party to pay fees. We analyze OptiSwap?s security in the UC model and provide benchmark results over Ethereum.

References

[1]
Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski, and Lukasz Mazurek. 2014. Secure Multiparty Computations on Bitcoin. In 2014 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 443--458. https://doi.org/10.1109/SP.2014.35
[2]
N. Asokan, Victor Shoup, and Michael Waidner. 1998. Optimistic Fair Exchange of Digital Signatures (Extended Abstract). In EUROCRYPT'98 (LNCS), Kaisa Nyberg (Ed.), Vol. 1403. Springer, Heidelberg, 591--606. https://doi.org/10.1007/BFb0054156
[3]
Iddo Bentov and Ranjit Kumaresan. 2014. How to Use Bitcoin to Design Fair Protocols. In CRYPTO 2014, Part II (LNCS ), Juan A. Garay and Rosario Gennaro (Eds.), Vol. 8617. Springer, Heidelberg, 421--439. https://doi.org/10.1007/978--3--662--44381--1_24
[4]
Bitcoin Wiki. [n.d.]. Zero Knowledge Contingent Payment. https://en.bitcoin.it/wiki/. (Accessed on 09/19/2019).
[5]
Christian Cachin and Jan Camenisch. 2000. Optimistic Fair Secure Computation. In CRYPTO 2000 (LNCS ), Mihir Bellare (Ed.), Vol. 1880. Springer, Heidelberg, 93--111. https://doi.org/10.1007/3--540--44598--6_6
[6]
Matteo Campanelli, Rosario Gennaro, Steven Goldfeder, and Luca Nizzardo. 2017. Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services. In ACM CCS 17. ACM Press, 229--243. https://doi.org/10.1145/3133956.3134060
[7]
Ran Canetti, Yevgeniy Dodis, Rafael Pass, and Shabsi Walfish. 2007. Universally Composable Security with Global Setup. In TCC 2007 (LNCS), Salil P. Vadhan (Ed.), Vol. 4392. Springer, Heidelberg, 61--85. https://doi.org/10.1007/978--3--540--70936--7_4
[8]
Stefan Dziembowski, Lisa Eckey, and Sebastian Faust. 2018. FairSwap: How To Fairly Exchange Digital Goods. In ACM CCS 18. ACM Press, 967--984. https://doi.org/10.1145/3243734.3243857
[9]
Lisa Eckey, Sebastian Faust, and Benjamin Schlosser. 2019. OptiSwap: Fast Optimistic Fair Exchange. IACR Cryptology ePrint Archive, Vol. 2019 (2019), 1330. https://eprint.iacr.org/2019/1330
[10]
Oded Goldreich. 2004. Foundations of Cryptography: Basic Applications. Vol. 2. Cambridge University Press, Cambridge, UK.
[11]
Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In 19th ACM STOC, Alfred Aho (Ed.). ACM Press, 218--229. https://doi.org/10.1145/28395.28420
[12]
Mathias Hall-Andersen. 2019. FastSwap: Concretely Efficient Contingent Payments for Complex Predicates. IACR Cryptology ePrint Archive, Vol. 2019 (2019), 1296. https://eprint.iacr.org/2019/1296
[13]
Harry A. Kalodner, Steven Goldfeder, Xiaoqi Chen, S. Matthew Weinberg, and Edward W. Felten. 2018. Arbitrum: Scalable, private smart contracts. In 27th USENIX Security Symposium, USENIX Security 2018, Baltimore, MD, USA, August 15--17, 2018, William Enck and Adrienne Porter Felt (Eds.). USENIX Association, 1353--1370. https://www.usenix.org/conference/usenixsecurity18/presentation/kalodner
[14]
Aggelos Kiayias, Hong-Sheng Zhou, and Vassilis Zikas. 2016. Fair and Robust Multi-party Computation Using a Global Transaction Ledger. In EUROCRYPT 2016, Part II (LNCS ), Marc Fischlin and Jean-Sé bastien Coron (Eds.), Vol. 9666. Springer, Heidelberg, 705--734. https://doi.org/10.1007/978--3--662--49896--5_25
[15]
Ranjit Kumaresan and Iddo Bentov. 2016. Amortizing Secure Computation with Penalties. In ACM CCS 16, Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi (Eds.). ACM Press, 418--429. https://doi.org/10.1145/2976749.2978424
[16]
Ranjit Kumaresan, Vinod Vaikuntanathan, and Prashant Nalini Vasudevan. 2016. Improvements to Secure Computation with Penalties. In ACM CCS 16, Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi (Eds.). ACM Press, 406--417. https://doi.org/10.1145/2976749.2978421
[17]
Alptekin Küpccü and Anna Lysyanskaya. 2010. Usable Optimistic Fair Exchange. In CT-RSA 2010 (LNCS ), Josef Pieprzyk (Ed.), Vol. 5985. Springer, Heidelberg, 252--267. https://doi.org/10.1007/978--3--642--11925--5_18
[18]
Henning Pagnia and Felix C Gartner. 1999. On the impossibility of fair exchange without a trusted third party. Technical Report. Technical Report TUD-BS-1999-02, Darmstadt University of Technology.
[19]
Jason Teutsch and Christian Reitwießner. 2019. A scalable verification solution for blockchains. CoRR, Vol. abs/1908.04756 (2019). arxiv: 1908.04756 http://arxiv.org/abs/1908.04756
[20]
Eric Wagner, Achim Völker, Frederik Fuhrmann, Roman Matzutt, and Klaus Wehrle. 2019. Dispute Resolution for Smart Contract-based Two-Party Protocols. In IEEE International Conference on Blockchain and Cryptocurrency, ICBC 2019, Seoul, Korea (South), May 14--17, 2019. IEEE, 422--430. https://doi.org/10.1109/BLOC.2019.8751312
[21]
Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In 27th FOCS. IEEE Computer Society Press, 162--167. https://doi.org/10.1109/SFCS.1986.25

Cited By

View all
  • (2024)A Sealed-Bid Auction with Fund Binding: Preventing Maximum Bidding Price LeakageIEICE Transactions on Information and Systems10.1587/transinf.2023DAP0002E107.D:5(615-624)Online publication date: 1-May-2024
  • (2024)A Practical Data Trading Protocol for Sudoku SolutionsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.341970219(6935-6948)Online publication date: 2024
  • (2024) Fair 2 Trade: Digital Trading Platform Ensuring Exchange and Distribution Fairness IEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.3362196(1-16)Online publication date: 2024
  • Show More Cited By

Index Terms

  1. OptiSwap: Fast Optimistic Fair Exchange

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ASIA CCS '20: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security
    October 2020
    957 pages
    ISBN:9781450367509
    DOI:10.1145/3320269
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 05 October 2020

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. cryptocurrency
    2. dispute resolution
    3. e-commerce
    4. fair exchange
    5. fairness
    6. interactive
    7. optimistic
    8. smart contract

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    ASIA CCS '20
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 418 of 2,322 submissions, 18%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)93
    • Downloads (Last 6 weeks)6
    Reflects downloads up to 10 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)A Sealed-Bid Auction with Fund Binding: Preventing Maximum Bidding Price LeakageIEICE Transactions on Information and Systems10.1587/transinf.2023DAP0002E107.D:5(615-624)Online publication date: 1-May-2024
    • (2024)A Practical Data Trading Protocol for Sudoku SolutionsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.341970219(6935-6948)Online publication date: 2024
    • (2024) Fair 2 Trade: Digital Trading Platform Ensuring Exchange and Distribution Fairness IEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.3362196(1-16)Online publication date: 2024
    • (2024)Fast, Favorable, and Fair Blockchain-based Exchange of Digital Goods using State Channels2024 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)10.1109/ICBC59979.2024.10634451(279-287)Online publication date: 27-May-2024
    • (2024)SCAFT: A Scalable Crowd-Assisted Fair Trading Protocol2024 IEEE International Conference on Blockchain (Blockchain)10.1109/Blockchain62396.2024.00065(442-449)Online publication date: 19-Aug-2024
    • (2024)BBS: A secure and autonomous blockchain-based big-data sharing systemJournal of Systems Architecture10.1016/j.sysarc.2024.103133150(103133)Online publication date: May-2024
    • (2024)Blockchain-based Crowdsourcing for Human Intelligence Tasks with Dual FairnessBlockchain: Research and Applications10.1016/j.bcra.2024.100213(100213)Online publication date: Jun-2024
    • (2024)The devil is in the details: a taxonomy of red flags of fraudulent initial coin offering projectsSN Business & Economics10.1007/s43546-024-00731-54:11Online publication date: 7-Oct-2024
    • (2024)Exploring Reciprocal Exchanges and Trust-Based Authorizations: A Feasibility Demonstration with Location-Based ServicesTransactions on Large-Scale Data- and Knowledge-Centered Systems LVII10.1007/978-3-662-70140-9_2(27-67)Online publication date: 25-Oct-2024
    • (2024)Atomic Swaps for Boneh–Lynn–Shacham (BLS) Based BlockchainsComputer Security – ESORICS 202410.1007/978-3-031-70896-1_17(341-361)Online publication date: 6-Sep-2024
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media