A 2-Round Anonymous Veto Protocol

  • Feng Hao
  • Piotr Zieliński
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5087)
Cite this paper as:
Hao F., Zieliński P. (2009) A 2-Round Anonymous Veto Protocol. In: Christianson B., Crispo B., Malcolm J.A., Roe M. (eds) Security Protocols. Security Protocols 2006. Lecture Notes in Computer Science, vol 5087. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Feng Hao
    • 1
  • Piotr Zieliński
    • 1
  1. 1.Computer LaboratoryUniversity of CambridgeUK

Personalised recommendations