Toggle Main Menu Toggle Search

Open Access padlockePrints

A 2-Round Anonymous Veto Protocol

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 network (or DC-net) is a seminal technique devised by Chaum to solve the dining cryptographers problem — namely, how to send a boolean-OR bit anonymously from a group of participants. In this paper, we investigate the weaknesses of DC-nets, study alternative methods and propose a new way to tackle this problem. Our protocol, Anonymous Veto Network (or AV-net), overcomes all the major limitations of DC-nets, including the complex key setup, message collisions and susceptibility to disruptions. While DC-nets are unconditionally secure, AV-nets are computationally secure under the Decision Diffie-Hellman (DDH) assumption. An AV-net is more efficient than other techniques based on the same public-key primitives. It requires only two rounds of broadcast and the least computational load and bandwidth usage per participant. Furthermore, it provides the strongest protection against collusion — only full collusion can breach the anonymity of message senders.

Publication metadata

Author(s): Hao F, Zielinski P

Editor(s): Christianson, B., Crispo, B., Malcolm, J.A., Roe, M.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Security Protocols: 14th International Workshop

Year of Conference: 2009

Pages: 202-211

ISSN: 0302-9743 (Print) 1611-3349 (Online)

Publisher: Springer


DOI: 10.1007/978-3-642-04904-0_28

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783642049033