Assume we have a protocol in which a party receives an encrypted random polynomial. The polynomial is encrypted using his public key.
We want to construct a simulator for this party (so this party is corrupted). We want to show that in both models (i.e. real and ideal) it receives the random polynomial so they are indistinguishable.
When we construct the simulator for the party, do we need to pass the secret key of the party to the adversary? (so the adversary in the ideal model can decrypt the message and retrieve the random polynomial)
We can ignore encryption and only pass the random polynomial to the adversary.