Publication

Efficient secure aggregation in VANETs

Related publications (51)

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.

Liberalization and Competition in Postal Markets: Decentralized Infrastructure versus Cherry Picking

Martin Maegli

New entrants in postal markets usually set up delivery networks by concentrating on urban areas and large business customers. This implies that they operate their network highly centralized - at least in early phases of entrance. ...

2010

Hierarchical diffusion algorithms for distributed estimation

Ali H. Sayed

We study the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest from their measurements. Distributed implementations avoid the use of a fusion center and distribute the processing and co ...

IEEE2009

Gaussian Diamond Network with Adversarial Jammer

Suhas Diggavi, Soheil Mohajerzefreh

In this paper we consider communication from a source to a destination over a wireless network with the help of a set of authenticated relays. We focus on a special ``diamond'' network, where there is no direct link between the source and the destination; ...

2009

Through thickness air permeability of prepregs during cure

Véronique Michaud, Sandra Sequeira Lopes Tavares

An experimental method based on a falling pressure measurement is proposed to evaluate the through thickness air permeability of prepregs during cure, with two set-up variants. One concerns the measurement of the inherent air permeability and the other app ...

2009

Alumni Profiles

Former PhD students, post-docs and junior researchers of the Section de chimie et biochimie now holding positions at different universities and private companies remember the time they spent in Geneva and give an account of how this has set off and influen ...

2009

A Topological Treatment of Early-Deciding Set-Agreement

Rachid Guerraoui, Bastian Pochon

The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus ...

2009

On Broadcast with a Common Message over Networks

Satish Babu Korada, Dinkar Vasudevan

We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable r ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Impact of Vehicular Communications Security on Transportation Safety

Jean-Pierre Hubaux, Panagiotis Papadimitratos

Transportation safety, one of the main driving forces of the development of vehicular communication (VC) systems, relies on high-rate safety messaging (beaconing). At the same time, there is consensus among authorities, industry, and academia on the need t ...

2008

On the Specification of Partitionable Group Membership

André Schiper, Stefan Pleisch, Olivier Rütti

Group communication in partitionable systems has been the focus of many research activities over the last decade. Fault-tolerant applications in a partitionable system model generally rely on two basic services: a group membership service and a reliable mu ...

IEEE Computer Society2008

A Predicate-Based Approach to Dynamic Protocol Update in Group Communication

André Schiper, Olivier Rütti

In this paper we study dynamic protocol updates (DPU), which consist in replacing, without interruption, a given protocol during execution. We focus especially on group communication protocols. The paper proposes a methodology to conveniently describe whic ...

2008