Alice to bob ­ - "i’m alice", {ra}bob

bob to alice ­ - {ra, rb}alice

alice to bob ­- e(rb, k)

where ra and rb are the nonces (respectively from alice and from bob), k is the shared symmetric key.

{} is encryption with specified public key.

is encryption with specified private key.

if k = h(ra ,rb ). does this protocol provide for plausible deniability? if so, why? if not, slightly modify the protocol so that it does, while still providing mutual authentication and a secure session key.