Security '02 Abstract
Making Mix Nets Robust For Electronic Voting By
Randomized Partial Checking
Markus Jakobsson and Ari Juels, RSA Laboratories
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.
- View the full text of this paper in PDF or
PostScript. Until August 2003, you will need your USENIX membership identification in order to access the full papers.
The Proceedings are published as a collective work, © 2002 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
- To become a USENIX Member, please see our Membership Information.
|