Publication

SBFT: a Scalable and Decentralized Trust Infrastructure

Related publications (33)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Considerations on the design of cut-and-cover tunnels

Aurelio Muttoni, Laurent Vulliet, Vincent Labiouse, Sylvain Plumey

The communication shows an alternative for introducing soil-structure interaction in the analysis of cut-and-cover tunnels. An uncoupled method is illustrated through two examples representative of the situations found in practice. The main features of eac ...

ELU-ULS 2006 - Symposium international sur les états limites ultimes des ouvrages géotechniques2006

Comparing Atomic Broadcast Algorithms in High Latency Networks

André Schiper, Nils Richard Ekwall

Since the introduction of the concept of failure detectors, several consensus and atomic broadcast algorithms based on these detectors have been published. The performance of these algorithms is often affected by a trade-off between the number of communica ...

2006

Language Support for Fast and Reliable Message Based Communication in Singularity OS

James Richard Larus

Message-based communication offers potential benefits of providing stronger specification and cleaner separation between components. Compared with shared-memory interactions, message passing has the potential disadvantages of being more expensive (no direc ...

2006

Securing Vehicular Communications - Assumptions, Requirements, and Principles

Jean-Pierre Hubaux, Panagiotis Papadimitratos

Among civilian communication systems, vehicular networks emerge as one of the most convincing and yet most challenging instantiations of the mobile ad hoc networking technology. Towards the deployment of vehicular communication systems, security and privac ...

2006

Improving Fast Paxos: being optimistic with no overhead

André Schiper

The paper addresses the cost of consensus algorithms. It has been shown that in the best case, consensus can be solved in two communication steps with f < n/2, and in one communication step with f < n/3 (f is the maximum number of faulty processes). This l ...

2006

Effects of ‘Spatialized’ Communication in Tightly Coupled Work

Pierre Dillenbourg, Mauro Cherubini

This technical report describes the advancements on our research on collaborative annotations of maps. Particularly, we are trying to answer the following research question: does making explicit the location references of the elements of a discourse enhanc ...

2006

On Network Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two c ...

2004

The VidTIMIT Database

This communication describes the multi-modal VidTIMIT database, which can be useful for research involving mono- or multi-modal speech recognition or person authentication. It is comprised of video and corresponding audio recordings of 43 volunteers, recit ...

IDIAP2002

Fast Indulgent Consensus with Zero Degradation

Rachid Guerraoui, Partha Dutta

This paper describes a new consensus algorithm for the asynchronous message passing system model augmented with an unreliable failure detector abstraction: channels are reliable, processes can fail by crashing, and the detection of crashes are not reliable ...

2002

The database state machine and group communication issues

Fernando Pedone

Distributed computing is reshaping the way people think about and do daily life activities. On-line ticket reservation, electronic commerce, and telebanking are examples of services that would be hardly imaginable without distributed computing. Nevertheles ...

EPFL1999