The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing
Open accessAbstract
The surging interest in blockchain technology has revitalized the search for effective Byzantine consensus schemes. In particular, the blockchain community has been looking for ways to effectively integrate traditional Byzantine fault-tolerant (BFT) protocols into a blockchain consensus layer allowing various financial institutions to securely agree on the order of transactions. However, existing BFT protocols can only scale to tens of nodes due to their$O(n^2)$message complexity. In this paper, we propose FastBFT, a fast and scalable BFT protocol. At the heart of FastBFT is a novel message aggregation technique that combines hardware-based trusted execution environments (TEEs) with lightweight secret sharing. Combining this technique with several other optimizations (i.e., optimistic execution, tree topology and failure detection), FastBFT achieves low latency and high throughput even for large scale networks. Via systematic analysis and experiments, we demonstrate that FastBFT has better scalability and performance than previous BFT protocols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Vukolić, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-39028-4_9 · Cited by 1,051 · cited 1×
“(E.g., Bitcoin, Litecoin, DogeCoin, Ethereum) However, Bitcoin’s PoW has been severely criticized for its considerable waste of energy and meagre transaction throughput (∼7 transactions per second) [10].”
BackgroundThe Untapped Potential of Trusted Execution Environments on Mobile Devices
Ekberg, J.-E., Kostiainen, K., & Asokan, N. (2014) · IEEE Security & Privacy · doi:10.1109/msp.2014.38 · Cited by 93
Self-citation
Cited by
Blockchain Meets Cloud Computing: A Survey
Gai, K., Guo, J., Zhu, L., & Yu, S. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2989392 · Cited by 381
SBFT: A Scalable and Decentralized Trust Infrastructure
Golan Gueta, G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M., Seredinschi, D.-A., Tamir, O., & Tomescu, A. (2019) · 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) · doi:10.1109/dsn.2019.00063 · Cited by 362
Systematic Literature Review of Challenges in Blockchain Scalability
Khan, D., Jung, L. T., & Hashmani, M. A. (2021) · Applied Sciences · doi:10.3390/app11209372 · Cited by 338
Exploring the Attack Surface of Blockchain: A Comprehensive Survey
Saad, M., Spaulding, J., Njilla, L., Kamhoua, C., Shetty, S., Nyang, D., & Mohaisen, D. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2975999 · Cited by 337
A systematic review of blockchain scalability: Issues, solutions, analysis and future research
Sanka, A. I., & Cheung, R. C. C. (2021) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2021.103232 · Cited by 283
Metadata
- Authors
- Liu, J., Li, W., Karame, G. O., & Asokan, N.
- Venue
- IEEE Transactions on Computers
- Published
- 2019-01-01
- Volume
- 68
- Issue
- 1
- Pages
- 139-151
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W2584120063
- Cited by
- 185
- References
- 3
- FWCI
- 9.96
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing. https://app.cochat.ai/papers/10.1109/tc.2018.2860009
- The paper
- Liu, J., Li, W., Karame, G. O., & Asokan, N. (2019). Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing. IEEE Transactions on Computers. https://doi.org/10.1109/tc.2018.2860009
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.