Twitter
Facebook
LinkedIn
Google+
YouTubeusenix conference policies
You are here
Home ยป Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Abstract:
We propose a new technique for making mix nets robust, called randomized partial checking (RPC). The basic idea is that rather than providing a proof of completely correct operation, each server provides strong evidence of its correct operation by revealing a pseudo-randomly selected subset of its input/output relations.
BibTeX
@inproceedings {270557,
author = {Markus Jakobsson and Ari Juels and Ronald L. Rivest},
title = {Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking},
booktitle = {11th USENIX Security Symposium (USENIX Security 02)},
year = {2002},
address = {San Francisco, CA},
url = {https://www.usenix.org/conference/11th-usenix-security-symposium/making-mix-nets-robust-electronic-voting-randomized},
publisher = {USENIX Association},
month = aug
}
author = {Markus Jakobsson and Ari Juels and Ronald L. Rivest},
title = {Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking},
booktitle = {11th USENIX Security Symposium (USENIX Security 02)},
year = {2002},
address = {San Francisco, CA},
url = {https://www.usenix.org/conference/11th-usenix-security-symposium/making-mix-nets-robust-electronic-voting-randomized},
publisher = {USENIX Association},
month = aug
}
connect with us