[136303] in cryptography@c2.net mail archive
Re: combining entropy
daemon@ATHENA.MIT.EDU (Jonathan Katz)
Mon Oct 27 21:40:11 2008
Date: Mon, 27 Oct 2008 18:53:38 -0400 (EDT)
From: Jonathan Katz <jkatz@cs.umd.edu>
To: John Denker <jsd@av8n.com>
cc: Cryptography <cryptography@metzdowd.com>
In-Reply-To: <4903845A.2010106@av8n.com>
On Sat, 25 Oct 2008, John Denker wrote:
> On 10/25/2008 04:40 AM, IanG gave us some additional information.
>
> Even so, it appears there is still some uncertainty as to
> interpretation, i.e. some uncertainty as to the requirements
> and objectives.
>
> I hereby propose a new scenario. It is detailed enough to
> be amenable to formal analysis. The hope is that it will
> satisfy the requirements and objectives ... or at least
> promote a more precise discussion thereof.
>
> We start with a group comprising N members (machines or
> persons). Each of them, on demand, puts out a 160 bit
> word, called a "member" word. We wish to combine these
> to form a single word, the "group" word, also 160 bits
> in length.
<snip>
If you are interested in something with a formal analysis, you should
check out work on (single-source or multiple-source) extractors.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
