Bruce Schneier has described a method in one of his books (can't remember which , but read most of them - it's worth your while if you are interested in thing relating to computer security), by which it is possible to conduct a secure, secret and verifiable ballot. It's possible to see who has voted, and to sum the votes for each candidate, and each voter can verify that his/her vote is correct, but noone can discover what each voter voted.

IMHO one of the problems is not just the ballot counting, but the voter registration - I'm still amazed that the US does'nt have an upto date registry over the inhabitants their whereabouts etc. so a complete list of voters easily (and without the almost neverending legal squabbles) can be produced.

But none of this refers to perl in any way.

Update: Just remembered! I think that it's in Beyond Fear. The covernotes include: Will computerized voting machines make election results more accurate?

---

---

• Are you posting in the right place? Check out Where do I post X? to know for sure.
• Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:

  <code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>

• Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
• Want more info? How to link or How to display code and escape characters are good places to start.