An Adaptively Secure Mix-Net Without Erasures

Douglas Wikström and Jens Groth

Automata, Languages and Programming — ICALP 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4052, pp. 276–287, 2006.

We construct the first mix-net that is secure against adaptive adversaries corrupting any minority of the mix-servers and any set of senders. The mix-net is based on the Paillier cryptosystem and analyzed in the universal composability model without erasures under the decisional composite residuosity assumption, the strong RSA-assumption, and the discrete logarithm assumption. We assume the existence of ideal functionalities for a bulletin board, key generation, and coin-flipping.

BibTeX Citation

@inproceedings{WiGr06,
    author       = {Douglas Wikström and Jens Groth},
    title        = {An Adaptively Secure Mix-Net Without Erasures},
    editor       = {Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener},
    booktitle    = {Automata, Languages and Programming --- ICALP 2006},
    pages        = {276--287},
    series       = {Lecture Notes in Computer Science},
    volume       = {4052},
    year         = {2006},
    publisher    = {Springer-Verlag},
}