DATASHARENETWORK A Decentralized Privacy-Preserving Search Engine for Investigative Journalists

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.

Succinct zero knowledge proofs (i.e. zkSNARKs) are powerful cryptographic tools that enable a prover to convince a verifier that a given statement is true without revealing any additional information. Their attractive privacy properties have led to much ac ...

We propose a novel, minimally intrusive approach to adding fault tolerance to existing complex scientific simulation codes, used for addressing a broad range of time-dependent problems on the next generation of supercomputers. Exascale systems have the pot ...

The concept of the IntegrCiTy platform is built around the development of a single application as a suite of independent software: project partners will mutualize a certain number of tools that shall be integrated in the IntegrCiTy platform. Therefore, a r ...

Bias-resistant public randomness is a critical component in many (distributed) protocols. Existing solutions do not scale to hundreds or thousands of participants, as is needed in many decentralized systems. We propose two large-scale distributed protocols ...

The actor model has been a model of choice for building reliable distributed systems. On one hand, it ensures that message-processing is serialized within each actor, preserving the familiar sequential programming model. On the other hand, programs written ...

Events on the Web are increasingly being produced in the form of data streams, and are present in many different scenarios and applications such as health monitoring, environmental sensing or social networks. The heterogeneity of event streams has raised t ...

LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based ...

The increased number of cores integrated on a chip has brought about a number of challenges. Concerns about the scalability of cache coherence protocols have urged both researchers and practitioners to explore alternative programming models, where cache co ...

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

The constant increase in single core frequency reached a plateau during recent years since the produced heat inside the chip cannot be cooled down by existing technologies anymore. An alternative to harvest more computational power per die is to fabricate ...

Some anonymity schemes, such as DC-nets and MIX cascades, can guarantee anonymity even against traffic analysis – provided messages are independent and unlinkable. Users in practice often desire pseudonymity – sending messages intentionally linkable to eac ...

The distinct lattice spring model (DLSM) is a newly developed numerical tool for modeling rock dynamics problems, i.e. dynamic failure and wave propagation. In this paper, parallelization of DLSM is presented. With the development of parallel computing tec ...

In this paper, we evaluate the performances of state-of-the art higher-order masking schemes for the AES. Doing so, we pay a particular attention to the comparison between specialized solutions introduced exclusively as countermeasures against side-channel ...

A method and device for predicting faults in a distributed heterogeneous IT system (100), the method comprising: creating a local checkpoint (19) in an explorer node (10) of said system (100), said local checkpoint (19) reflecting the state of said explore ...

In the k-set agreement problem, each processor starts with a private input value and eventually decides on an output value. At most k distinct output values may be chosen, and every processor's output value must be one of the proposed values. We consider a ...

We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolerating the largest possible number t of Byzantine storage component failures ( ...

Security in mobile communications is a topic of increasing relevance in everyday life. We all use mobile devices for everyday communications, maybe even for exchanging confidential information with the work place. This requires security systems that are re ...

We consider communication of two degraded mes- sage sets over graphs where a common source sends two prioritized messages (a common and a private message) to several receivers. All receivers require the common message and a subset of the receivers require ...

The power of an object type T can be measured as the maximum number n of processes that can solve consensus using only objects of T and registers. This number, denoted cons(T), is called the consensus power of T. This paper addresses the question of the we ...

We present ProtoPeer, a peer-to-peer systems prototyping toolkit that allows for switching between the event driven simulation and live network deployment without changing any of the application code. ProtoPeer exports a set of APIs for message passing, me ...

DATASHARENETWORK A Decentralized Privacy-Preserving Search Engine for Investigative Journalists

Chat with Graph Search

EOS: Efficient Private Delegation of zkSNARK Provers

A Minimally Intrusive Low-Memory Approach to Resilience for Existing Transient Solvers

IntegrCiTy - D2.3 Report - Enabling and integrating a common IT structure: Definition of a back-end layer architecture

Scalable Bias-Resistant Distributed Randomness

Isolates, channels, and event streams for composable distributed programming

Reactive Processing of RDF Streams of Events

Asynchronous Decoding of LDPC Codes over BEC

Efficient Communication and Synchronization on Manycore Processors

Computing in social networks

High-Performance Communication Primitives and Data Structures on Message-Passing Manycores : Broadcast and Map

Hang With Your Buddies to Resist Intersection Attacks

Parallelization of the distinct lattice spring model

Masking vs. Multiparty Computation: How Large Is the Gap for AES?

A method and device for predicting faults in an it system

The Complexity Of Early Deciding Set Agreement

The complexity of robust atomic storage

A Mobile World of Security

Degraded two-message multicast over graphs

Failure detectors as type boosters

ProtoPeer: from Simulation to Live Deployment in One Step