research-article

SoK: Sharding on Blockchain

Authors:

Zhijie Jerry Shi,

Song HanAuthors Info & Claims

AFT '19: Proceedings of the 1st ACM Conference on Advances in Financial Technologies

Pages 41 - 61

https://doi.org/10.1145/3318041.3355457

Published: 21 October 2019 Publication History

Abstract

Blockchain is a distributed and decentralized ledger for recording transactions. It is maintained and shared among the participating nodes by utilizing cryptographic primitives. A consensus protocol ensures that all nodes agree on a unique order in which records are appended. However, current blockchain solutions are facing scalability issues. Many methods, such as Off-chain and Directed Acyclic Graph (DAG) solutions, have been proposed to address the issue. However, they have inherent drawbacks, e.g., forming parasite chains. Performance, such as throughput and latency, is also important to a blockchain system. Sharding has emerged as a good candidate that can overcome both the scalability and performance problems in blockchain. To date, there is no systematic work that analyzes the sharding protocols. To bridge this gap, this paper provides a systematic and comprehensive review on blockchain sharding techniques. We first present a general design flow of sharding protocols and then discuss key design challenges. For each challenge, we analyze and compare the techniques in state-of-the-art solutions. Finally, we discuss several potential research directions in blockchain sharding.

References

[1]

Abraham, I., Devadas, S., Dolev, D., Nayak, K., and Ren, L. Efficient synchronous byzantine consensus. arXiv preprint arXiv:1704.02397 (2017).

[2]

Al-Bassam, M., Sonnino, A., Bano, S., Hrycyszyn, D., and Danezis, G. Chainspace: A sharded smart contracts platform. arXiv preprint arXiv:1708.03778 (2017).

[3]

Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De Caro, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. Hyperledger fabric: a distributed operating system for permissioned blockchains. In Proceedings of the Thirteenth EuroSys Conference (2018), ACM, p. 30.

Digital Library

[4]

Androulaki, E., Cachin, C., De Caro, A., and Kokoris-Kogias, E. Channels: Horizontal scaling and confidentiality on permissioned blockchains. In European Symposium on Research in Computer Security (2018), Springer, pp. 111--131.

[5]

Asayag, A., Cohen, G., Grayevsky, I., Leshkowitz, M., Rottenstreich, O., Tamari, R., and Yakira, D. Helix: A scalable and fair consensus algorithm resistant to ordering manipulation.

[6]

Aspnes, J. Randomized protocols for asynchronous consensus. Distributed Computing 16, 2-3 (2003), 165--175.

Digital Library

[7]

Awerbuch, B., and Scheideler, C. Robust random number generation for peer-to-peer systems. In International Conference On Principles Of Distributed Systems (2006), Springer, pp. 275--289.

Digital Library

[8]

Awerbuch, B., and Scheideler, C. Robust random number generation for peer-to-peer systems. Theoretical Computer Science 410, 6-7 (2009), 453--466.

Digital Library

[9]

Awerbuch, B., and Scheideler, C. Towards a scalable and robust dht. Theory of Computing Systems 45, 2 (2009), 234--260.

Digital Library

[10]

Azouvi, S., McCorry, P., and Meiklejohn, S. Winning the caucus race: Continuous leader election via public randomness. arXiv preprint arXiv:1801.07965 (2018).

[11]

Babaoglu, O., and Toueg, S. Understanding non-blocking atomic commitment. Distributed systems (1993), 147--168.

Digital Library

[12]

Back, A., Corallo, M., Dashjr, L., Friedenbach, M., Maxwell, G., Miller, A., Poelstra, A., Timón, J., and Wuille, P. Enabling blockchain innovations with pegged sidechains. URL: http://www.open-sciencereview.com/papers/123/enablingblockchain-innovations-with-pegged-sidechains (2014).

[13]

Bano, S., Sonnino, A., Al-Bassam, M., Azouvi, S., McCorry, P., Meiklejohn, S., and Danezis, G. Consensus in the age of blockchains. arXiv preprint arXiv:1711.03936 (2017).

[14]

Bao, F., and Deng, R. H. A signcryption scheme with signature directly verifiable by public key. In International Workshop on Public Key Cryptography (1998), Springer, pp. 55--59.

Digital Library

[15]

Behl, J., Distler, T., and Kapitza, R. Hybrids on steroids: Sgx-based high performance bft. In Proceedings of the Twelfth European Conference on Computer Systems (2017), ACM, pp. 222--237.

Digital Library

[16]

Ben-Or, M., Kelmer, B., and Rabin, T. Asynchronous secure computations with optimal resilience. In Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing (1994), ACM, pp. 183--192.

Digital Library

[17]

Bentov, I., Pass, R., and Shi, E. Snow white: Provably secure proofs of stake. IACR Cryptology ePrint Archive 2016 (2016), 919.

[18]

Bessani, A. N., Alchieri, E. P., Correia, M., and Fraga, J. S. Depspace: a byzantine fault-tolerant coordination service. In ACM SIGOPS Operating Systems Review (2008), vol. 42, ACM, pp. 163--176.

Digital Library

[19]

Bessani, A. N., Santos, M., Felix, J., Neves, N. F., and Correia, M. On the efficiency of durable state machine replication.

[20]

Boldyreva, A. Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme. In International Workshop on Public Key Cryptography (2003), Springer, pp. 31--46.

Digital Library

[21]

Boneh, D., Bonneau, J., Bünz, B., and Fisch, B. Verifiable delay functions. In Annual International Cryptology Conference (2018), Springer, pp. 757--788.

Digital Library

[22]

Boneh, D., Bünz, B., and Fisch, B. A survey of two verifiable delay functions. IACR Cryptology ePrint Archive 2018 (2018), 712.

[23]

Boneh, D., Lynn, B., and Shacham, H. Short signatures from the weil pairing. In International Conference on the Theory and Application of Cryptology and Information Security (2001), Springer, pp. 514--532.

Digital Library

[24]

Borge, M., Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., and Ford, B. Proof-of-personhood: Redemocratizing permissionless cryptocurrencies. In 2017 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW) (2017), IEEE, pp. 23--26.

[25]

Bracha, G. An o (log n) expected rounds randomized byzantine generals protocol. Journal of the ACM (JACM) 34, 4 (1987), 910--920.

[26]

Buchman, E. Tendermint: Byzantine fault tolerance in the age of blockchains. PhD thesis, 2016.

[27]

Bünz, B., Goldfeder, S., and Bonneau, J. Proofs-of-delay and randomness beacons in ethereum. IEEE SECURITY and PRIVACY ON THE BLOCKCHAIN (IEEE S&B) (2017).

[28]

Buterin, V. Ethereum 2.0 spec--casper and sharding, 2018. Available [online].[Accessed: 30-10-2018].

[29]

Cachin, C. Yet another visit to paxos. IBM Research, Zurich, Switzerland, Tech. Rep. RZ3754 (2009).

[30]

Cachin, C., Kursawe, K., Petzold, F., and Shoup, V. Secure and efficient asynchronous broadcast protocols. In Annual International Cryptology Conference (2001), Springer, pp. 524--541.

[31]

Cachin, C., Kursawe, K., and Shoup, V. Random oracles in constantinople: Practical asynchronous byzantine agreement using cryptography. Journal of Cryptology 18, 3 (2005), 219--246.

Digital Library

[32]

Cachin, C., and Poritz, J. A. Secure intrusion-tolerant replication on the internet. In null (2002), IEEE, p. 167.

[33]

Cachin, C., and Tessaro, S. Asynchronous verifiable information dispersal. In 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05) (2005), IEEE, pp. 191--201.

Digital Library

[34]

Cachin, C., and Vukolić, M. Blockchains consensus protocols in the wild. arXiv preprint arXiv:1707.01873 (2017).

[35]

Cascudo, I., and David, B. Scrape: Scalable randomness attested by public entities. In International Conference on Applied Cryptography and Network Security (2017), Springer, pp. 537--556.

[36]

Castro, M., and Liskov, B. Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems (TOCS) 20, 4 (2002), 398--461.

[37]

Castro, M., Liskov, B., et al. Practical byzantine fault tolerance. In OSDI (1999), vol. 99, pp. 173--186.

Digital Library

[38]

Catalano, D., Gennaro, R., Howgrave-Graham, N., and Nguyen, P. Q. Paillier's cryptosystem revisited. In Proceedings of the 8th ACM conference on Computer and Communications Security (2001), ACM, pp. 206--214.

Digital Library

[39]

Chandra, T. D., Griesemer, R., and Redstone, J. Paxos made live: an engineering perspective. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (2007), ACM, pp. 398--407.

Digital Library

[40]

Chandy, K. M., and Lamport, L. Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems (TOCS) 3, 1 (1985), 63--75.

Digital Library

[41]

Chaum, D., and Pedersen, T. P. Wallet databases with observers. In Annual International Cryptology Conference (1992), Springer, pp. 89--105.

[42]

Chen, H., and Wang, Y. Sschain: A full sharding protocol for public blockchain without data migration overhead. Pervasive and Mobile Computing (2019), 101055.

[43]

Chepurnoy, A., Larangeira, M., and Ojiganov, A. Rollerchain, a blockchain with safely pruneable full blocks. arXiv preprint arXiv:1603.07926 (2016).

[44]

Chun, B.-G., Maniatis, P., Shenker, S., and Kubiatowicz, J. Attested append-only memory: Making adversaries stick to their word. In ACM SIGOPS Operating Systems Review (2007), vol. 41, ACM, pp. 189--204.

Digital Library

[45]

Churyumov, A. Byteball: A decentralized system for storage and transfer of value. URL https://byteball.org/Byteball.pdf (2016).

[46]

Clement, A., Wong, E. L., Alvisi, L., Dahlin, M., and Marchetti, M. Making byzantine fault tolerant systems tolerate byzantine faults. In NSDI (2009), vol. 9, pp. 153--168.

Digital Library

[47]

Corbett, J. C., Dean, J., Epstein, M., Fikes, A., Frost, C., Furman, J. J., Ghemawat, S., Gubarev, A., Heiser, C., Hochschild, P., et al. Spanner: GoogleâĂ&Zacute;s globally distributed database. ACM Transactions on Computer Systems (TOCS) 31, 3 (2013), 8.

[48]

Correia, M., Neves, N. F., and Verissimo, P. Bft-to: Intrusion tolerance with less replicas. The Computer Journal 56, 6 (2012), 693--715.

[49]

Corrigan-Gibbs, H., Mu, W., Boneh, D., and Ford, B. Ensuring high-quality randomness in cryptographic key generation. In Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security (2013), ACM, pp. 685--696.

Digital Library

[50]

Costan, V., and Devadas, S. Intel sgx explained. IACR Cryptology ePrint Archive 2016, 086 (2016), 1--118.

[51]

Crain, T., Gramoli, V., Larrea, M., and Raynal, M. Dbft: Efficient leaderless byzantine consensus and its application to blockchains. In 2018 IEEE 17th International Symposium on Network Computing and Applications (NCA) (2018), IEEE, pp. 1--8.

[52]

Cristian, F., Aghili, H., Strong, R., and Dolev, D. Atomic broadcast: From simple message diffusion to byzantine agreement. Information and Computation 118, 1 (1995), 158.

Digital Library

[53]

Crosby, S. A., and Wallach, D. S. Efficient data structures for tamper-evident logging. In USENIX Security Symposium (2009), pp. 317--334.

Digital Library

[54]

Daian, P., Pass, R., and Shi, E. Snow white: Robustly reconfigurable consensus and applications to provably secure proofs of stake. Tech. rep., Technical Report. Cryptology ePrint Archive, Report 2016/919, 2017.

[55]

Danezis, G., and Meiklejohn, S. Centrally banked cryptocurrencies. arXiv preprint arXiv:1505.06895 (2015).

[56]

Dang, H., Dinh, A., Chang, E.-C., and Ooi, B. C. Chain of trust: Can trusted hardware help scaling blockchains? arXiv preprint arXiv:1804.00399 (2018).

[57]

David, B., Gaži, P., Kiayias, A., and Russell, A. Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (2018), Springer, pp. 66--98.

[58]

Dinh, T. T. A., Wang, J., Chen, G., Liu, R., Ooi, B. C., and Tan, K.-L. Blockbench: A framework for analyzing private blockchains. In Proceedings of the 2017 ACM International Conference on Management of Data (2017), ACM, pp. 1085--1100.

Digital Library

[59]

Dolev, D., and Strong, H. R. Authenticated algorithms for byzantine agreement. SIAM Journal on Computing 12, 4 (1983), 656--666.

Digital Library

[60]

Douceur, J. R. The sybil attack. In International workshop on peer-to-peer systems (2002), Springer, pp. 251--260.

Digital Library

[61]

Duan, S., Reiter, M. K., and Zhang, H. Beat: Asynchronous bft made practical. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (2018), ACM, pp. 2028--2041.

Digital Library

[62]

Dwork, C., and Naor, M. Pricing via processing or combatting junk mail. In Annual International Cryptology Conference (1992), Springer, pp. 139--147.

Digital Library

[63]

Eberhardt, J., and Tai, S. On or off the blockchain? insights on off-chaining computation and data. In European Conference on Service-Oriented and Cloud Computing (2017), Springer, pp. 3--15.

[64]

Ekberg, J.-E., Kostiainen, K., and Asokan, N. The untapped potential of trusted execution environments on mobile devices. IEEE Security & Privacy 12, 4 (2014), 29--37.

[65]

Eyal, I., and Sirer, E. G. Majority is not enough: Bitcoin mining is vulnerable. Communications of the ACM 61, 7 (2018), 95--102.

Digital Library

[66]

Feldman, A. J., Zeller, W. P., Freedman, M. J., and Felten, E. W. Sporc: Group collaboration using untrusted cloud resources. In OSDI (2010), vol. 10, pp. 337--350.

Digital Library

[67]

Feldman, P. A practical scheme for non-interactive verifiable secret sharing. In 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) (1987), IEEE, pp. 427--438.

Digital Library

[68]

Fischer, M. J., Lynch, N. A., and Paterson, M. S. Impossibility of distributed consensus with one fault process. Tech. rep., YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE, 1982.

[69]

Forestier, S., and Vodenicarevic, D. Blockclique: scaling blockchains through transaction sharding in a multithreaded block graph. arXiv preprint arXiv:1803.09029 (2018).

[70]

Ganesh, A. J., Kermarrec, A.-M., and Massoulié, L. Peer-to-peer membership management for gossip-based protocols. IEEE transactions on computers 52, 2 (2003), 139--149.

Digital Library

[71]

Gencer, A. E., van Renesse, R., and Sirer, E. G. Service-oriented sharding with aspen. arXiv preprint arXiv:1611.06816 (2016).

[72]

Gilad, Y., Hemo, R., Micali, S., Vlachos, G., and Zeldovich, N. Algorand: Scaling byzantine agreements for cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles (2017), ACM, pp. 51--68.

Digital Library

[73]

Glendenning, L., Beschastnikh, I., Krishnamurthy, A., and Anderson, T. Scalable consistency in scatter. In Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles (2011), ACM, pp. 15--28.

Digital Library

[74]

Gray, J. N. Notes on data base operating systems. In Operating Systems. Springer, 1978, pp. 393--481.

[75]

Grigg, I. Eos - an introduction. https://eos.io/documents/EOS_An_Introduction.pdf.

[76]

Guerraoui, R., Knežević, N., Quéma, V., and Vukolić, M. The next 700 bft protocols. In Proceedings of the 5th European conference on Computer systems (2010), ACM, pp. 363--376.

Digital Library

[77]

Gupta, S., and Sadoghi, M. Easycommit: A non-blocking two-phase commit protocol. In Proceedings of the 21st international conference on extending database technology, Open Proceedings, EDBT (2018).

[78]

Haerder, T., and Reuter, A. Principles of transaction-oriented database recovery. ACM Computing Surveys (CSUR) 15, 4 (1983), 287--317.

[79]

Hanke, T., Movahedi, M., and Williams, D. Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548 (2018).

[80]

Hearn, M. Corda: A distributed ledger. Corda Technical White Paper (2016).

[81]

Hope-Bailie, A., and Thomas, S. Interledger: Creating a standard for payments. In Proceedings of the 25th International Conference Companion on World Wide Web (2016), International World Wide Web Conferences Steering Committee, pp. 281--282.

[82]

Kapitza, R., Behl, J., Cachin, C., Distler, T., Kuhnle, S., Moham-madi, S. V., Schröder-Preikschat, W., and Stengel, K. Cheapbft: resource-efficient byzantine fault tolerance. In Proceedings of the 7th ACM european conference on Computer Systems (2012), ACM, pp. 295--308.

Digital Library

[83]

Kate, A., Huang, Y., and Goldberg, I. Distributed key generation in the wild. IACR Cryptology ePrint Archive 2012 (2012), 377.

[84]

Kiayias, A., and Russell, A. Ouroboros-bft: A simple byzantine fault tolerant consensus protocol. IACR Cryptology ePrint Archive 2018 (2018), 1049.

[85]

Kiayias, A., Russell, A., David, B., and Oliynykov, R. Ouroboros: A provably secure proof-of-stake blockchain protocol. In Annual International Cryptology Conference (2017), Springer, pp. 357--388.

[86]

King, S., and Nadal, S. Peercoin--secure & sustainable cryptocoin. Aug-2012 [Online]. Available: https://peercoin.net/whitepaper ().

[87]

King, S., and Nadal, S. Ppcoin: Peer-to-peer cryptocurrency with proof-of-stake. self-published paper, August 19 (2012).

[88]

King, V., and Saia, J. Breaking the o (n 2) bit barrier: scalable byzantine agreement with an adaptive adversary. Journal of the ACM (JACM) 58, 4 (2011), 18.

Digital Library

[89]

King, V., Saia, J., Sanwalani, V., and Vee, E. Scalable leader election. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (2006), Society for Industrial and Applied Mathematics, pp. 990--999.

Digital Library

[90]

Kogias, E. K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., and Ford, B. Enhancing bitcoin security and performance with strong consistency via collective signing. In 25th USENIX Security Symposium (USENIX Security 16) (2016), pp. 279--296.

Digital Library

[91]

Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., Syta, E., and Ford, B. Omniledger: A secure, scale-out, decentralized ledger via sharding. In 2018 IEEE Symposium on Security and Privacy (SP) (2018), IEEE, pp. 583--598.

[92]

Krug, J., and Peterson, J. Sidecoin: a snapshot mechanism for bootstrapping a blockchain. arXiv preprint arXiv:1501.01039 (2015).

[93]

Kwon, J. Tendermint: Consensus without mining. Draft v. 0.6, fall (2014).

[94]

Lenstra, A. K., and Wesolowski, B. A random zoo: sloth, unicorn, and trx. IACR Cryptology ePrint Archive 2015 (2015), 366.

[95]

Li, J., Krohn, M. N., Mazières, D., and Shasha, D. E. Secure untrusted data repository (sundr). In OSDI (2004), vol. 4, pp. 9--9.

Digital Library

[96]

Li, S., Yu, M., Avestimehr, S., Kannan, S., and Viswanath, P. Polyshard: Coded sharding achieves linearly scaling efficiency and security simultaneously. arXiv preprint arXiv:1809.10361 (2018).

[97]

Liu, J., Li, W., Karame, G. O., and Asokan, N. Scalable byzantine consensus via hardware-assisted secret sharing. IEEE Transactions on Computers 68, 1 (2018), 139--151.

[98]

Liu, S., Viotti, P., Cachin, C., Quéma, V., and Vukolić, M. {XFT}: Practical fault tolerance beyond crashes. In 12th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 16) (2016), pp. 485--500.

[99]

Liu, Y., Wang, Y., and Jin, Y. Research on the improvement of mon-godb auto-sharding in cloud environment. In 2012 7th International Conference on Computer Science & Education (ICCSE) (2012), IEEE, pp. 851--854.

[100]

Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S., and Saxena, P. A secure sharding protocol for open blockchains. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (2016), ACM, pp. 17--30.

Digital Library

[101]

Malkhi, D., and Reiter, M. Byzantine quorum systems. In STOC (1997), vol. 97, Citeseer, pp. 569--578.

Digital Library

[102]

Malkhi, D., and Reiter, M. Byzantine quorum systems. Distributed computing 11, 4 (1998), 203--213.

[103]

Maric, O., Sprenger, C., and Basin, D. Consensus refined. In 2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2015), IEEE, pp. 391--402.

Digital Library

[104]

Maymounkov, P., and Mazieres, D. Kademlia: A peer-to-peer information system based on the xor metric. In International Workshop on Peer-to-Peer Systems (2002), Springer, pp. 53--65.

Digital Library

[105]

Micali, S., Rabin, M., and Vadhan, S. Verifiable random functions. In 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039) (1999), IEEE, pp. 120--130.

[106]

Miller, A., Xia, Y., Croman, K., Shi, E., and Song, D. The honey badger of bft protocols. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (2016), ACM, pp. 31--42.

Digital Library

[107]

Nakamoto, S. Bitcoin: A peer-to-peer electronic cash system.

[108]

Newsome, J., Shi, E., Song, D., and Perrig, A. The sybil attack in sensor networks: analysis & defenses. In Proceedings of the 3rd international symposium on Information processing in sensor networks (2004), ACM, pp. 259--268.

Digital Library

[109]

Oki, B. M., and Liskov, B. H. Viewstamped replication: A new primary copy method to support highly-available distributed systems. In Proceedings of the seventh annual ACM Symposium on Principles of distributed computing (1988), ACM, pp. 8--17.

Digital Library

[110]

Pass, R., and Shi, E. Hybrid consensus: Efficient consensus in the permissionless model. In 31st International Symposium on Distributed Computing (DISC 2017) (2017), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

[111]

Patterson, R. Alternatives for proof-of-work, part 2: Proof of activity, proof of burn, proof of capacity, and byzantines generals, bytecoin, 2015.

[112]

Pease, M., Shostak, R., and Lamport, L. Reaching agreement in the presence of faults. Journal of the ACM (JACM) 27, 2 (1980), 228--234.

[113]

Pietrzak, K. Z. Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (2019), vol. 124.

[114]

Poon, J., and Dryja, T. The bitcoin lightning network: Scalable off-chain instant payments, 2016.

[115]

Popov, S. The tangle. cit. on (2016), 131.

[116]

Rosenfeld, M. Analysis of hashrate-based double spending. arXiv preprint arXiv:1402.2009 (2014).

[117]

Schindler, P., Judmayer, A., Stifter, N., and Weippl, E. R. Hydrand: Practical continuous distributed randomness. IACR Cryptology ePrint Archive 2018 (2018), 319.

[118]

Schoenmakers, B. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In Annual International Cryptology Conference (1999), Springer, pp. 148--164.

[119]

Sen, S., and Freedman, M. J. Commensal cuckoo: Secure group partitioning for large-scale services. ACM SIGOPS Operating Systems Review 46, 1 (2012), 33--39.

Digital Library

[120]

Shamir, A. How to share a secret. Communications of the ACM 22, 11 (1979), 612--613.

Digital Library

[121]

Skeen, D. Nonblocking commit protocols. In Proceedings of the 1981 ACM SIGMOD international conference on Management of data (1981), ACM, pp. 133--142.

Digital Library

[122]

Skeen, D., and Stonebraker, M. A formal model of crash recovery in a distributed system. IEEE Transactions on Software Engineering, 3 (1983), 219--228.

Digital Library

[123]

Sousa, J., and Bessani, A. From byzantine consensus to bft state machine replication: A latency-optimal transformation. In Dependable Computing Conference (EDCC), 2012 Ninth European (2012), IEEE, pp. 37--48.

Digital Library

[124]

Stadler, M. Publicly verifiable secret sharing. In International Conference on the Theory and Applications of Cryptographic Techniques (1996), Springer, pp. 190--199.

[125]

Stathakopoulous, C., and Cachin, C. Threshold signatures for blockchain systems. Swiss Federal Institute of Technology (2017).

[126]

Swanson, T. Consensus-as-a-service: a brief report on the emergence of permissioned, distributed ledger systems. Report, available online, Apr (2015).

[127]

Syta, E., Jovanovic, P., Kogias, E. K., Gailly, N., Gasser, L., Khoffi, I., Fischer, M. J., and Ford, B. Scalable bias-resistant distributed randomness. In Security and Privacy (SP), 2017 IEEE Symposium on (2017), Ieee, pp. 444--460.

[128]

Syta, E., Tamas, I., Visher, D., Wolinsky, D. I., Jovanovic, P., Gasser, L., Gailly, N., Khoffi, I., and Ford, B. Keeping authorities" honest or bust" with decentralized witness cosigning. In Security and Privacy (SP), 2016 IEEE Symposium on (2016), Ieee, pp. 526--545.

[129]

Technology, S. https://symbiont.io/technology/.

[130]

Thomas, S., and Schwartz, E. A protocol for interledger payments. URL https://interledger.org/interledger.pdf (2015).

[131]

Van Renesse, R., Schiper, N., and Schneider, F. B. Vive la différence: Paxos vs. viewstamped replication vs. zab. IEEE Transactions on Dependable and Secure Computing 12, 4 (2015), 472--484.

Digital Library

[132]

Veronese, G. S., Correia, M., Bessani, A. N., and Lung, L. C. Ebawa: Efficient byzantine agreement for wide-area networks. In 2010 IEEE 12th International Symposium on High Assurance Systems Engineering (2010), IEEE, pp. 10--19.

Digital Library

[133]

Veronese, G. S., Correia, M., Bessani, A. N., Lung, L. C., and Verissimo, P. Efficient byzantine fault-tolerance. IEEE Transactions on Computers 62, 1 (2011), 16--30.

[134]

Vogels, W. Eventually consistent. Communications of the ACM 52, 1 (2009), 40--44.

Digital Library

[135]

Wang, G., Shi, Z., Nixon, M., and Han, S. Chainsplitter: Towards blockchain-based industrial iot architecture for supporting hierarchical storage. In 2019 IEEE International Conference on Blockchain (2019), IEEE.

[136]

Wang, G., Shi, Z. J., Nixon, M., and Han, S. Smchain: A scalable blockchain protocol for secure metering systems in distributed industrial plants. In Proceedings of the International Conference on Internet of Things Design and Implementation (2019), ACM, pp. 249--254.

Digital Library

[137]

Wang, J., and Wang, H. Monoxide: Scale out blockchains with asynchronous consensus zones. In 16th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 19) (2019), pp. 95--112.

[138]

Wang, X., Zha, X., Ni, W., Liu, R. P., Guo, Y. J., Niu, X., and Zheng, K. Survey on blockchain for internet of things. Computer Communications (2019).

[139]

Wood, G., et al. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151 (2014), 1--32.

[140]

Yin, M., Malkhi, D., Reiterand, M., Gueta, G. G., and Abraham, I. Hotstuff: Bft consensus with linearity and responsiveness. In 38th ACM symposium on Principles of Distributed Computing (PODCâĂ&Zacute;19) (2019).

Digital Library

[141]

Zamani, M., Movahedi, M., and Raykova, M. Rapidchain: scaling blockchain via full sharding. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (2018), ACM, pp. 931--948.

Digital Library

[142]

Zheng, Q., and Xu, S. Secure and efficient proof of storage with deduplication. In Proceedings of the second ACM conference on Data and Application Security and Privacy (2012), ACM, pp. 1--12.

Digital Library

[143]

Zhou, L., Schneider, F. B., and Van Renesse, R. Apss: Proactive secret sharing in asynchronous systems. ACM transactions on information and system security (TISSEC) 8, 3 (2005), 259--286.

Digital Library

Cited By

Chakraborty SChakraborty SMajumder A(2024)Scalability of Blockchain Using ShardingEnsuring Security and End-to-End Visibility Through Blockchain and Digital Twins10.4018/979-8-3693-3494-2.ch018(326-349)Online publication date: 28-Jun-2024
https://doi.org/10.4018/979-8-3693-3494-2.ch018
Kasyapa MVanmathi C(2024)Blockchain integration in healthcare: a comprehensive investigation of use cases, performance issues, and mitigation strategiesFrontiers in Digital Health10.3389/fdgth.2024.13598586Online publication date: 26-Apr-2024
https://doi.org/10.3389/fdgth.2024.1359858
Keizer NAscigil OKról MKutscher DPavlou G(2024)A Survey on Content Retrieval on the Decentralised WebACM Computing Surveys10.1145/364913256:8(1-39)Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3649132
Show More Cited By

Index Terms

SoK: Sharding on Blockchain
1. General and reference
  1. Document types
    1. Surveys and overviews
2. Security and privacy
  1. Systems security
    1. Distributed systems security

Recommendations

A Secure Sharding Protocol For Open Blockchains
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

Cryptocurrencies, such as Bitcoin and 250 similar alt-coins, embody at their core a blockchain protocol --- a mechanism for a distributed network of computational nodes to periodically agree on a set of new transactions. Designing a secure blockchain ...
GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security

Sharding is an emerging technique to overcome scalability issues on blockchain based public ledgers. Without sharding, every node in the network has to listen to and process all ledger protocol messages. The basic idea of sharding is to parallelize the ...
Poster: A Proof-of-Stake (PoS) Blockchain Protocol using Fair and Dynamic Sharding Management
CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Sharding-based consensus protocols were introduced to enable the parallelization of the consensus work and storage for blockchain systems. However, existing sharding-based consensus algorithms are not sufficiently designed for distributing miners and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

AFT '19: Proceedings of the 1st ACM Conference on Advances in Financial Technologies

October 2019

240 pages

ISBN:9781450367325

DOI:10.1145/3318041

Copyright © 2019 ACM.

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 ACM 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

ACM: Association for Computing Machinery

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 October 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

AFT '19

Sponsor:

ACM

AFT '19: 1st ACM Conference on Advances in Financial Technologies

October 21 - 23, 2019

Zurich, Switzerland

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

155
Total Citations
View Citations
2,208
Total Downloads

Downloads (Last 12 months)427
Downloads (Last 6 weeks)62

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Chakraborty SChakraborty SMajumder A(2024)Scalability of Blockchain Using ShardingEnsuring Security and End-to-End Visibility Through Blockchain and Digital Twins10.4018/979-8-3693-3494-2.ch018(326-349)Online publication date: 28-Jun-2024
https://doi.org/10.4018/979-8-3693-3494-2.ch018
Kasyapa MVanmathi C(2024)Blockchain integration in healthcare: a comprehensive investigation of use cases, performance issues, and mitigation strategiesFrontiers in Digital Health10.3389/fdgth.2024.13598586Online publication date: 26-Apr-2024
https://doi.org/10.3389/fdgth.2024.1359858
Keizer NAscigil OKról MKutscher DPavlou G(2024)A Survey on Content Retrieval on the Decentralised WebACM Computing Surveys10.1145/364913256:8(1-39)Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3649132
Camponês PDomingos HHong JPark J(2024)Dynamic Optimization of the Latency Throughput Trade-off in Parallel Chain Distributed LedgersProceedings of the 39th ACM/SIGAPP Symposium on Applied Computing10.1145/3605098.3635956(226-234)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1145/3605098.3635956
Li WZhao ZMa PXie ZPalade VLiu H(2024)Graphical Consensus-Based Sharding for Efficient and Secure Sharings in Blockchain-Enabled Internet of VehiclesIEEE Transactions on Vehicular Technology10.1109/TVT.2023.331144573:2(1991-2002)Online publication date: Feb-2024
https://doi.org/10.1109/TVT.2023.3311445
Cai TChen WZhang JZheng Z(2024)SmartChain: A Dynamic and Self-Adaptive Sharding Framework for IoT BlockchainIEEE Transactions on Services Computing10.1109/TSC.2024.337624217:2(674-688)Online publication date: Mar-2024
https://doi.org/10.1109/TSC.2024.3376242
Soltani PAshtiani F(2024)Analytical Modeling and Throughput Computation of Blockchain ShardingIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.337645235:6(983-997)Online publication date: Jun-2024
https://doi.org/10.1109/TPDS.2024.3376452
Yin BLi JShe YWei X(2024)Reducing Storage Requirement in Blockchain via Node-Oriented Block PlacementIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.328914111:1(64-76)Online publication date: Jan-2024
https://doi.org/10.1109/TNSE.2023.3289141
Chen X(2024)Scaling Byzantine Fault-Tolerant Consensus With Optimized Shading SchemeIEEE Transactions on Industrial Informatics10.1109/TII.2023.330399020:3(3401-3412)Online publication date: Mar-2024
https://doi.org/10.1109/TII.2023.3303990
Li MLuo XXue KXue YSun WLi J(2024)A Secure and Efficient Blockchain Sharding Scheme via Hybrid Consensus and Dynamic ManagementIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.340614519(5911-5924)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3406145
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents