Skip to content

Anonymity Preserving Byzantine Vector Consensus

Proceedings of the European Symposium on Research in Computer Security (ESORICS'20)

Authored by:
Christian Cachin, University of Bern
Daniel Collins, University of Sydney
Tyler Crain, University of Sydney
Vincent Gramoli, University of Sydney

 

Collecting anonymous opinions has applications from whistleblowing to complex voting, where participants rank candidates by order of preference. Unfortunately, as far as we know, there is no efficient distributed solution to this problem. Previous solutions either require trusted third parties, are inefficient or sacrifice anonymity.

In this paper, we propose a distributed solution called the Anonymised Vector Consensus Protocol (AVCP) that reduces the problem of agreeing on a set of anonymous votes to the binary Byzantine consensus problem. The key idea to preserve the anonymity of voters—despite some of them act-ing maliciously—is to detect double votes through traceable ring signatures. AVCP is resilient-optimal as it tolerates up to a third of Byzantine participants.

We prove our algorithm correct and show that it preserves anonymity with, at most, linear communication overhead and constant message overhead when compared to a recent consensus baseline.

Finally, we demonstrate empirically that the protocol is practical by deploying it on 100 machines geo-distributed in three continents: America, Asia and Europe. Anonymous decisions are reached within 10 seconds with a conservative choice of traceable ring signatures.

Redbelly Network Pty Ltd
304/74 Pitt St. Sydney 
NSW 2000, Australia

© Redbelly Network 2022