Utilize este identificador para referenciar este registo: http://hdl.handle.net/10451/14261
Título: Minimal Byzantine Fault Tolerance
Autor: Veronese, Giuliana Santos
Correia, Miguel
Lung, Lau Cheuk
Bessani, Alysson Neves
Palavras-chave: Byzantine Fault-Tolerance
Trusted Platform Module
Distributed Algorithms
Data: Dez-2008
Editora: Department of Informatics, University of Lisbon
Relatório da Série N.º: di-fcul-tr-08-29
Resumo: This paper presents two Byzantine fault-tolerant state machine replication (BFT) algorithms that are minimal in several senses. First, they require only 2 f +1 replicas, instead of the usual 3 f +1. Second, the trusted service in which this reduction of replicas is based is arguably minimal: it provides an interface with a single function and is composed only by a counter and a signature generation primitive. Third, in nice executions the two algorithms run in the minimum number of communication steps for non-speculative and speculative algorithms, respectively 4 and 3 steps. The paper is also the first to present BFT algorithms with 2 f +1 replicas that require a trusted service implementable using commercial off-the-shelf trusted hardware: this service can be implemented with the Trusted Platform Module currently available as a chip in the mainboard of many commodity PCs
Descrição: This technical report was superseded by report DI-TR-09-15
URI: http://hdl.handle.net/10451/14261
Aparece nas colecções:FC-DI - Technical Reports

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
08-29.pdf1,4 MBAdobe PDFVer/Abrir

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.