Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Seyed Vahid Mohammadi

dblp:56/11191 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Network and information security
1 paper
Systems and software security · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance
byzantine fault tolerance
0.112012
CheapBFT: resource-efficient byzantine fault tolerance · EuroSys 2012
Distributed systems
consensus
0.112012
CheapBFT: resource-efficient byzantine fault tolerance · EuroSys 2012
Distributed systems
fault tolerance
0.112012
CheapBFT: resource-efficient byzantine fault tolerance · EuroSys 2012
Systems and software security › trusted computing
trusted computing base
0.012012
CheapBFT: resource-efficient byzantine fault tolerance · EuroSys 2012

Methods — techniques the papers use, named apart from their topics

trusted subsystem · 0.3byzantine fault tolerance · 0.3
YearPublicationVenuePosition
2012 CheapBFT: resource-efficient byzantine fault tolerance
abstract
One of the main reasons why Byzantine fault-tolerant (BFT) systems are not widely used lies in their high resource consumption: 3f+1 replicas are necessary to tolerate only f faults. Recent works have been able to reduce the minimum number of replicas to 2f+1 by relying on a trusted subsystem that prevents a replica from making conflicting statements to other replicas without being detected. Nevertheless, having been designed with the focus on fault handling, these systems still employ a majority of replicas during normal-case operation for seemingly redundant work. Furthermore, the trusted subsystems available trade off performance for security; that is, they either achieve high throughput or they come with a small trusted computing base.
Rüdiger Kapitza, Johannes Behl, Christian Cachin, Tobias Distler, Simon Kuhnle, Seyed Vahid Mohammadi, Wolfgang Schröder-Preikschat, Klaus Stengel
EuroSys6