Re: Q: One-way functions

From: Paul Crowley (paul@JUNKCATCHER.ciphergoth.org)
Date: 03/31/03 

From: Paul Crowley <paul@JUNKCATCHER.ciphergoth.org>
Date: Mon, 31 Mar 2003 09:30:15 GMT

daw@mozart.cs.berkeley.edu (David Wagner) writes:

> John A. Malley wrote:
> >So this means the existence of signiture schemes, identification
> >schemes, telephone coin flipping, private-key cryptosystems and
> >pseudorandom generators require P != UP intersect coUP.
>
> Naah. I think one-way functions suffice for all of those.
> (though I'm not sure about telephone coin-flipping).

>From memory, pseudorandom generators are sufficient for bit
commitment, which is sufficient for telephone coin flipping. 

-- 
  __  Paul Crowley
\/ o\ sig@paul.ciphergoth.org
/\__/ http://www.ciphergoth.org/