Publication

DATASHARENETWORK A Decentralized Privacy-Preserving Search Engine for Investigative Journalists

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.

Smart video surveillance system preserving privacy

Touradj Ebrahimi, Frédéric Dufaux

In this paper, we present a smart video surveillance system based on standard technologies and wired or wireless IP networking. The key novelty of the system is that it protects the privacy of people under surveillance. More specifically, a video analysis ...

2005

Towards JMS Compliant Group Communication - a Semantic Mapping

André Schiper, Matthias Wiesmann, Stefan Pleisch, Arnas Kupsys

Group communication provides communication primitives with various semantics and their use greatly simplifies the development of highly available services. However, despite tremendous advances in research and numerous prototypes, group communication stays ...

2004

Robust Emulations of Shared Memory in a Crash-Recovery Model

Rachid Guerraoui, Ron Levy

A shared memory abstraction can be robustly emulated over an asynchronous message passing system where any process can fail by crashing and possibly recover (crash-recovery model), by having (a) the processes exchange messages to synchronize their read and ...

2004

A Model for Parallel Programming over CORBA

Existing models for parallel programming over Common Object Request Broker Architecture (CORBA) do not address issues specific to parallel programming over a Network of Workstations (NOWs). This paper presents P-CORBA, a model for parallel programming over ...

2004

How fast can a distributed atomic read be?

Rachid Guerraoui, Ron Levy, Partha Dutta, Arindam Chakraborty

This paper addresses the problem of designing an efficient implementation of a basic atomic read-write data structure over an asynchronous message-passing system. In particular, we consider time-efficient implementations of this abstraction in the case of ...

2004

NASCENT: Network Layer Service for Vicinity Ad-hoc Groups

Jean-Pierre Hubaux, Jun Luo

Many envisioned applications of ad hoc networks involve only small-scale networks that we term Vicinity Ad-hoc Groups (VAGs). Distributed coordination services, instead of pairwise communications, are the primary requirements of VAGs. Existing designs for ...

2004

Towards JMS-Compliant Group Communication

André Schiper, Matthias Wiesmann, Stefan Pleisch, Arnas Kupsys

2003

Mutual Exclusion in Asynchronous Systems with Failure Detectors

Rachid Guerraoui

This paper defines the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem. This failure detector, which we call the trusting failure detector, and which we denot ...

2002

Neko: A Single Environment to Simulate and Prototype Distributed Algorithms

André Schiper, Xavier Défago

Neko: A Single Environment to Simulate and Prototype Distributed Algorithms Peter Urban, Xavier Defago and Andre Schiper Designing, tuning, and analyzing the performance of distributed algorithms and protocols are complex tasks. A major factor that contrib ...

2001

Processing Transactions over Optimistic Atomic Broadcast Protocols

André Schiper, Fernando Pedone

Atomic broadcast primitives allow fault-tolerant cooperation between sites in adistributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, scalable applications on top of atomic ...

1999