Atomic and Fair Data Exchange via Blockchain
Ertem Nusret Tas, István András Seres, Yinuo Zhang, Márk Melczer, Mahimna Kelkar, Joseph Bonneau, Valeria Nikolaenko
Abstract
We introduce a blockchain Fair Data Exchange (FDE) protocol, enabling a storage server to transfer a data file to a client atomically: the client receives the file if and only if the server receives an agreed-upon payment. We put forth a new definition for a cryptographic scheme that we name verifiable encryption under committed key (VECK), and we propose two instantiations for this scheme. Our protocol relies on a blockchain to enforce the atomicity of the exchange and uses VECK to ensure that the client receives the correct data (matching an agreed-upon commitment) before releasing the payment for the decrypting key. Our protocol is trust-minimized and requires only constant-sized on-chain communication, concretely 3 signatures, 1 verification key, and 1 secret key, with most of the data stored and communicated off-chain. It also supports exchanging only a subset of the data, can amortize the server's work across multiple clients, and offers a general framework to design alternative FDE protocols using different commitment schemes. A prominent application of our protocol is the Danksharding data availability scheme on Ethereum, which commits to data via KZG polynomial commitments. We also provide an open-source implementation for our protocol with both instantiations for VECK, demonstrating our protocol's efficiency and practicality on Ethereum.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3efce950-58c0-45ad-9f61-28214bee11c7Builds on5
- FairSwap: How To Fairly Exchange Digital GoodsStefan Dziembowski, Lisa Eckey, Sebastian FaustCCS 2018 · 229 citations
- Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for ServicesMatteo Campanelli, Rosario Gennaro, Steven Goldfeder, Luca NizzardoCCS 2017 · 170 citations
- WI Is Not Enough: Zero-Knowledge Contingent (Service) Payments RevisitedGeorg FuchsbauerCCS 2019 · 37 citations
- FRIDA: Data Availability Sampling from FRIMathias Hall-Andersen, Mark Simkin, Benedikt WagnerCRYPTO 2024 · 7 citations
- LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge ProofsMatteo Campanelli, Dario Fiore, Anaïs QuerolCCS 2019 · 3 citations
Related papers
- Polynomial Commitment with a One-to-Many Prover and ApplicationsJiaheng Zhang, Tiancheng Xie, Thang Hoang, Elaine Shi et al.USENIX Security 2022
- Beyond Anonymity Sets: A Security Model for Distributed Shuffling in Adversarial EnvironmentsAdrian Cinal, Oliwer Sobolewski, Gabriel Wechta, Filip ZagórskiCCS 2026
- On the Security of KZG Commitment for VSSAtsuki Momose, Sourav Das, Ling RenCCS 2023 · 3 citations
- ZEXE: Enabling Decentralized Private ComputationSean Bowe, Alessandro Chiesa, Matthew Green, Ian Miers et al.S&P 2020 · 257 citations
- Trustless Audits without Revealing Data or ModelsSuppakit Waiwitlikhit, Ion Stoica, Yi Sun, Tatsunori Hashimoto et al.ICML 2024 · 20 citations
