A Secure and Verifiable Voting System
meese writes "The cryptographer David Chaum, through discussion with top cryptographers such as Ron Rivest, has designed a secure and verifiable voting system. One of the goals of his design is that anyone can verify that votes were tabulated correctly. It's good to see real security/crypto people working on this problem. They also have a press release."
What can be proven outside the voting booth is that the vote was valid and counted in the process. What the actual vote was cannot be proven without releasing every audit step... and part of the paradigm is that half of the audit steps are released.
[TMB]
Sorry to bitch about your sig but it is truly lame. First off any negative number squared is equal to it's absolute squared. It's called a root for a reason.
e.g.
(-A)^2 = A^2 therefore for all A in \bbbz A = 0.
Which is total and utter nonsense.
People like you dumb society down too much. Go play in traffic or something.
Tom
Someday, I'll have a real sig.