Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3319535.3354237acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
research-article

Erlay: Efficient Transaction Relay for Bitcoin

Published: 06 November 2019 Publication History
  • Get Citation Alerts
  • Abstract

    Bitcoin is a top-ranked cryptocurrency that has experienced huge growth and survived numerous attacks. The protocols making up Bitcoin must therefore accommodate the growth of the network and ensure security.
    Security of the Bitcoin network depends on connectivity between the nodes. Higher connectivity yields better security. In this paper we make two observations: (1) current connectivity in the Bitcoin network is too low for optimal security; (2) at the same time, increasing connectivity will substantially increase the bandwidth used by the transaction dissemination protocol, making it prohibitively expensive to operate a Bitcoin node. Half of the total bandwidth needed to operate a Bitcoin node is currently used to just announce transactions. Unlike block relay, transaction dissemination has received little attention in prior work.
    We propose a new transaction dissemination protocol, Erlay, that not only reduces the bandwidth consumption by 40% assuming current connectivity, but also keeps the bandwidth use almost constant as the connectivity increases. In contrast, the existing protocol increases the bandwidth consumption linearly with the number of connections. By allowing more connections at a small cost, Erlay improves the security of the Bitcoin network. And, as we demonstrate, Erlay also hardens the network against attacks that attempt to learn the origin node of a transaction. Erlay is currently being investigated by the Bitcoin community for future use with the Bitcoin protocol.

    Supplementary Material

    WEBM File (p817-naumenko.webm)

    References

    [1]
    W. Ai, L. Xinsong, and L. Kejian. 2006. Efficient flooding in peer-to-peer networks. In International Conference on Computer-Aided Industrial Design and Conceptual Design. 1--6. https://doi.org/10.1109/CAIDCD.2006.329410
    [2]
    Réka Albert and Albert-László Barabási. 2002. Statistical mechanics of complex networks. Rev. Mod. Phys., Vol. 74 (Jan 2002), 47--97. Issue 1. https://doi.org/10.1103/RevModPhys.74.47
    [3]
    Réka Albert, Hawoong Jeong, and Albert-László Barabási. 2000. Error and attack tolerance of complex networks. Nature, Vol. 406 (27 07 2000), 378 EP --. https://doi.org/10.1038/35019019
    [4]
    Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski, and Łukasz Mazurek. 2015. On the Malleability of Bitcoin Transactions. In Financial Cryptography and Data Security, Michael Brenner, Nicolas Christin, Benjamin Johnson, and Kurt Rohloff (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 1--18.
    [5]
    Alex Biryukov, Dmitry Khovratovich, and Ivan Pustogarov. 2014. Deanonymisation of Clients in Bitcoin P2P Network. In ACM SIGSAC Conference on Computer and Communications Security (CCS).
    [6]
    Joseph Bonneau. 2016. Why Buy When You Can Rent? - Bribery Attacks on Bitcoin-Style Consensus. In Financial Cryptography Workshops .
    [7]
    Anudhyan Boral and Michael Mitzenmacher. 2014. Multi-Party Set Reconciliation Using Characteristic Polynomials. CoRR, Vol. abs/1410.2645 (2014).
    [8]
    A. Broder. 1997. On the Resemblance and Containment of Documents. In Proceedings of the Compression and Complexity of Sequences 1997 (SEQUENCES '97). IEEE Computer Society, Washington, DC, USA, 21--. http://dl.acm.org/citation.cfm?id=829502.830043
    [9]
    A. Z. Broder. 1997. On the resemblance and containment of documents. In Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171). 21--29. https://doi.org/10.1109/SEQUEN.1997.666900
    [10]
    Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. 2001. Freenet: A Distributed Anonymous Information Storage and Retrieval System .Springer Berlin Heidelberg, Berlin, Heidelberg, 46--66. https://doi.org/10.1007/3--540--44702--4_4
    [11]
    Matt Corallo. 2016. BIP 152: Compact block relay. https://github.com/bitcoin/bips/blob/master/bip-0152.mediawiki.
    [12]
    corbixgwelt. 2011. Timejacking and bitcoin. http://culubas.blogspot.de/2011/05/timejacking-bitcoin802.html.
    [13]
    Alan Dearle, Graham N. C. Kirby, and Stuart J. Norcross. 2010. Hosting Byzantine Fault Tolerant Services on a Chord Ring. CoRR, Vol. abs/1006.3465 (2010).
    [14]
    C. Decker and R. Wattenhofer. 2013. Information propagation in the Bitcoin network. In IEEE P2P 2013 Proceedings. 1--10. https://doi.org/10.1109/P2P.2013.6688704
    [15]
    Christian Decker and Roger Wattenhofer. 2014. Bitcoin Transaction Malleability and MtGox. CoRR, Vol. abs/1403.6676 (2014).
    [16]
    Sergi Delgado Segura, Surya Bakshi, Cristina Pérez-Solà, James Litton, Andrew Pachulski, Andrew Miller, and Bobby Bhattacharjee. 2019. TxProbe: Discovering Bitcoin's Network Topology Using Orphan Transactions. In Financial Cryptography (FC) .
    [17]
    Yevgeniy Dodis, Leonid Reyzin, and Adam Smith. 2004. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. In Advances in Cryptology - EUROCRYPT 2004, Christian Cachin and Jan L. Camenisch (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 523--540.
    [18]
    John R. Douceur. 2002. The Sybil Attack. In International Workshop on Peer-to-Peer Systems (IPTPS).
    [19]
    Ittay Eyal, Adem Efe Gencer, Emin Gün Sirer, and Robbert Van Renesse. 2016. Bitcoin-NG: A Scalable Blockchain Protocol. In Usenix Conference on Networked Systems Design and Implementation (NSDI).
    [20]
    Ittay Eyal and Emin Gün Sirer. 2013. Majority is not Enough: Bitcoin Mining is Vulnerable. CoRR, Vol. abs/1311.0243 (2013).
    [21]
    Muntadher Fadhil, Gareth Owen, and Mo Adda. 2016. Bitcoin network measurements for simulation validation and parameterisation. In Proceedings of the Eleventh International Network Conference (INC 2016). University of Plymouth, 109--114.
    [22]
    Giulia C. Fanti, Shaileshh Bojja Venkatakrishnan, Surya Bakshi, Bradley Denby, Shruti Bhargava, Andrew Miller, and Pramod Viswanath. 2018. Dandelion
    [23]
    : Lightweight Cryptocurrency Networking with Formal Anonymity Guarantees. CoRR, Vol. abs/1805.11060 (2018). arxiv: 1805.11060 http://arxiv.org/abs/1805.11060
    [24]
    J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. 1999. An Approximate L1-Difference Algorithm for Massive Data Streams. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS '99). IEEE Computer Society, Washington, DC, USA, 501--. http://dl.acm.org/citation.cfm?id=795665.796530
    [25]
    Joan Feigenbaum, Sampath Kannan, Martin J. Strauss, and Mahesh Viswanathan. 2003. An Approximate L1-Difference Algorithm for Massive Data Streams. SIAM J. Comput., Vol. 32, 1 (Jan. 2003), 131--151. https://doi.org/10.1137/S0097539799361701
    [26]
    Amos Fiat, Jared Saia, and Maxwell Young. 2005. Making Chord Robust to Byzantine Attacks. In Proceedings of the 13th Annual European Conference on Algorithms (ESA'05). Springer-Verlag, Berlin, Heidelberg, 803--814. https://doi.org/10.1007/11561071_71
    [27]
    Juan Garay, Aggelos Kiayias, and Nikos Leonardos. 2015. The Bitcoin Backbone Protocol: Analysis and Applications. In Advances in Cryptology - EUROCRYPT 2015, Elisabeth Oswald and Marc Fischlin (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 281--310.
    [28]
    Arthur Gervais, Ghassan Karame, Karl Wüst, Vasileios Glykantzis, Hubert Ritzdorf, and Srdjan Capkun. 2016. On the Security and Performance of Proof of Work Blockchains. In Proceedings of the 23nd ACM SIGSAC Conference on Computer and Communication Security (CCS). ACM.
    [29]
    Arthur Gervais, Hubert Ritzdorf, Ghassan O. Karame, and Srdjan Capkun. 2015. Tampering with the Delivery of Blocks and Transactions in Bitcoin. In ACM SIGSAC Conference on Computer and Communications Security (CCS).
    [30]
    Matthias Grundmann, Till Neudecker, and Hannes Hartenstein. 2018. Exploiting Transaction Accumulation and Double Spends for Topology Inference in Bitcoin.
    [31]
    Ethan Heilman, Alison Kendler, Aviv Zohar, and Sharon Goldberg. 2015. Eclipse Attacks on Bitcoin's Peer-to-peer Network. In Proceedings of the 24th USENIX Conference on Security Symposium (SEC).
    [32]
    Stan Higgins. 2016. South Africa's eBay Bidorbuy Adds Bitcoin Payments. https://www.coindesk.com/south-africas-ebay-bidorbuy-adds-bitcoin-payments
    [33]
    J. Jiang, C. Hung, and J. Wu. 2010. Bandwidth- and Latency-Aware Peer-to-Peer Instant Friendcast for Online Social Networks. In 2010 IEEE 16th International Conference on Parallel and Distributed Systems. 829--834. https://doi.org/10.1109/ICPADS.2010.101
    [34]
    jl777. 2016. Re: Blocksonly mode BW savings, the limits of efficient block xfer, and better relay. https://bit.ly/2VmcgeM.
    [35]
    Benjamin Johnson, Aron Laszka, Jens Grossklags, Marie Vasek, and Tyler Moore. 2014. Game-Theoretic Analysis of DDoS Attacks Against Bitcoin Mining Pools. In Financial Cryptography and Data Security, Rainer Böhme, Michael Brenner, Tyler Moore, and Matthew Smith (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 72--86.
    [36]
    Philip Koshy, Diana Koshy, and Patrick McDaniel. 2014. An Analysis of Anonymity in Bitcoin Using P2P Network Traffic. In Financial Cryptography and Data Security, Nicolas Christin and Reihaneh Safavi-Naini (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 469--485.
    [37]
    P. Kumar, G. Sridhar, and V. Sridhar. 2005. Bandwidth and latency model for DHT based peer-to-peer networks under variable churn. In 2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05). 320--325. https://doi.org/10.1109/ICW.2005.31
    [38]
    Spiridoula V. Margariti and Vassilios V. Dimakopoulos. 2013. A study on the redundancy of flooding in unstructured p2p networks. International Journal of Parallel, Emergent and Distributed Systems, Vol. 28, 3 (2013), 214--229. https://doi.org/10.1080/17445760.2012.724067 https://doi.org/10.1109/INFCOM.2002.1019402
    [39]
    S. Vuong and J. Li. 2003. Efa: an efficient content routing algorithm in large peer-to-peer overlay networks. In Proceedings Third International Conference on Peer-to-Peer Computing (P2P). 216--217. https://doi.org/10.1109/PTP.2003.1231532

    Cited By

    View all
    • (2024)LVMT: An Efficient Authenticated Storage for BlockchainACM Transactions on Storage10.1145/366481820:3(1-34)Online publication date: 6-Jun-2024
    • (2024)Practical Rateless Set ReconciliationProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672219(595-612)Online publication date: 4-Aug-2024
    • (2024)DHBN: An Efficient Broadcast Protocol for Blockchain Networks in Highly Dynamic Heterogeneous Environment2024 IEEE Wireless Communications and Networking Conference (WCNC)10.1109/WCNC57260.2024.10570814(1-6)Online publication date: 21-Apr-2024
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
    November 2019
    2755 pages
    ISBN:9781450367479
    DOI:10.1145/3319535
    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: 06 November 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. bandwidth
    2. distributed systems
    3. gossip
    4. peer-to-peer

    Qualifiers

    • Research-article

    Funding Sources

    • Natural Sciences and Engineering Research Council

    Conference

    CCS '19
    Sponsor:

    Acceptance Rates

    CCS '19 Paper Acceptance Rate 149 of 934 submissions, 16%;
    Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

    Upcoming Conference

    CCS '24
    ACM SIGSAC Conference on Computer and Communications Security
    October 14 - 18, 2024
    Salt Lake City , UT , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)64
    • Downloads (Last 6 weeks)9
    Reflects downloads up to 11 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)LVMT: An Efficient Authenticated Storage for BlockchainACM Transactions on Storage10.1145/366481820:3(1-34)Online publication date: 6-Jun-2024
    • (2024)Practical Rateless Set ReconciliationProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672219(595-612)Online publication date: 4-Aug-2024
    • (2024)DHBN: An Efficient Broadcast Protocol for Blockchain Networks in Highly Dynamic Heterogeneous Environment2024 IEEE Wireless Communications and Networking Conference (WCNC)10.1109/WCNC57260.2024.10570814(1-6)Online publication date: 21-Apr-2024
    • (2024)Revisiting Nakamoto Consensus in Asynchronous Networks: A Comprehensive Analysis of Bitcoin Safety and Chain QualityIEEE/ACM Transactions on Networking10.1109/TNET.2023.330295532:1(844-858)Online publication date: 1-Feb-2024
    • (2024)To Squelch or not to Squelch: Enabling Improved Message Dissemination on the XRP LedgerNOMS 2024-2024 IEEE Network Operations and Management Symposium10.1109/NOMS59830.2024.10575886(1-7)Online publication date: 6-May-2024
    • (2024)A 9-dimensional Analysis of GossipSub over the XRP Ledger Consensus ProtocolNOMS 2024-2024 IEEE Network Operations and Management Symposium10.1109/NOMS59830.2024.10575688(1-7)Online publication date: 6-May-2024
    • (2024)SEAL: Secure and Efficient Authentication using Linkage for Blockchain Networks2024 27th Conference on Innovation in Clouds, Internet and Networks (ICIN)10.1109/ICIN60470.2024.10494470(114-121)Online publication date: 11-Mar-2024
    • (2024)A Compact and Accurate Sketch for Estimating a Large Range of Set Difference Cardinalities2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00110(1338-1351)Online publication date: 13-May-2024
    • (2023)Strategic Latency Reduction in Blockchain Peer-to-Peer NetworksProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35899767:2(1-33)Online publication date: 22-May-2023
    • (2023)Dynamic graph models inspired by the Bitcoin network-formation processProceedings of the 24th International Conference on Distributed Computing and Networking10.1145/3571306.3571398(125-134)Online publication date: 4-Jan-2023
    • 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