[365] in cryptography@c2.net mail archive
Re: Digital Signatures
daemon@ATHENA.MIT.EDU (weboland@globalkey.com)
Mon Mar 17 12:15:20 1997
From: weboland@globalkey.com
Date: Mon, 17 Mar 1997 10:09:54 -0700
To: cryptography@c2.net
Perry / Adam:
=0ARegarding your term "keyed hash". Are you including in
this term the methodology in which a message hash is "encrypted" with a
symmetric algorithm using a "shared" secret key?
=0A As with any method
used, the basis for user authentication is two-fold:
1. Is there
adequate binding between the user and the "secret" value, and =
2. =
Has this binding been compromised?
=0AI would think that, in some
applications where the pairwise authentication is limited, the above
requirements can be met at higher levels of assurance using symmetric
and/or secret sharing methodologies (assuming adequate encryption
parameters, secret key exchange methodologies, and etc.) in that a
trusted third party (i.e. a 'CA') could be removed from the trust
model.
=0AWalt
