Cryptology ePrint Archive: Report 2014/983

Public Verification of Private Effort

Giulia Alberini and Tal Moran and Alon Rosen

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 publicly-verifiable protocol. The soundness of the transformation relies on expansion properties of the certification graph.

Our results are applicable to a variety of settings in which crowd-sourced information gathering is required. This includes crypto-currencies, political polling, elections, recommendation systems, viewer voting in TV shows, and prediction markets.

Category / Keywords: cryptographic protocols / polling, anonymity, random graphs, public verifiability, proof of work, CAPTCHA

Date: received 6 Dec 2014

Contact author: alon rosen at idc ac il

Available format(s): PDF | BibTeX Citation

Version: 20141207:153438 (All versions of this report)

Short URL: ia.cr/2014/983

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]