In the usual sense of public-key cryptography, a key generation procedure invariantly contains the following step:
Here, F is some efficient and one-way function which maps from the private key space to the public-key space. Due to the one-way property of the function F (a good mixing-transformation),
public-key computed from
private-key always contains a part which looks random.
With every public key containing a random-looking part, it is obviously necessary that a principal’s public key be associated with the principal’s identity information in a verifiable ...