Toggle Main Menu Toggle Search

Open Access padlockePrints

The Power of Anonymous Veto in Public Discussion

Lookup NU author(s): Professor Feng Hao


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


The Dining Cryptographers problem studies how to securely compute the boolean-OR function while preserving the privacy of each input bit. Since its first introduction by Chaum in 1988, it has attracted a number of solutions over the past twenty years. In this paper, we propose an exceptionally efficient solution: Anonymous Veto Network (or AV-net). Our protocol is provably secure under the Decision Diffie-Hellman (DDH) and random oracle assumptions, and is better than past work in the following ways. It provides the strongest protection of each input’s privacy against collusion attacks; it requires only two rounds of broadcast, fewer than any other solution; the computational load and bandwidth usage are the least among the available techniques; and the efficiency of our protocol is achieved without relying on any private channels or trusted third parties. Overall, the efficiency of our protocol seems as good as one may hope for.

Publication metadata

Author(s): Hao F, Zielinski P

Editor(s): Moreno, E.D., Gavrilova, M., Tan, C.J.K.

Publication type: Book Chapter

Publication status: Published

Book Title: Transactions on Computational Science

Year: 2009

Volume: 5430

Pages: 41-52

Series Title: Lecture Notes in Computer Science

Publisher: Springer

Place Published: Berlin; New York


DOI: 10.1007/978-3-642-01004-0_3

Library holdings: Search Newcastle University Library for this item

ISBN: 9783642010033