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.
In this paper, we present PDP, a distributed polling protocol that enables a set of participants to gather their opinion on a common interest without revealing their point of view. PDP does not rely on any centralized authority or on heavyweight cryptography. PDP is an overlay-based protocol where a subset of participants may use a simple sharing scheme to express their votes. In a system of participants arranged in groups of size where at least participants are honest, PDP bounds the probability for a given participant to have its vote recovered with certainty by a coalition of dishonest participants by , where is the proportion of participants splitting their votes, and a privacy parameter. PDP bounds the impact of dishonest participants on the global outcome by $2(k&alpha + BN), where represents the number of dishonest nodes using the sharing scheme.