home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!cs.utexas.edu!torn!watserv2.uwaterloo.ca!watmath!ember!pacolley
- From: pacolley@ember.UUCP (Paul Colley)
- Newsgroups: sci.crypt
- Subject: Re: Cryptographic voting
- Message-ID: <10370@ember.UUCP>
- Date: 18 Aug 92 02:32:24 GMT
- References: <9208172116.AA20035@news.cis.ohio-state.edu>
- Reply-To: pacolley@ember.UUCP (Paul Colley)
- Organization: Ember---private system
- Lines: 16
-
- In article <9208172116.AA20035@news.cis.ohio-state.edu>
- Marc.Ringuette@daisy.learning.cs.cmu.edu writes:
-
- >Thanks for the pointer, Ken. His scheme looks good. Here's a sketch:
- >
- > The election takes place between voters and k candidates, at least
- > one of whom is assumed honest. Each voter communicates with all of
- > the candidates in order to register and vote. [...]
-
- Ah, if only we could find an honest politician!
-
- - Paul Colley
- University: colley@qucis.queensu.ca
- Home: pacolley@ember.uucp watmath!ember!pacolley +1 613 545 3807
- "Every now and then, an honest man is sent to the legistlature" (unknown)
-
-