Public verification of private effort

2Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce a new framework for polling responses from a large population. Our framework allows gathering information without violating the responders’ anonymity and at the same time enables public verification of the poll’s result. In contrast to prior approaches to the problem, we do not require trusting the pollster for faithfully announcing the poll’s results, nor do we rely on strong identity verification. We propose an “effort based” polling protocol whose results can be publicly verified by constructing a “responder certification graph” whose nodes are labeled by responders’ replies to the poll, and whose edges cross-certify that adjacent nodes correspond to honest participants. Cross-certification is achieved using a newly introduced (privately verifiable) “Private Proof of Effort” (PPE). In effect, our protocol gives a general method for converting privately-verifiable proofs into a publiclyverifiable protocol. The soundness of the transformation relies on expansion properties of the certification graph. Our results are applicable to a variety of settings inwhich crowd-sourced information gathering is required. This includes crypto-currencies, political polling, elections, recommendation systems, viewer voting inTVshows, and prediction markets.

Cite

CITATION STYLE

APA

Alberini, G., Moran, T., & Rosen, A. (2015). Public verification of private effort. In Lecture Notes in Computer Science (Vol. 9015, pp. 169–198). Springer Verlag. https://doi.org/10.1007/978-3-662-46497-7_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free