Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

FairRelay: Fair and Cost-Efficient Peer-to-Peer Content Delivery through Payment Channel Networks (2405.02973v1)

Published 5 May 2024 in cs.CR

Abstract: Peer-to-Peer (P2P) content delivery, known for scalability and resilience, offers a decentralized alternative to traditional centralized Content Delivery Networks (CDNs). A significant challenge in P2P content delivery remains: the fair compensation of relayers for their bandwidth contributions. Existing solutions employ blockchains for payment settlements, however, they are not practical due to high on-chain costs and over-simplified network assumptions. In this paper, we introduce FairRelay, a fair and cost-efficient protocol that ensures all participants get fair payoff in complex content delivery network settings. We introduce a novel primitive, Enforceable Accumulative Hashed TimeLock Contract (Enforceable A-HTLC), designed to guarantee payment atomicity - ensuring all participants receive their payments upon successful content delivery. The fairness of FairRelay is proved using the Universal Composability (UC) framework. Our evaluation demonstrates that, in optimistic scenarios, FairRelay employs zero on-chain costs. In pessimistic scenarios, the on-chain dispute costs for relayers and customers are constant, irrespective of the network complexity. Specifically, empirical results indicate that the on-chain dispute costs for relayers and customers are 24,902 gas (equivalent to 0.01 USD on Optimism L2) and 290,797 gas (0.07 USD), respectively. In a 10-hop relay path, FairRelay introduces less than 1.5% additional overhead compared to pure data transmission, showcasing the efficiency of FairRelay.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. Survey on peer-assisted content delivery networks. Computer Networks (CN).
  2. Thora: Atomic and Privacy-Preserving Multi-Channel Updates. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (CCS).
  3. Blitz: Secure Multi-Hop Payments Without Two-Phase Commits. In Proceedings of 30th USENIX Security Symposium (USENIX Security).
  4. Circom: A Circuit Description Language for Building Zero-Knowledge Applications. IEEE Transactions on Dependable and Secure Computing (TDSC).
  5. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In Proceedings of the 3rd innovations in theoretical computer science conference (ITCS).
  6. The Wonderful World of Global Random Oracles. Cryptology ePrint Archive.
  7. Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (CCS).
  8. R. Canetti. 2001. Universally composable security: a new paradigm for cryptographic protocols. In Proceedings 42nd IEEE Symposium on Foundations of Computer Science (FOCS).
  9. Ran Canetti. 2004. Universally composable signature, certification, and authentication. In Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004. (CSFW).
  10. Ciminion: symmetric encryption based on toffoli-gates over large finite fields. In Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT).
  11. FairSwap: How To Fairly Exchange Digital Goods. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS).
  12. General State Channel Networks. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS).
  13. OptiSwap: Fast Optimistic Fair Exchange. In Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (Asia CCS).
  14. Atomic Multi-Channel Updates with Constant Collateral in Bitcoin-Compatible Payment-Channel Networks. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS).
  15. Jens Groth. 2016. On the size of pairing-based non-interactive arguments. In Proceedings of 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II 35 (EUROCRYPT).
  16. Fair Peer-to-Peer Content Delivery via Blockchain. In Proceedings of Computer Security (ESORICS).
  17. Blockchain-Based P2P Content Delivery With Monetary Incentivization and Fairness Guarantee. IEEE Transactions on Parallel and Distributed Systems (TPDS).
  18. Using redundancy to cope with failures in a delay tolerant network. In Proceedings of the 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM).
  19. FileBounty: Fair Data Exchange. In Proceedings of IEEE European Symposium on Security and Privacy Workshops (EuroS&P).
  20. Universally composable synchronous computation. In Proceedings of Theory of Cryptography Conference (TCC).
  21. Bittorrent is an auction: analyzing and improving bittorrent’s incentives. ACM SIGCOMM Computer Communication Review.
  22. Robin Linus. 2023. BitStream: Decentralized File Hosting Incentivised via Bitcoin Payments. https://robinlinus.com/bitstream.pdf
  23. Yunqi Ma and Satoshi Fujita. 2023. Decentralized Incentive Scheme for Peer-to-Peer Video Streaming using Solana Blockchain. Transactions on Information and Systems (IEICE).
  24. Concurrency and Privacy with Payment-Channel Networks. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (CCS).
  25. Anonymous Multi-Hop Locks for Blockchain Scalability and Interoperability. In Proceedings of 2019 Network and Distributed System Security Symposium (NDSS).
  26. meson.network. 2024. Meson Network. https://docs.meson.network/nodes/
  27. Sprites and State Channels: Payment Networks that Go Faster Than Lightning. In Proceedings of Financial Cryptography and Data Security (FC).
  28. Floodgate: A Micropayment Incentivized P2P Content Delivery Network. In Proceedings of 17th International Conference on Computer Communications and Networks (CCN).
  29. Goldreich Oded. 2009. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press.
  30. Optimism Team. 2024. Optimism Documentation. https://docs.optimism.io/
  31. Resilient peer-to-peer streaming. In Proceedings of 11th IEEE International Conference on Network Protocols (ICNP).
  32. Lum Ramabaja and Arber Avdullahu. 2020. Compact Merkle Multiproofs. arXiv:2002.07648
  33. Roman Storm Roman Semenov, Alexey Pertsev. 2019. Tornado Cash. https://github.com/tornadocash/tornado-core
  34. Atomic and Fair Data Exchange via Blockchain. Cryptology ePrint Archive.
  35. Saturn Team. 2024. Saturn Aliens Project. https://saturn.tech/
  36. Content Delivery Networks: State of the Art, Trends, and Future Roadmap. Comput. Surveys.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets