News for hackers. Stuff that matters.
Re:Programmer under oath admits computers rig elections by pandaman on Sunday April 21, 2013 @05:29PM (#5586482)
Cryptography for vote is super easy : each voter submits a secret prime number with the ballot and then the product of all such numbers is published together with the vote. It's as secret as factorization and everybody can check if their vote has been counted.
Re:Programmer under oath admits computers rig elections by njharman on Sunday April 21, 2013 @05:38PM (#5586514)
Does this stop multiple votes by same person? Votes by imaginary people? Does this stop keeping your secret prime number but discarding or changing your vote?

Super easy, you should go shopping.

Re:Programmer under oath admits computers rig elections by pandaman on Sunday April 21, 2013 @05:46PM (#5586556)
No, it also does not cure cancer and does not ensure the world peace. It only ensures that one can prove they voted and makes re-counting possible if needed.
Re:Programmer under oath admits computers rig elections by ReidZB on Sunday April 21, 2013 @06:51PM (#5586814)
Well, the grandparent's comment isn't asking if your scheme cures cancer and ensures world peace. Instead they're asking if your scheme is at least as secure as other current cryptographic voting protocols out there, the answer to which is "no."

If this problem were so trivial, then I think some of the big names in crypto would not have wasted their time on studying solutions. As it is, though, I don't think there are any convincing arguments for why this problem is "trivial." Instead, there's a laundry list of properties you want a good voting protocol to have, and developing a cryptographically secure protocol that satisfies those properties is highly nontrivial.

Re:Programmer under oath admits computers rig elections by pandaman on Sunday April 21, 2013 @07:25PM (#5586917)
This scheme is more secure than paper ballots, which are advocated as better than the current cryptographic protocols, whichever they are. Better in a sense that every property of paper ballots can be also applied to the prime multiplication plus it allows verification that you cannot have with the paper ballots.

My opponent did not question particular properties of this scheme but instead went on the tangent of properties, which none of voting methods currently has. Hence, she or he could as well request cancer cure.

Re:Programmer under oath admits computers rig elections by qb45 on Sunday April 21, 2013 @05:38PM (#5586516)
I think you meant "everybody can check if their prime has been counted".

Unless you know how to use this huge product of primes to verify that votes have been counted correctly.

Re:Programmer under oath admits computers rig elections by pandaman on Sunday April 21, 2013 @05:54PM (#5586597)
If we know all the primes issued by voters we can verify everything. It's a problem of splitting a set of primes between two disjoint sets. Knowing the product of both sets defines pretty much everything you want to know about them (including the fact that the sets are not disjoint or have members other than from the original set).