Jeroen writes:
Here is a scenario: Scott wants Alice to generate a key pair after
which he will receive Alice's public key. At the same time, Scott wants
to make sure that this key pair is newly generated (has not been used
before).
How about a discrete log key where you fix p, q, and g.
Another problem with this problem is that there are trivial solutions
because it is difficult to ensure that SEED1 is functionally essential
in the public key. For example, generate a public key PK using a
normal method, and define the new public key PK' = (PK, SEED1). Then to
encrypt to PK' the
