Re: Bar Code Scheme for Ballot

From: Edward Cherlin <edward_dot_cherlin_at_etssg_dot_com>
Date: Tue Aug 26 2003 - 17:24:38 CDT

On Thursday 21 August 2003 03:19 pm, David Mertz wrote:
> |For one thing, your example illustrates a very sparse bar
> | code. Ours will certainly be much more dense than that.
> Sure. But mostly that is just an artifact of my attempt at
> ASCII representation (it's about like postal bar codes). I
> think I could recognize familiar patterns in most (but not
> all) of the samples pointed out.
> How about including the following in the document:
> The demo will evalulate whether an exposed bar code presents
> a danger of compromising anonymity.
> I certainly do not think the matter is intractable. It's just
> a question of whether we might need to include some kind of
> flap of paper and/or deliberate obfuscation of the positions
> of vote choices. Neither of those things is inordinately
> difficult, and quite possibly both are unnecessary. I'm just
> not sure at this point.

Vilsual obscuration of the data is trivial. XOR it with
pseudo-random data generated from a key value somewhere else on
the ballot. The scanned data can then be read by XORing again
with the same pseudo-random data stream generated from the same

> --
> mertz@ _/_/_/_/_/_/_/ THIS MESSAGE WAS BROUGHT TO YOU
> BY:_/_/_/_/ v i gnosis _/_/ Postmodern
> Enterprises _/_/ s r .cx _/_/ MAKERS OF CHAOS....
> _/_/ i u _/_/_/_/_/ LOOK FOR IT

Edward Cherlin, Simputer Evangelist
Encore Technologies (S) Pte. Ltd.
Computers for all of us,
= The content of this message, with the exception of any external 
= quotations under fair use, are released to the Public Domain    
Received on Sun Aug 31 23:17:16 2003

This archive was generated by hypermail 2.1.8 : Sun Aug 31 2003 - 23:17:18 CDT