Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/11335
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAna Nunes Alonsoen
dc.contributor.authorFábio Luís Silvaen
dc.contributor.authorPereira,Jen
dc.contributor.authorOliveira,Ren
dc.contributor.other5692en
dc.contributor.other7682en
dc.date.accessioned2020-07-02T10:37:12Z-
dc.date.available2020-07-02T10:37:12Z-
dc.date.issued2020en
dc.identifier.urihttp://repositorio.inesctec.pt/handle/123456789/11335-
dc.identifier.urihttp://dx.doi.org/10.1007/978-3-030-50323-9_7en
dc.description.abstractThe performance and scalability of byzantine fault-tolerant (BFT) protocols for state machine replication (SMR) have recently come under scrutiny due to their application in the consensus mechanism of blockchain implementations. This led to a proliferation of proposals that provide different trade-offs that are not easily compared as, even if these are all based on message passing, multiple design and implementation factors besides the message exchange pattern differ between each of them. In this paper we focus on the impact of different combinations of cryptographic primitives and the message exchange pattern used to collect and disseminate votes, a key aspect for performance and scalability. By measuring this aspect in isolation and in a common framework, we characterise the design space and point out research directions for adaptive protocols that provide the best trade-off for each environment and workload combination. © IFIP International Federation for Information Processing 2020.en
dc.languageengen
dc.titleA Comparison of Message Exchange Patterns in BFT Protocols: (Experience Report)en
dc.typePublicationen
dc.typeconferenceObjecten
Appears in Collections:HASLab - Articles in International Conferences

Files in This Item:
File Description SizeFormat 
P-00S-ASX.pdf6.4 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.