It's a truly independent random key, looks basically the same as the key that we used, to derive from the G to the A and the G to the B. Now I'd like to point out that the Hash Diffie-Hellman assumption is actually a stronger assumption than the Computational Diffie-Hellman assumption. 