Scalable Byzantine Consensus via Hardware-assisted Secret Sharing

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.author Liu, Jian
dc.contributor.author Li, Wenting
dc.contributor.author Karame, G.
dc.contributor.author Asokan, N.
dc.date.accessioned 2018-08-21T13:43:06Z
dc.date.available 2018-08-21T13:43:06Z
dc.date.issued 2019-01-01
dc.identifier.citation Liu , J , Li , W , Karame , G & Asokan , N 2018 , ' Scalable Byzantine Consensus via Hardware-assisted Secret Sharing ' IEEE Transactions on Computers . DOI: 10.1109/TC.2018.2860009 en
dc.identifier.issn 0018-9340
dc.identifier.issn 1557-9956
dc.identifier.other PURE UUID: 1ece9004-c899-451c-b015-4e3d9fd7ada1
dc.identifier.other PURE ITEMURL: https://research.aalto.fi/en/publications/scalable-byzantine-consensus-via-hardwareassisted-secret-sharing(1ece9004-c899-451c-b015-4e3d9fd7ada1).html
dc.identifier.other PURE LINK: http://www.scopus.com/inward/record.url?scp=85050642141&partnerID=8YFLogxK
dc.identifier.other PURE FILEURL: https://research.aalto.fi/files/27289803/SCI_Liu_Scalable_bare_IEEE.pdf
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/33464
dc.description.abstract 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(n2) 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. en
dc.format.mimetype application/pdf
dc.language.iso en en
dc.relation.ispartofseries IEEE Transactions on Computers en
dc.rights openAccess en
dc.subject.other Software en
dc.subject.other Theoretical Computer Science en
dc.subject.other Hardware and Architecture en
dc.subject.other Computational Theory and Mathematics en
dc.subject.other 113 Computer and information sciences en
dc.title Scalable Byzantine Consensus via Hardware-assisted Secret Sharing en
dc.type A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä fi
dc.description.version Peer reviewed en
dc.contributor.department Department of Computer Science
dc.contributor.department NEC Corporation
dc.subject.keyword Bitcoin
dc.subject.keyword Blockchain
dc.subject.keyword Byzantine fault-tolerance
dc.subject.keyword distributed systems
dc.subject.keyword Fault tolerance
dc.subject.keyword Fault tolerant systems
dc.subject.keyword Protocols
dc.subject.keyword Silicon
dc.subject.keyword state machine replication
dc.subject.keyword trusted component
dc.subject.keyword Software
dc.subject.keyword Theoretical Computer Science
dc.subject.keyword Hardware and Architecture
dc.subject.keyword Computational Theory and Mathematics
dc.subject.keyword 113 Computer and information sciences
dc.identifier.urn URN:NBN:fi:aalto-201808214597
dc.identifier.doi 10.1109/TC.2018.2860009
dc.type.version acceptedVersion


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search archive


Advanced Search

article-iconSubmit a publication

Browse

My Account