[12324] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: Key Pair Agreement?

daemon@ATHENA.MIT.EDU (Matt Crawford)
Tue Jan 21 11:52:46 2003

X-Original-To: cryptography@wasabisystems.com
X-Original-To: cryptography@wasabisystems.com
Date: Tue, 21 Jan 2003 10:33:24 -0600
From: Matt Crawford <crawdad@fnal.gov>
In-reply-to: "20 Jan 2003 23:34:59 GMT." <b0i133$q4v$1@abraham.cs.berkeley.edu>
To: cryptography@wasabisystems.com

The freshness requirement without the safety requirement is trivial
in RSA -- let Scott choose the public exponent.

No, probably not sufficient for anyone's real needs.

At the other extreme, you could go all the way to a Frankel-style
shared key generation protocol, and let Scott give Alice his half
afterward.

Has anyone publicly implemented shared key & signature generation or
Frankel, Gemmell, MacKenzie and Yung, 1997, "Proactive RSA"?

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com

home help back first fref pref prev next nref lref last post