The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding
Open accessAbstract
Designing a secure permissionless distributed ledger (blockchain) that performs on par with centralized payment processors, such as Visa, is a challenging task. Most existing distributed ledgers are unable to scale-out, i.e., to grow their total processing capacity with the number of validators; and those that do, compromise security or decentralization. We present OmniLedger, a novel scale-out distributed ledger that preserves longterm security under permissionless operation. It ensures security and correctness by using a bias-resistant public-randomness protocol for choosing large, statistically representative shards that process transactions, and by introducing an efficient cross-shard commit protocol that atomically handles transactions affecting multiple shards. OmniLedger also optimizes performance via parallel intra-shard transaction processing, ledger pruning via collectively-signed state blocks, and low-latency "trust-but-verify" validation for low-value transactions. An evaluation of our experimental prototype shows that OmniLedger's throughput scales linearly in the number of active validators, supporting Visa-level workloads and beyond, while confirming typical transactions in under two seconds.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bitcoin: A Peer-to-Peer Electronic Cash System
Wright, C. S. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.3440802 · Cited by 13,922
(2013) · Cited by 5,372
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
Kiayias, A., Russell, A., David, B., & Oliynykov, R. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63688-7_12 · Cited by 1,459
A Secure Sharding Protocol For Open Blockchains
Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S., & Saxena, P. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978389 · Cited by 1,428
On Scaling Decentralized Blockchains: (A Position Paper)
Croman, K., Decker, C., Eyal, I., Gencer, A. E., Juels, A., Kosba, A., Miller, A., Saxena, P., Shi, E., Gün Sirer, E., et al. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53357-4_8 · Cited by 1,165
Tendermint: Byzantine Fault Tolerance in the Age of Blockchains
Buchman, E. (2016) · The Atrium (University of Guelph) · Cited by 851
Spanner: Google’s Globally Distributed Database
Corbett, J. C., Dean, J., Epstein, M., Fikes, A., Frost, C., Furman, J. J., Ghemawat, S., Gubarev, A., Heiser, C., Hochschild, P., et al. (2013) · ACM Transactions on Computer Systems · doi:10.1145/2491245 · Cited by 729
Micali, S., Rabin, M., & Vadhan, S. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814584 · Cited by 716
Analysis of the Blockchain Protocol in Asynchronous Networks
Pass, R., Seeman, L., & Shelat, A. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-56614-6_22 · Cited by 613
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting
Schoenmakers, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_10 · Cited by 448
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography
Cachin, C., Kursawe, K., & Shoup, V. (2005) · Journal of Cryptology · doi:10.1007/s00145-005-0318-0 · Cited by 437
Practical Byzantine fault tolerance
de Castro, O. T., & Miguel, M. D. (2000) · Cited by 372
Chainspace: A Sharded Smart Contracts Platform
Al-Bassam, M., Sonnino, A., Bano, S., Hrycyszyn, D., & Danezis, G. (2018) · Proceedings 2018 Network and Distributed System Security Symposium · doi:10.14722/ndss.2018.23241 · Cited by 359
The performance of consistent checkpointing
Elnozahy, E. N. M., Johnson, D. B., & Zwaenepoel, W. (2003) · Proceedings/Proceedings - Symposium on Reliable Distributed Systems · doi:10.1109/reldis.1992.235144 · Cited by 356
Corbett, J. C., Hochschild, P., Hsieh, W. C., Kanthak, S., Kogan, E., Li, H., Lloyd, A., Melnik, S., Mwaura, D., Nagle, D. F., et al. (2013) · ACM Transactions on Computer Systems · doi:10.1145/2518037.2491245 · Cited by 331
Is Bitcoin a Decentralized Currency?
Gervais, A., Karame, G. O., Capkun, V., & Capkun, S. (2014) · IEEE Security & Privacy · doi:10.1109/msp.2014.49 · Cited by 325
Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing
Kokoris-Kogias, E., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., & Ford, B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.06997 · Cited by 309
Self-citationInclusive Block Chain Protocols
Lewenberg, Y., Sompolinsky, Y., & Zohar, A. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-47854-7_33 · Cited by 308
Centrally Banked Cryptocurrencies
Danezis, G., & Meiklejohn, S. (2016) · Proceedings 2016 Network and Distributed System Security Symposium · doi:10.14722/ndss.2016.23187 · Cited by 300
Scalable Bias-Resistant Distributed Randomness
Syta, E., Jovanovic, P., Kogias, E. K., Gailly, N., Gasser, L., Khoffi, I., Fischer, M. J., & Ford, B. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.45 · Cited by 290
Self-citationKeeping Authorities "Honest or Bust" with Decentralized Witness Cosigning
Syta, E., Tamas, I., Visher, D., Wolinsky, D. I., Jovanovic, P., Gasser, L., Gailly, N., Khoffi, I., & Ford, B. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.38 · Cited by 244
Self-citationHybrid Consensus: Efficient Consensus in the Permissionless Model
Pass, R., & Shi, E. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.disc.2017.39 · Cited by 234
Tampering with the Delivery of Blocks and Transactions in Bitcoin
Gervais, A., Ritzdorf, H., Karame, G. O., & Capkun, S. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813655 · Cited by 229
On Bitcoin as a public randomness source.Preprint
Bonneau, J., Clark, J., & Goldfeder, S. (2015) · IACR Cryptology ePrint Archive · Cited by 204
Donovan, A., & Kernighan, B. W. (2015) · CERN Document Server (European Organization for Nuclear Research) · Cited by 201
Algorand: Scaling Byzantine Agreements for Cryptocurrencies.Preprint
Gilad, Y., Hemo, R., Micali, S. M., Vlachos, G., & Zeldovich, N. (2017) · IACR Cryptology ePrint Archive · Cited by 185
Proof-of-Personhood: Redemocratizing Permissionless Cryptocurrencies
Borge, M., Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., & Ford, B. (2017) · 2017 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW) · doi:10.1109/eurospw.2017.46 · Cited by 89
Self-citationNikitin, K., Kokoris-Kogias, E., Jovanovic, P., Gailly, N., Gasser, L., Khoffi, I., Cappos, J., & Ford, B. (2017) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 71
Self-citationSolidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus.Preprint
Abraham, I., Malkhi, D., Nayak, K., Ren, L., & Spiegelman, A. (2016) · arXiv (Cornell University) · Cited by 67
Cited by
RapidChain: Scaling Blockchain via Full Sharding
Zamani, M., Movahedi, M., & Raykova, M. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243853 · Cited by 1,121
A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks
Wang, W., Hoang, D. T., Hu, P., Xiong, Z., Niyato, D., Wang, P., Wen, Y., & Kim, D. I. (2019) · IEEE Access · doi:10.1109/access.2019.2896108 · Cited by 995
A Survey of Blockchain Technology Applied to Smart Cities: Research Issues and Challenges
Xie, J., Tang, H., Huang, T., Yu, F. R., Xie, R., Liu, J., & Liu, Y. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2899617 · Cited by 764
A Survey on Blockchain Interoperability: Past, Present, and Future Trends
Belchior, R., Vasconcelos, A., Guerreiro, S., & Correia, M. (2022) · ACM Computing Surveys · doi:10.1145/3471140 · Cited by 757
Solutions to scalability of blockchain: a survey
Zhou, Q., Huang, H., Zheng, Z., & Bian, J. (2020) · IEEE Access · doi:10.1109/access.2020.2967218 · Cited by 689
Metadata
- Authors
- Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., Syta, E., & Ford, B.
- Venue
- 2018 IEEE Symposium on Security and Privacy (SP)
- Publisher
- IEEE
- Published
- 2018-05
- Pages
- 583-598
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2794533297
- Cited by
- 1,253
- References
- 34
- FWCI
- 92.48
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.