Publication

Efficient Protocols for Set Membership and Range Proofs

Related publications (38)

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.

The Exact Hausdorff Measure of the Zero Set of Fractional Brownian Motion

Thomas Mountford, Driss Baraka

Let {X(t), t is an element of R-N} be a fractional Brownian motion in R-d of index H. If L(0,I) is the local time of X at 0 on the interval I subset of R-N, then there exists a positive finite constant c(=c(N,d,H)) such that ...

Springer US2011

Drawing Hamiltonian cycles with no large angles

János Pach

Let n >= 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n straight-line edges such that the angle between any two consecutive edges is at m ...

Springer-Verlag2010

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

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

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

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

Diffusion LMS algorithms with information exchange

Ali H. Sayed

We consider the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest. We motivate and propose new versions of the diffusion LMS algorithm, including a version that outperforms previous sol ...

IEEE2008

Even Small Birds are Unique: Population Protocols with Identifiers

Rachid Guerraoui, Eric Ruppert

Although much research has been devoted to designing and experimenting on ad hoc networks of tiny devices, very little has focussed on devising theoretical models to capture the inherent power and limitations of such networks. A notable exception is the po ...

2007

From Set Membership to Group Membership: A Separation of Concerns

André Schiper

We revisit the well-known group membership problem and show how it can be considered a special case of a simple problem, the set membership problem. In the set membership problem, processes maintain a set whose elements are drawn from an arbitrary universe ...

2006

The security of VANETs

Jean-Pierre Hubaux, Maxime Raya

In this work, we address the security of VANETs. We provide a detailed threat analysis and devise an appropriate security architecture. We also describe some major design decisions still to be made, which in some cases have more than mere technical implica ...

2005