1996-11-18 - Re: Members of Parliament Problem

Header Data

From: Simon Spero <ses@tipper.oit.unc.edu>
To: Adam Back <aba@dcs.ex.ac.uk>
Message Hash: 7131687ce6ce7bac574260c72501f7b055ee03c4feda0a08c20239444db40bb4
Message ID: <Pine.SUN.3.91.961117222151.12758A-100000@tipper.oit.unc.edu>
Reply To: <199611171837.SAA00457@server.test.net>
UTC Datetime: 1996-11-18 03:24:12 UTC
Raw Date: Sun, 17 Nov 1996 19:24:12 -0800 (PST)

Raw message

From: Simon Spero <ses@tipper.oit.unc.edu>
Date: Sun, 17 Nov 1996 19:24:12 -0800 (PST)
To: Adam Back <aba@dcs.ex.ac.uk>
Subject: Re: Members of Parliament Problem
In-Reply-To: <199611171837.SAA00457@server.test.net>
Message-ID: <Pine.SUN.3.91.961117222151.12758A-100000@tipper.oit.unc.edu>
MIME-Version: 1.0
Content-Type: text/plain


On Sun, 17 Nov 1996, Adam Back wrote:

> Simon Spero <ses@tipper.oit.unc.edu> writes:
> 
> Reasonable, except that it's linkable.  You may not want it to be
> linkable, because the more messages signed with the key, the greater
> the chance that speech paterns give away the speaker.

How about using ephemerialish keys (keys issued in big batches, etc)? 
All you need is a quick way to generate a few hundred or thousand RSA keys...

Simon





Thread