Optimistic mixing for exit-polls

  • Golle P
  • Zhong S
  • Boneh D
 et al. 
  • 32


    Mendeley users who have this article in their library.
  • 67


    Citations of this article.


We propose a new mix network that is optimized to produce a correct output very fast when all mix servers execute the mixing protocol correctly (the usual case). Our mix network only produces an output if no server cheats. However, in the rare case when one or several mix servers cheat, we convert the inputs to a format that allows "back-up" mixing. This back-up mixing can be implemented using any one of a wide array of already proposed (but slower) mix networks. When all goes well,our mix net is the fast est, both in real terms and asymptotically, of all those that offer standard guarantees of privacy and correctness. In practice, this benefit far outweighs the drawback of a comparatively complex procedure to recover from cheating. Our new mix is ideally suited to compute almost instantly the output of electronic elections, whence the name "exit-poll" mixing.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Philippe Golle

  • Sheng Zhong

  • Dan Boneh

  • Markus Jakobsson

  • Ari Juels

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free